A heuristic knowledge-reduction method for decision formal contexts
From MaRDI portal
Publication:552269
DOI10.1016/j.camwa.2010.12.060zbMath1217.68208MaRDI QIDQ552269
Yuejin Lv, Jinhai Li, Chang-Lin Mei
Publication date: 21 July 2011
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.12.060
68T30: Knowledge representation
Related Items
A comprehensive survey on formal concept analysis, its research trends and applications, Connections between covering-based rough sets and concept lattices, Relations of reduction between covering generalized rough sets and concept lattices, Feature selection based on composition of rough sets induced by feature granulation, \(\ast\)-reductions in a knowledge base, A comparative study of decision implication, concept rule and granular rule, A fast attribute reduction method for large formal decision contexts, General framework for consistencies in decision contexts, Granular matrix method of attribute reduction in formal contexts, Knowledge reduction in formal contexts using non-negative matrix factorization, Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context, Comparison of reduction in formal decision contexts, Analysis of interval-valued decision formal contexts, Knowledge reduction in formal decision contexts based on an order-preserving mapping
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attribute reduction theory and approach to concept lattice
- Concept lattices and conceptual knowledge systems
- Approaches to knowledge reduction based on variable precision rough set model.
- A fast algorithm for building lattices
- A multi-level conceptual data reduction approach based on the Lukasiewicz implication
- Attribute reduction theory of concept lattice based on decision formal contexts
- A rough set approach for the discovery of classification rules in interval-valued information systems
- A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
- Reduction method for concept lattices based on rough set theory and its application
- Approaches to knowledge reduction in generalized consistent decision formal context
- A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
- Variable threshold concept lattices
- Attribute reduction based on evidence theory in incomplete decision systems
- Rough sets
- Computing iceberg concept lattices with Titanic
- Rough Sets and Current Trends in Computing
- Concept Lattices
- Reduction algorithms based on discernibility matrix: The ordered attributes method
