Unsupervised Concept Learning Using Rough Concept Analysis
Formal concept analysis (Wille, 1982) offers an algebraic tool for representing and analyzing formal concepts, and the rough set theory (Pawlak, 1982) offers an alternative tool to deal with vagueness and uncertainty. Rough concept analysis (Kent, 1994) is an attempt to synthesize common features of these two theories. In this work we develop a method for unsupervised concept learning in the framework of rough concept analysis that aims at finding and using concepts with their approximations.
KeywordsConcept Analysis Formal Concept Concept Lattice Formal Context Formal Concept Analysis
Unable to display preview. Download preview PDF.
- Carpineto, C., Romano G. (1996): A Lattice Conceptual Clustering System and its Application to Browsing Retrieval, Machine Learning, 10, 95–122.Google Scholar
- Diday, E. and Simon, J.C. (1976): Clustering analysis. In Digital Pattern Recognition, Diday, E. and Simon, J.C (Ed.), 47–94, Springer-Verlag.Google Scholar
- Ho, T.B. (1995): An approach to concept formation based on formal concept analysis. IEICE Trans. Information and Systems, E78-D, 553–559.Google Scholar
- Ho, T.B., Luong, C.M. (1997): Using Case-Based Reasoning in Interpreting Unsupervised Inductive Learning Results, Inter. Joint Conf. on Artificial Intelligence,Nagoya (in press).Google Scholar
- Kent, R.E. (1994): Rough concept analysis. Proc. Rough Sets, Fuzzy Sets and Knowledge Discovery, 248–255, Springer-Verlag.Google Scholar
- Michalski, R.S. (1990): Learning flexible concepts: Fundamental ideas and a method based on two-tiered representation. In Machine Learning: An Artificial Intelligence Approach, Vol. III. Michalski R.S. and Kodratoff Y. ( Eds. ), Morgan Kaufmann.Google Scholar
- Pawlak, Z. (1991): Rough Sets: Theoretical Aspects of Reasoning About Data,Kluwer Academic Publishers.Google Scholar