Research on Selecting a Sublattice Based on L-Context

Article Preview

Abstract:

In this paper, given a binary relation, we represented the relationship between a fuzzy graph and a fuzzy concept lattice. We introduced one of the most useful notions in Graph Theory--minimal separator. In order to make decision-making much easier, the number of concepts can be reduced by selecting a sublattice via saturating the minimal separator of a given concept, a method also proposed when converting L-context to classical context. In the end, we discussed a few open issues.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

4444-4447

Citation:

Online since:

March 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] A. Burusco and R. Fuentes-González, Construction of the L-fuzzy concept lattice, Fuzzy Sets and Systems, vol. 97 , p.109–114(1998).

DOI: 10.1016/s0165-0114(96)00318-1

Google Scholar

[2] ParthaGhosh, KrishnaKundu and DebasisSarkar, Fuzzy graph rerepresentation of a fuzzy concept lattice. Fuzzy Sets and Systems, vol. 161, p.1669–1675(2010).

DOI: 10.1016/j.fss.2009.10.027

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] 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

[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

[6] B. Ganter and R. Wille, Formal Concept Analysis, Springer, Berlin(1999).

Google Scholar