Skip to main content

A decomposition based induction model for discovering concept clusters from databases

  • Selected Papers
  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 744))

Included in the following conference series:

Abstract

This paper presents a decomposition based induction model for discovering concept clusters from databases. This model is a fundamental one for developing DBI which is one of sub-systems of the GLS discovery system implemented by us. A key feature of this model is the formation of concept clusters or sub-databases through analysis and deletion of noisy data in decomposing databases. Its development is based on the concept of Simon and Ando's nearcomplete decomposability that has been most explicitly used in economic theory. In this model, the process of discovering concept clusters from databases is a process based on incipient hypothesis generation and refinement, and many kinds of learning methods are cooperatively used in multiple learning phases for performing multi-aspect intelligent data analysis as well as multi-level conceptual abstraction and learning, so that a more robust, general discovery system can be developed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Cendrowska. PRISM: An Algorithm for Inducing Modular Rules. International Journal of Man-Machine Studies, Vol.27, (1987) 349–370.

    Google Scholar 

  2. P.J. Courtois. Decomposability — Queueing and Computer System Applications. ACADEMIC PRESS, (1977).

    Google Scholar 

  3. J.H. Gennari, P. Langley, and D. Fisher. Models of Incremental Concept Formation. Artificial Intelligence, Vol.40(No.1–3), (1989) 11–61.

    Article  Google Scholar 

  4. M. Lebowitz. Categorizing Numeric Information for Generalization. Cognitive Science, Vol.9(No. 3), (1985) 285–308.

    Article  Google Scholar 

  5. O.L. Mangasarian and W.H. Wolberg. Cancer diagnosis via linear programming. SIAM news, Vol.23(No.5), (1990) 1–18.

    Google Scholar 

  6. R.S. Michalski, J.G. Carbonell, and T.M. Mitchell. Machine Learning — An Artificial Intelligence Approach, volume Vol.1 Vol.2 Vol.3. Tioga Publishing Company, (1983 1986 1990).

    Google Scholar 

  7. S. Ohsuga. AI Paradiam and Knowledge. Proc. Symposium of New Generation Knowledge Processing, (1992) 1–21.

    Google Scholar 

  8. G. Piatetsky-Shapiro. Knowledge Discovery in Real Databases: A Report on the IJCAI-89 Workshop. AI magazine, Vol.11(No.5), (1991) 68–70.

    Google Scholar 

  9. G. Piatetsky-Shapiro. Discovery,Analysis, and Presentation of Strong Rules. Piatetsky-Shapiro and Frawley (eds.) Knowledge Discovery in Databases, (AAAI Press and The MIT Press, 1991) 229–248.

    Google Scholar 

  10. G. Piatetsky-Shapiro and W.J. Frawley (eds.). Knowledge Discovery in Databases. AAAI Press and The MIT Press, (1991).

    Google Scholar 

  11. J.W. Shavlik and T.G. Dietterich (eds.). Readings in Machine Learning. MORGAN KAUFMANN PUBLISHERS, INC., (1990).

    Google Scholar 

  12. H.A. Simon and A. Ando. Aggregation of Variables in Dynamic Systems. Econometrica, Vol.29, (1961) 111–138.

    Google Scholar 

  13. J.H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford Univ. Press, (1965).

    Google Scholar 

  14. N. Zhong and S. Ohsuga. A Consideration to Automatic Decomposition of Databases. Proc. the 5th Annual Conference of JSAI, (1991) 185–188.

    Google Scholar 

  15. N. Zhong and S. Ohsuga. Discovering Concept Clusters by Decomposing Databases. manuscript.

    Google Scholar 

  16. N. Zhong and S. Ohsuga. GLS — A Methodology for Discovering Knowledge from Databases. Proc. the 13th International CODATA Conference entitled “New Data Challenges in Our Information Age”, (1992).

    Google Scholar 

  17. N. Zhong and S. Ohsuga. Hierarchical Model Learning in Knowledge Discovery in Databases. Proc. International Conference on Intelligent Information Processing & System (ICIIPS'92), (1992) 420–423.

    Google Scholar 

  18. N. Zhong and S. Ohsuga. Attribute Calculation in Knowledge Discovery in Databases. (to appear in) Journal of Japanese Society for Artificial Intelligence, Vol.9 No.1, (1994).

    Google Scholar 

  19. N. Zhong and S. Ohsuga. Knowledge Discovery and Management in Integrated Use of KB and DB. Ohsuga et al. (eds.) Information Modelling and Knowledge Bases: Foundations, Theory and Application, (IOS Press, Amsterdam, 1992) 480–495.

    Google Scholar 

  20. N. Zhong and S. Ohsuga. An Integrated Calculation Model for Discovering Functional Relations from Databases. Proc. 4th International Conference on Database and Expert Systems Applications (DEXA '93) published in the Lecture Notes in Computer Science series, (Springer-Verlag, Heidelberg, 1993).

    Google Scholar 

  21. W. Ziarko. The Discovery, Analysis, and Representation of Data Dependencies in Databases. Piatetsky-Shapiro and Frawley (eds.) Knowledge Discovery in Databases, (AAAI Press and The MIT Press, 1991) 195–209.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Klaus P. Jantke Shigenobu Kobayashi Etsuji Tomita Takashi Yokomori

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhong, N., Ohsuga, S. (1993). A decomposition based induction model for discovering concept clusters from databases. In: Jantke, K.P., Kobayashi, S., Tomita, E., Yokomori, T. (eds) Algorithmic Learning Theory. ALT 1993. Lecture Notes in Computer Science, vol 744. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57370-4_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-57370-4_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57370-8

  • Online ISBN: 978-3-540-48096-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics