Abstract
Concept lattice is an important method and technology for data analysis and knowledge discovery, however, in this research field, many researchers focus on two-valued formal context. In this paper, we transform continuous-valued formal context into many-valued formal context first, then on the basis of many-valued formal context, the definition of the equivalence class of single attribute and formal pairs of single attribute are given. We discuss constructing formal concept lattice based on single attribute concepts, uniting concepts, updating concept and adding concepts, all these concepts are generated by union, intersection and equality of objects of formal pairs. At last, we present a fast algorithm for constructing concept lattice and analyze its complexity. It has demonstrated that the algorithm is effective by our experiments.
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
Salton, G., Wong, A., Yang, C.S.: A Vector Space Model for Automatic Indexing. Communication of the ACM 18(11), 613–620 (1975)
Du, Y.J.: An Algorithm Retrieving Rules from Web Page Based on Concept Lattice. In: Proceeding of 2005 International Conference on Machine Learning and Cybernetics, vol. 4, pp. 2368–2372 (2005)
Wille, R.: Restructuring the Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, Reidel, Dordrecht Boston pp. 445–470 (1982)
Bordat, J.P.: Calcul Pratique Du Treillis De Galois Dune Correspondance. Math. Sci. Hum. 96, 31–47 (1986)
Kuznetsov, S.O.: A Fast Algorithm for Computing All Intersections of Objects in a Finite Semi-Lattice. Automatic Documentation and Mathematical Linguistics 27(5), 11–21 (1993)
Nourine, L., Raynaud, O.: A Fast Algorithm for Building Lattices. Information Processing Letters 71, 199–204 (1999)
Qiao, S.Y., Wen, S.P., Chen, C.Y., Li, Z.G.: A Fast Algorithm for Building Concept Lattice. In: Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xi’an, pp. 163–167 (2003)
Missaoui, R., Godin, R.: Search for Concepts and Dependencies in Databases. In: Ziarko, W.P. (ed.) Rough Sets and Fuzzy Sets and Knowlwdge Discovery, pp. 16–23. Springer, London (1994)
Hu, K.Y., Lu, Y.C., Shi, C.Y.: An Integrated Mining Approach for Classification and Association Rule Based on Concept Lattice. Journal of Software 11(11), 1479–1484 (2000)
Stumme, G., Taouil, R., Bastide, Y., Lakhal, L.: Conceptual Clustering with Iceberg Concept Lattices. In: Schroder, R., Klinkenberg, S., Rping, A., Fick, N., Henze, C., Herzog, R., Molitor, O. (eds.) Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML’01), University Dortmund 763 (Oktober 2001)
Stumme, G., Taouil, R., Bastide, Y., Pasqier, N., Lakhal, L.: Computing Iceberg Concept Lattices with Titanic. J. on Knowledge and Data Engineering (KDE) 42(2), 189–222 (2002)
Rajapakse, R.K., Denham, M.: Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories. Journal of Neural Computation 17, 2291–2300 (2005)
Zhang, W.X., Liang, Y., Wu, W.Z.: Information System and Knowledge Discovery, pp. 7–9. Science Press (2003)
Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)
Chein, M.: Algorithm De Recherche Des Sous-Matrices Premiresdune Matrice. Bull. Math. Soc. Sci. Math. R. S. Roumanie 13, 21–25 (1969)
Norris, E.M.: An Algorithm for Computing the Maximal Rectangles in a Binary Relation. Revue Roumaine de Mathematiques Pures et Appliques 23(2), 243–250 (1978)
Hettich, S., Bay, S.D.: The UCI KDD Archive. University of California, Department of Information and Computer Science, Irvine, CA (1999), http://kdd.ics.uci.edu
Godin, R., Missaoui, R., April, A.: Experimental Comparison of Navigation in a Galois Lattice with Conventional Information Retrieval Methods. Int. J. Man-Machine Studies 38, 747–767
Merz, C.J., Murphy, P.: UCI Repository of Machine Learning Database (2004), http://www.es.uci.edu/mlearn/MLRepository.html
Xie, Z.P., Liu, Z.T.: Concept Lattice and Association Rule Discovery. Journal of Computer Research Development 37(12), 1415–1421 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Du, Y., Pei, Z., Li, H., Xiang, D., Li, K. (2007). New Fast Algorithm for Constructing Concept Lattice. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74477-1_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-74477-1_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74475-7
Online ISBN: 978-3-540-74477-1
eBook Packages: Computer ScienceComputer Science (R0)