Skip to main content

Using Rough Genetic and Kohonen’s Neural Network for Conceptual Cluster Discovery in Data Mining

  • Conference paper
New Directions in Rough Sets, Data Mining, and Granular-Soft Computing (RSFDGrC 1999)

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

Abstract

We consider the problem of discovering the conceptual clusters from a large database. From Z. Pawlak’s information system in rough set theory, we define an information matrix, information mappings and some concepts in data mining literature such as large sets, association rules and conceptual cluster. We propose a combined method of information matrix, Kohonen’s neural network for large set discovery and genetic algorithm for conceptual cluster validity. We present an application of our method to a student database for discovering the rules contributing to the training of the gifted students.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bezdek, J.C.: Cluster validity with fuzzy sets. J. Cybernetics 3(3) (1974)

    Google Scholar 

  2. Han, E.-H.: Hyper-graph based clustering in high dimensional data sets, Data Engineering, pp. 15–22. IEEE, Los Alamitos (1988)

    Google Scholar 

  3. Kiem, H., Phuc, D.: A combined multi-dimensional data model. In: PAKDD 1999, pp. 54–59 (1999)

    Google Scholar 

  4. Kiem, H., Phuc, D.: Using data mining in education. Magazine of science and technology development 1(4), 28–37 (1999)

    Google Scholar 

  5. Bao, H.T.: Automatic unsupervised learning on Galois lattice. In: Proceedings of IOIT conference, Hanoi, Vietnam, pp. 27–43 (1996)

    Google Scholar 

  6. Veelenturf, L.P.J.: Analysis and application of Artificial Neural Networks, pp. 182–214. Prentice hall, Englewood Cliffs (1995)

    Google Scholar 

  7. Adrians, P., Zantige, D.: Data Mining. Addison Wesley, Longman, Amsterdam (1996)

    Google Scholar 

  8. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, pp. 13–67. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  9. Pawlak, Z.: Data Mining-A Rough Set Perspective. In: Methodologies for Knowledge Discovery and Data Mining, pp. 3–12. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiem, H., Phuc, D. (1999). Using Rough Genetic and Kohonen’s Neural Network for Conceptual Cluster Discovery in Data Mining. In: Zhong, N., Skowron, A., Ohsuga, S. (eds) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing. RSFDGrC 1999. Lecture Notes in Computer Science(), vol 1711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48061-7_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48061-7_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66645-5

  • Online ISBN: 978-3-540-48061-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics