Abstract
As an effective tool for knowledge discovery, concept lattice has been successfully applied to various fields. One of the key problems of knowledge discovery is knowledge reduction. This paper studies attribute reduction in concept lattice. Using the idea similar to Skowron and Rauszer’s discernibility matrix, the discernibility matrix and function of a concept lattice are defined. Based on discernibility matrix, an approach to attribute reduction in concept lattice is presented, and the characteristics of core attribute are analyzed.
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
Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, pp. 445–470. Reidel, Dordrecht (1982)
Hu, K.Y., Lu, Y.C., Shi, C.Y.: Advances in concept lattice and its application. Journal of Tsinghua University (Science & Technology) 40(9), 77–81 (2000)
Ho, T.B.: An approach to concept formation based on formal concept analysis. IEICE Trans. Information and Systems E782D(5), 553–559 (1995)
Carpineto, C., Romano, G.: GALOIS: An order-theoretic approach to conceptual clustering. In: Utgoff, P. (ed.) Proceedings of ICML, vol. 293, pp. 33–40. Elsevier, Amherst (1993)
Godin, R.: Incremental concept formation algorithm based on Galois (concept) lattices. Computational Intelligence 11(2), 246–267 (1995)
Oosthuizen, G.D.: The Application of Concept Lattice to Machine Learning. Technical Report, University of Pretoria, South Africa (1996)
Yao, Y.Y.: Concept lattices in rough set theory. In: Dick, S., Kurgan, L., Pedrycz, W., Reformat, M. (eds.) Proceedings of 2004 Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS 2004), June 27-30, pp. 796–801 (2004); IEEE Catalog Number: 04TH8736
Oosthuizen, G.D.: Rough sets and concept lattices. In: Ziarko, W.P. (ed.) Rough Sets, and Fuzzy Sets and Knowledge Discovery (RSKD 1993), pp. 24–31. Springer, London (1994)
Deogun, J.S., Saquer, J.: Concept approximations for formal concept analysis. In: Stumme, G. (ed.) Working with Conceptual Structures. Contributions to ICCS 2000, pp. 73–83. Verlag Shaker Aachen (2000)
Düntsch, I., Gediga, G.: Algebraic aspects of attribute dependencies in information systems. Fundamenta Informaticae 29(1-2), 119–133 (1997)
Pagliani, P.: From concept lattices to approximation spaces: Algebraic structures of some spaces of partial objects. Fundamenta Informaticae 18(1), 1–25 (1993)
Grigoriev, P.A., Yevtushenko, S.A.: Elements of an Agile Discovery Environment. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 311–319. Springer, Heidelberg (2003)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Berlin (1999)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support: Handbook of Applications and Advances of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, WX., Wei, L., Qi, JJ. (2005). Attribute Reduction in Concept Lattice Based on Discernibility Matrix. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W., Hu, X. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548706_17
Download citation
DOI: https://doi.org/10.1007/11548706_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28660-8
Online ISBN: 978-3-540-31824-8
eBook Packages: Computer ScienceComputer Science (R0)