A methodology for analysis of concept lattice reduction
From MaRDI portal
Publication:2293159
DOI10.1016/j.ins.2017.02.037zbMath1429.68272OpenAlexW2590078805MaRDI QIDQ2293159
Sérgio M. Dias, Newton J. Vieira
Publication date: 7 February 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.02.037
Related Items (9)
Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ Attribute reduction of SE-ISI concept lattices for incomplete contexts ⋮ Granular matrix method of attribute reduction in formal contexts ⋮ Interface between logical analysis of data and formal concept analysis ⋮ Concept lattice simplification with fuzzy linguistic information based on three-way clustering ⋮ On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method ⋮ Medical diagnoses using three-way fuzzy concept lattice and their Euclidean distance ⋮ Describing hierarchy of concept lattice by using matrix ⋮ Characterizing reducts in multi-adjoint concept lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Knowledge reduction in real decision formal contexts
- Characterization and reduction of concept lattices through matroid theory
- Concept learning via granular computing: a cognitive viewpoint
- Relations of reduction between covering generalized rough sets and concept lattices
- Attribute reduction theory and approach to concept lattice
- The multiple facets of the canonical direct unit implicational basis
- Lattice-theoretic contexts and their concept lattices via Galois ideals
- Knowledge reduction in formal contexts using non-negative matrix factorization
- Fast algorithms for implication bases and attribute exploration using proper premises
- Attribute reduction theory of concept lattice based on decision formal contexts
- Impact of Boolean factorization as preprocessing methods for classification of Boolean data
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
- Attribute reduction in generalized one-sided formal contexts
- Comparison of reduction in formal decision contexts
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- On stability of a formal concept
- Approaches to knowledge reduction in generalized consistent decision formal context
- Closure-based constraints in formal concept analysis
- Approximating Concept Stability
- Selecting Important Concepts Using Weights
- Approaches to the Selection of Relevant Concepts in the Case of Noisy Data
- ZooM: a nested Galois lattices-based system for conceptual clustering
- Computing iceberg concept lattices with Titanic
- Clusters, Concepts, and Pseudometrics
- Scalable Estimates of Concept Stability
- Simplifying Contextual Structures
This page was built for publication: A methodology for analysis of concept lattice reduction
