Abstract
We present a constraint-based approach to discovering differential equations. The approach is based on heuristic search through the space of polynomial equations and can use subsumption and evaluation constraints on polynomial equations. Constraints can be used to effectively guide the discovery of equations: using such guidance can make the difference between success and failure in the discovery of laws describing more complex systems. We illustrate this on the problem of reconstructing the differential equations describing a network of chemical reactions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayardo, R.: Constraints in data mining. SIGKDD Explorations 4(1) (2002)
De Raedt, L.: Data mining as constraint logic programming. In: Computational Logic: From Logic Programming into the Future, Springer, Berlin (2002)
Džeroski, S., Todorovski, L.: Discovering dynamics: from inductive logic programming to machine discovery. J. Intelligent Information Systems 4, 89–108 (1995)
Garofalakis, M., Rastogi, R.: Scalable data mining with model constraints. SIGKDD Explorations 2(2), 39–48 (2000)
Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM 39(11), 58–64 (1996)
Koza, J.R., Mydlowec, W., Lanza, G., Yu, J., Keane, M.A.: Reverse engineering of metabolic pathways from observed data using genetic programming. In: Proc. 6thPacific Symposium on Biocomputing, pp. 434–445. World Scientific, Singapore (2001)
Langley, P., Simon, H.A., Bradshaw, G.L., Żythow, J.M.: Scientific discovery. MIT Press, Cambridge (1987)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997)
Saito, K., Langley, P., Grenager, T., Potter, C., Torregrosa, A., Klooster, S.A.: Computational revision of quantitative scientific models. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol. 2226, pp. 336–349. Springer, Heidelberg (2001)
Todorovski, L., Džeroski, S.: Declarative bias in equation discovery. In: Proc. 14th Intl. Conference on Machine Learning, pp. 376–384. Morgan Kaufmann, San Francisco (1997)
Todorovski, L., Džski, S.: Theory revision in equation discovery. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol. 2226, pp. 390–400. Springer, Heidelberg (2001)
Washio, T., Motoda, H.: Discovering admissible models of complex systems based on scale-types and identity constraints. In: Proc. 15th Intl. Joint Conference on Artificial Intelligence, pp. 810–817. Morgan Kaufmann, San Francisco (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Džeroski, S., Todorovski, L., Ljubič, P. (2003). Using Constraints in Discovering Dynamics. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds) Discovery Science. DS 2003. Lecture Notes in Computer Science(), vol 2843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39644-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-39644-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20293-6
Online ISBN: 978-3-540-39644-4
eBook Packages: Springer Book Archive