Abstract
This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a concept, including its extension and its intension, and the right hand side is the class label that the concept implies. Particularly, we show that logical concepts of the given universe are naturally associated with any consistent classification rules generated by any partition-based or covering-based algorithm, and can be characterized as a special set of consistent classification rules. An algorithm is proposed to find a set of the most general consistent concepts.
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
Cendrowska, J.: PRISM: an algorithm for inducing modular rules. International Journal of Man-Machine Studies 27, 349–370 (1987)
Clark, P., Matwin, S.: Using qualitative models to guide induction learning. In: Proceedings of International Conference on Machine Learning, pp. 49–56 (1993)
Demri, S., Orlowska, E.: Logical analysis of indiscernibility. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 347–380. Physica-Verlag, Heidelberg (1998)
Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. In: Proceedings of International Conference on Conceptual Structures, pp. 371–384 (2000)
Khan, M., Ding, Q., Perrizo, W.: K-nearest neighbor classification on spatial data streams using P-trees. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 517–528. Springer, Heidelberg (2002)
Mitchell, T.: Version Spaces: An Approach to Concept Learning, PhD thesis, Computer Science Department, Stanford University, Stanford, California (1978)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Quinlan, J.R.: Learning efficient classification procedures and their application to chess end-games. Machine Learning: An Artificial Intelligence Approach 1, 463–482 (1983)
SGI’s MLC++ utilities 2.0: the discretize utility, http://www.sgi.com/tech/mlc
UCI Machine Learning Repository, http://www1.ics.uci.edu/~mlearn/MLRepository.html
Wille, R.: Concept lattices and conceptual knowledge systems. Computers Mathematics with Applications 23, 493–515 (1992)
Yao, Y.Y.: On Modeling data mining with granular computing. In: Proceedings of COMPSAC 2001, pp. 638–643 (2001)
Yao, Y.Y., Yao, J.T.: Granular computing as a basis for consistent classification problems. In: Special Issue of PAKDD 2002 Workshop on Toward the Foundation of Data Mining, vol. 5(2), pp. 101–106 (2002)
Zhao, Y., Yao, Y.Y.: Interactive user-driven classification using a granule network. In: Proceedings of the Fifth International Conference of Cognitive Informatics (ICCI 2005), pp. 250–259 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, Y., Yao, Y. (2006). Classification Based on Logical Concept Analysis. In: Lamontagne, L., Marchand, M. (eds) Advances in Artificial Intelligence. Canadian AI 2006. Lecture Notes in Computer Science(), vol 4013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11766247_36
Download citation
DOI: https://doi.org/10.1007/11766247_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34628-9
Online ISBN: 978-3-540-34630-2
eBook Packages: Computer ScienceComputer Science (R0)