A Novel Incorporate Algorithm of Concept Lattice

Abstract:

With the expansion of the research field, the research object of some original seemingly unrelated properties have been studied together. At this time, the number of attribute in formal context has changed. For the increased attributes, we need to construct a new concept lattice. The existing incremental building algorithms of concept lattice need the original formal context as the basis, with single attribute or a set of attribute of the object to rebuild the concept lattice. They can't effectively utilize these existing concept lattice that have not relation in attributes. Here, the paper presents one new algorithm for incorporating concept lattice based on the existed concept lattices. We can directly build the together lattice from bottom to top by direct product operation on the existed concept lattices and the mapping relation between the direct product lattice of two existed concept lattices and the together lattice. Formal contexts that attribute sets have no intersection are fit for this algorithm.

• Periodical: Advanced Materials Research (Volumes 756-759)
• Pages: 2803-2807
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.756-759.2803
• Online since: September 2013
• Authors: Xi Gong
• Keywords: Component: Formal Context, Concept Lattice, Direct Product, Incorporating

References

[1] Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts. Rival I(ed). Ordered Sets. Dordrecht-Boston: Reidel Publishing Company, 1982. 445～470.

DOI: 10.1007/978-94-009-7798-3_15

[2] R Godin, G Mineau, R Missaoui, et al, Applying concept formation methods to software reuse, International Journal of Knowledge Engineering and Software Engineering, 1995, 5(1): 119～142.

DOI: 10.1142/s0218194095000071

[3] G W Mineau, R Godin, Automatic structuring of knowledge bases by conceptual clustering, IEEE Transaction on Knowledge and Data Engineering, 1995, 7(5): 824～828.

DOI: 10.1109/69.469834

[4] R Cole, P Eklund, Scalability in formal concept analysis, Computational Intelligence, 1999, 15 (1): 11～27.

DOI: 10.1111/0824-7935.00079

[5] C Carpineto, G Romano, A lattice conceptual clustering system and its application to browsing retrieval, Machine Learing, 1996, 24(2): 95～122. minutes.

DOI: 10.1007/bf00058654

[6] R Godin, R Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science, 1994, 133(5): 387～419.

DOI: 10.1016/0304-3975(94)90195-3

[7] J P Bordat, Calcul pratique du trellis de galois d'une correspondence, Mathematiques et Sciences, 1986, 96: 31～47.

[8] Lhouari Nourine, Olivier Raynaud, A fast algorithm for building lattices, Information Processing Letters, 1999, 71(5-6): 199～204.

DOI: 10.1016/s0020-0190(99)00108-8

[9] R Godin, Incremental concept formation algorithms based on Galois (concept) lattices, Computational Intelligence, 1995, 11(2): 246～267.

DOI: 10.1111/j.1467-8640.1995.tb00031.x

[10] Z.P. Xie, L.Z. Tian, A Fast Incremental Algorithm for Building Concept Lattice, Chinese Journal of Computers, 2002, 25(5): 490～496.

[11] Ganter B, Wille R. Formal concept analysis: mathematical foundations. Berlin: Springer, (1999).

[12] S.Q. Jian, X.G. Hu, M.H. Jiang, Incremental Algorithms of Extended Concept Lattice , Computer Engineering and Applications 2001, 36(15): 132～134.

[13] X.J. Shen, D.J. Han, Z.T. Liu, Jun Ma, Improvement on Constructing Algorithm of Concept Lattices, Computer Engineering and Applications, 2004, 40(24): 100～104.