Representing attribute reduction and concepts in concept lattice using graphs
From MaRDI portal
Publication:1703689
DOI10.1007/s00500-016-2441-2zbMath1381.68285OpenAlexW2553013474MaRDI QIDQ1703689
Publication date: 7 March 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2441-2
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (3)
A theoretical study on the object (property) oriented concept lattices based on three-way decisions ⋮ Bipolar fuzzy concept learning using next neighbor and Euclidean distance ⋮ Note on representing attribute reduction and concepts in concept lattice using graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comprehensive survey on formal concept analysis, its research trends and applications
- Characterization and reduction of concept lattices through matroid theory
- Bipolar fuzzy graph representation of concept lattice
- Attribute reduction theory and approach to concept lattice
- Fuzzy graph representation of a fuzzy concept lattice
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Representing a concept lattice by a graph
- On the Galois lattice of bipartite distance hereditary graphs
- Representing a Concept Lattice by Neighborly Ideas
- CHARACTERIZING TREES IN CONCEPT LATTICES
This page was built for publication: Representing attribute reduction and concepts in concept lattice using graphs