Proceedings

Discovering Admissible Models of Complex Systems Based on Scale-Types and Idemtity Constraints

Download BibTeX Cite

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Learning. Pages 810-818.

© 1997 International Joint Conferences on Artificial Intelligence

Abstract

SDS is a discovery system from numeric measurement data. It outperforms the existing systems in every aspect of search efficiency, noise tolerancy, credibility of the resulting equations and complexity of the target system that it can handle. The power of SDS comes from the use of the scale-types of the measurement data and mathematical property of identity by which to constrain the admissible solutions. Its algorithm is described with a complex working example and the performance comparison with other systems are discussed.

  1. [Langley et al., 1985] P.W. Langley, H.A. Simon, G. Brad- shaw and J .M. Zytkow. Scientific Discovery; Computa- tional Explomtions of the Creative Process. MIT Press, Cambridge, Massachusetts, 1987.
  2. [Koehn and Zytkow, 1986] B. Koehn and J .M. Zytkow . Experimeting and theorizing in theory formation. Proceedings of the International Symposium on Method- ologies for Intelligent Systems, pages 296-307, 1986. ACM SIGART Press.
  3. [Falkenhainer and Michalski, 1985] B.C. Falkenhainer and R.S. Michalski. Integrating Quantitative and Quali- tative Discovery: The ABACUS System. In Machine Learning, pages 367-401, Boston, 1986. Kluwer Aca- demic Publishers.
  4. [Nordhausen and Langlay, 1990] B. Nordhausen and P.W. Langlay. An Integrated Approach to Empirical Discov- ery. Computational Models of Scientific Discovery and Theory Formation. Morgan Kaufman Publishers, Inc, San Mateo, California, 1990.
  5. [Wu and Wang, 1989] Y. Wu and S. Wang. Discovering Knowledge from Observational Data. In: Piatetsky- Shapiro, G. ed. Knowledge Discovery in Database, IJCAI-89 Workshop Proceedings, pages 369-377, 1989.
  6. [Schaffer, 1990] C. Schaffer. A Proven Domain-Independent Scientific Function-Finding Algorithm. Proceedings Eighth National Conference on Artificial Intelligence, pages 828-833, 1990. AAAI Press/The MIT Press.
  7. [Huang and Zytkow, 1996] K.M. Huang and J .M. Zytkow. Robotic discovery: the dilemmas of empirical equations. [Kokar, 1985]
  8. M.M. Kokar. Determining Arguments of In- variant Functional Descriptions. In Machine Learning, pages 403-422, Boston, 1986. Kluwer Academic Pul:>- lishers.
  9. [Buckingham, 1914] E. Buckingham. On physically similar systems; Illustrations of the use of dimensional equa- tions. In Physical Review, Vol.IV, No.4, pages 345-376, 1914.
  10. [Ljung, 1987] L. Ljung. In System Identification Theory for the User, 1987. PTR Prentice Hall, Englewood Cliffs, New Jersey.
  11. [Stevens, 1946] S.S. Stevens. On the Theory of Scales of Mea- surement. In Science, pages 677-680, 1946.
  12. [Bridgman, 1922] P.W. Bridgman. In Dimensional Analysis, 1922. Yale University Press, New Haven, CT.
  13. [Kanet al., 1972] M. Kan., N. Miyata and K. Watanabe. Research on Spaciousness. In Japanese Journal of Ar- chitechture, No.193, pages 51-57, 1972.
  14. [Washio and Motoda, 1997] T. Washio and H. Motoda. Discovery of First Principle Based on Data-Driven Rea- soning. Proc. of the First Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 169-182, 1997. Singapore.
  15. [Bshouty, 1994] D. Bshouty and N.H. Bshouty. On Learning Arithmetic Read-Once Formulas with exponentiation. Proc. of the Seventh Annual ACM Conference on Com- putational Learning Theory, pages 311-317, 1994. New Brunswick, NJ.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards