×

Reconstructing concept lattices using \(n\)th-order context kernels. (English) Zbl 1115.68521

Summary: To be different from traditional algorithms for concept lattice constructing, a method based on \(n\)th-order context kernel is suggested in this paper. The context kernels support generating small lattices for sub-contexts split by a given context. The final concept lattice is reconstructed by combining these small lattices. All relevant algorithms are implemented in a system IsoFCA. Test shows that the method yields concept lattices in lower time complexity than Godin algorithm in practical case.

MSC:

68T30 Knowledge representation
68T05 Learning and adaptive systems in artificial intelligence
Full Text: DOI

References:

[1] Rudolf Wille. Why Can Concept Lattice Support Knowledge Discovery in Databases [J].Journal of Experimental and Theoretical Artificial Intelligence, 2002,14: 81–92. · Zbl 1022.68042 · doi:10.1080/09528130210164161
[2] Bordat J P. Calcul Pratique Du Treillis De Galois Dune Correspondence[J].Mathematiques at Sciences Humaines, 1986,96 (2): 31–47. · Zbl 0626.06007
[3] Godin R, Missaoui K, Alaoui H. Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices[J].Computational Intelligence, 1995,11(2): 246–267. · doi:10.1111/j.1467-8640.1995.tb00031.x
[4] Jian Songquan, Hu Xuegang, Jiang Meihua. Incremental Algorithms for Extended Concept Lattice[J].Computer Engineering and Applications, 2001, (15): 132–134 (Ch).
[5] Xie Zhipeng, Liu Zongtian. A Fast Incremental Algorithm for Building Concept Lattice [J].Chinese Journal of Computers, 2002, (5): 490–496 (Ch).
[6] |Shen Xiajiong, Han Daojun, Liu Zongtian. Improvement on Constructing Algorithm of Concept Lattices [J].Computer Engineering and Applications, 2004, (24): 100–104 (Ch).
[7] Zhang Wenxiu, Wei Ling, Qi Jianjun. Theory and Approach on Attributes Reduction of Concept Lattices [J].Science in China Ser E Information Sciences, 2005, (6): 628–639 (Ch). · Zbl 1161.68796
[8] Tonella P. Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis [J].IEEE Transactions on Software Engineering, 2003,29(6): 495–509. · doi:10.1109/TSE.2003.1205178
[9] Liu Zongtian, Li Liangsheng, Zhang Qing. Research on a Union Algorithm of Multiple Concept Lattices [C].//RSFDGrC 2003,LNAI 2639. Berlin: Springer-Verlag, 2003: 533–540. · Zbl 1026.68609
[10] Shen Xiajiong, Liu Zongtian, Zhang Qing,et al. Isomorphic Generating of Concept Lattices [C].IEEE International conference on Granular Computing, 2005. Piscataway, NJ: IEEE Inc. 2005,1: 249–252.
[11] Yun Li, Liu Zongtian, Shen Xiajiong,et al. Theoretical Research on the Distributed Construction of Concept Lattices [C]//Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xi’an: Institute of Electrical and Electronics, April, 2003: 474–479.
[12] Xie Cuihua, Li Yun, Shen Jie. A Constructing Algorithm of Concept Lattice with Attribute Generalization Based on Cloud Models [C]//The Fifth International Conference on Computer and Information Technology 2005.CIT 2005. Piscataway, NJ: IEEE Inc, 2005: 110–115.
[13] Hauaiguo Fu, Engelbert M N. A Parallel Algorithm to Generate Formal Concepts for Large Data [C]//ICFCA 2004. Sydney, Australia, May, 2004: 394–401. · Zbl 1198.68239
[14] Qi Hong, Liu Dayou, Hu Chengquan,et al. A Parallel Algorithm Based on Search Space Partition for Generating Concepts [C]//Parallel and Distributed Systems. July 2004: 241–248. · Zbl 1109.68418
[15] Zhang Qing.Data Mining Based on the Distributed Model of Concept Lattices [D]. Shanghai: Dept Comp Info Eng, Shanghai Univ, 2002.
[16] Hu Keyun, Lu Yuchang, Shi Chunyi. An Integrated Mining Approach Classification and Association Rule Based on Concept Lattice[J].Journal of Software, 2000,11(11): 1478–1484 (Ch).
[17] Ganter B, Wille R.Formal Concept Analysis: Mathematical Foundations [M]. Berlin: Springer Verlag, 1999. · Zbl 0909.06001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.