An incremental concept formation approach for learning from databases
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Discovering and using knowledge from unsupervised data
Decision Support Systems - Special issue: knowledge discovery and its applications to business decision making
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Machine Learning
Concept Approximation in Concept Lattice
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis
IEEE Transactions on Software Engineering
Reduction method for concept lattices based on rough set theory and its application
Computers & Mathematics with Applications
Set approximations in fuzzy formal concept analysis
Fuzzy Sets and Systems
Granular Computing and Knowledge Reduction in Formal Contexts
IEEE Transactions on Knowledge and Data Engineering
Positive approximation: An accelerator for attribute reduction in rough set theory
Artificial Intelligence
Rough set approximations in formal concept analysis
Transactions on Rough Sets V
Hi-index | 0.00 |
Concept lattice is an effective tool for data analysis and extracting classification rules. However, the classical concept lattice often produce a lot of redundant rules. Closed-label concept lattice realizes reduction of concept intention, which can be used to extract fewer rules than the classical concept lattice. This paper presents a method for classification rules extraction based on the closed-label concept lattice. Examples show that the proposed method is effective for extracting more concise classification rules.