Intelligent structuring and reducing of association rules with formal concept analysis
From MaRDI portal
Recommendations
Cited in
(23)- Exploratory data analysis leading towards the most interesting simple association rules
- Visualization of statistical information in concept lattice diagrams
- Distributed and parallel computation of the canonical direct basis
- Rules acquisition of formal decision contexts based on three-way concept lattices
- Direct and incremental computing of maximal covering rules
- Formal framework for data mining with association rules and domain knowledge -- overview of an approach
- Analysis of association rule mining algorithms based on the concept lattice and the apriori algorithm
- Classes of association rules: an overview
- Extracting compact and information lossless sets of fuzzy association rules
- Structuration sets with implication intensity
- Functional and approximate dependency mining: database and FCA points of view
- Efficient data mining based on formal concept analysis
- On critical sets of a finite Moore family
- Reduction of Redundant Rules in Statistical Implicative Analysis
- Conceptual Structures at Work
- Description and mining method of maximal association rules based on logical formulas on soft sets
- Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions
- Generic Association Rule Bases: Are They so Succinct?
- Efficient mining of association rules based on formal concept analysis
- Formal Concept Analysis with Constraints by Closure Operators
- Formal Concept Analysis
- Concept Lattices
- Query-based association rule mining supporting user perspective
This page was built for publication: Intelligent structuring and reducing of association rules with formal concept analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797438)