Representing attribute reduction and concepts in concept lattice using graphs
From MaRDI portal
Publication:1703689
DOI10.1007/S00500-016-2441-2zbMATH Open1381.68285OpenAlexW2553013474MaRDI QIDQ1703689FDOQ1703689
Authors: Hua Mao
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
Recommendations
- Attribute reduction theory and approach to concept lattice
- A Novel Approach to Attribute Reduction in Concept Lattices
- Characterization and reduction of concept lattices through matroid theory
- Representing a concept lattice by a graph
- Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A comprehensive survey on formal concept analysis, its research trends and applications
- Bipolar fuzzy graph representation of concept lattice
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Attribute reduction theory and approach to concept lattice
- Fuzzy graph representation of a fuzzy concept lattice
- Representing a concept lattice by a graph
- Characterization and reduction of concept lattices through matroid theory
- Title not available (Why is that?)
- On the Galois lattice of bipartite distance hereditary graphs
- Representing a concept lattice by neighborly ideas
- CHARACTERIZING TREES IN CONCEPT LATTICES
- Breadth first search graph partitions and concept lattices
Cited In (7)
- Bipolar fuzzy concept learning using next neighbor and Euclidean distance
- A theoretical study on the object (property) oriented concept lattices based on three-way decisions
- Representing a concept lattice by a graph
- Title not available (Why is that?)
- Note on representing attribute reduction and concepts in concept lattice using graphs
- Concept lattices as a search space for graph compression
- Breadth first search graph partitions and concept lattices
This page was built for publication: Representing attribute reduction and concepts in concept lattice using graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703689)