Research on Computing the Covers of a Given Concept

Article Preview

Abstract:

In order to construct concept lattice without rebuilding the whole structure, we introduced some basic notions in FCA and Graph, such as concept, cover, maxmod and so on. In Section 2, we elaborated the procedures of a proposed algorithm for computing the covers by adding non-dominating maxmods to the intent of a given concept. After that we analyzed time complexity with comparison to other relevant researches and proved that our algorithm is superior to other algorithms. In the end, we discussed a few open issues.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1901-1904

Citation:

Online since:

January 2014

Keywords:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Anne Berrya, Eric SanJuanb, Alain Sigayretc, Generalized domination in closure systems. Discrete Applied Mathematics, pp.1065-1083(2006).

Google Scholar

[2] A. Berry, J. -P. Bordat and O. Cogis, Generating all the minimal separators of a graph. Internat. J. Foundations of Comput. Sci, vol. 11 p.397–404(2000).

DOI: 10.1142/s0129054100000211

Google Scholar

[3] Anne Berry and Alain Sigayret, Representing a concept lattice by a graph. Discrete Applied Mathematics, vol. 144 , p.27 – 42(2004).

DOI: 10.1016/j.dam.2004.02.016

Google Scholar

[4] Prem Kumar Singh, A method for decomposition of fuzzy formal context. Procedia Engineering 38, pp.1852-1857(2012).

DOI: 10.1016/j.proeng.2012.06.228

Google Scholar

[5] Lhouari Nourine, Olivier Raynaud, A fast algorithm for building lattices. Information Pocessing Letters, pp.199-204(1999).

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

Google Scholar