Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
Discovering knowledge from fuzzy concept lattice
Data mining and computational intelligence
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Fuzzy Relational Systems: Foundations and Principles
Fuzzy Relational Systems: Foundations and Principles
Concept Data Analysis: Theory and Applications
Concept Data Analysis: Theory and Applications
Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
Journal of Computer and System Sciences
Hi-index | 0.00 |
The paper presents additional results on factorization by similarity of fuzzy concept lattices. A fuzzy concept lattice is a hierarchically ordered collection of clusters extracted from tabular data. The basic idea of factorization by similarity is to have, instead of a possibly large original fuzzy concept lattice, its factor lattice. The factor lattice contains less clusters than the original concept lattice but, at the same time, represents a reasonable approximation of the original concept lattice and provides us with a granular view on the original concept lattice. The factor lattice results by factorization of the original fuzzy concept lattice by a similarity relation. The similarity relation is specified by a user by means of a single parameter, called a similarity threshold. Smaller similarity thresholds lead to smaller factor lattices, i.e. to more comprehensible but less accurate approximations of the original concept lattice. Therefore, factorization by similarity provides a trade-off between comprehensibility and precision. We first recall the notion of factorization. Second, we present a way to compute the factor lattice of a fuzzy concept lattice directly from input data, i.e. without the need to compute the possibly large original concept lattice.