A mathematical model for concept granular computing systems
Extent-intent and intent-extent operators are introduced between two complete lattices in this paper and a mathematical model for concept granular computing system is established. We proved that the set of all concepts in this system is a lattice with the greatest element and the least element. This framework includes formal concept lattices from formal contexts, L fuzzy concept lattices from L fuzzy formal contexts and three kinds of variable threshold concept lattices, i.e. the extension and the intension of a concept are a crisp set and a crisp set, a crisp set and a fuzzy set, a fuzzy set and a crisp set, respectively. Finally, some iterative algorithms for constructing concepts are proposed and they are proved to be optimal concepts under some conditions in this system.
Keywordsgranular computing formal concept analysis concept lattice mathematical model
Unable to display preview. Download preview PDF.
- 1.Zadeh L A. Fuzzy sets and information granularity. In: Gupta N, Ragade R, Yager R, eds. Advances in Fuzzy Set Theory and Applications. Amsterdam: North-Holland, 1979. 3–18Google Scholar
- 3.Lin T Y. Granular computing on binary relations I: Data mining and neighborhood systems. In: Rough Sets in Knowledge Discovery. Berlin: Springer, 1998. 107–121Google Scholar
- 10.Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I, ed. Ordered Sets. Dordrecht-Boston: Reidel, 1982. 445–470Google Scholar
- 14.Yao Y Y. Concept lattices in rough set theory. In: Dick S, Kurgan L, Pedrycz W, et al. eds. Proceeding of 2004 Annual Meeting of the North American Fuzzy Information Processing Society. Banff: IEEE, 2004. 796–801Google Scholar
- 19.Burusco A, Fuentes-Gonzáles R. The study of the L-fuzzy concept lattice. Math Soft Comput, 1994, I: 209–218Google Scholar
- 25.Zhang W X, Qiu G F. Uncertain Decision Making Based on Rough Sets (in Chinese). Beijing: Tsinghua University Press, 2005. 184–186Google Scholar