Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Finding interesting rules from large sets of discovered association rules
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bayesian networks for knowledge discovery
Advances in knowledge discovery and data mining
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices
Information Systems
Mining the most interesting rules
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
Data Mining and Knowledge Discovery
What Makes Patterns Interesting in Knowledge Discovery Systems
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovery of Multiple-Level Association Rules from Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Constraint-Based Rule Mining in Large, Dense Databases
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Constructing Approximate Informative Basis of Association Rules
DS '01 Proceedings of the 4th International Conference on Discovery Science
Concise Representations of Association Rules
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Constraint-Based Discovery and Inductive Queries: Application to Association Rule Mining
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Efficient Data Mining Based on Formal Concept Analysis
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
On Characterization and Discovery of Minimal Unexpected Patterns in Rule Discovery
IEEE Transactions on Knowledge and Data Engineering
M-CLANN: Multi-class Concept Lattice-Based Artificial Neural Network for Supervised Classification
ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part II
Implicit Groups of Web Pages as Constrained Top N Concepts
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Mining Safety Signals in Spontaneous Reports Database Using Concept Analysis
AIME '09 Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine
Mining Multiple Level Non-redundant Association Rules through Two-Fold Pruning of Redundancies
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Closed Non Derivable Data Cubes Based on Non Derivable Minimal Generators
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Efficient Vertical Mining of Frequent Closures and Generators
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Missing Values: Proposition of a Typology and Characterization with an Association Rule-Based Model
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Constructing classification features using minimal predictive patterns
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A concise representation of association rules using minimal predictive rules
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Mining monolingual and bilingual corpora
Intelligent Data Analysis
Mining minimal non-redundant association rules using frequent itemsets lattice
International Journal of Intelligent Systems Technologies and Applications
The agree concept lattice for multidimensional database analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Extracting compact and information lossless sets of fuzzy association rules
Fuzzy Sets and Systems
Mining frequent disjunctive selection queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Database transposition for constrained (closed) pattern mining
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
A correspondence between maximal complete bipartite subgraphs and closed patterns
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Redundant association rules reduction techniques
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
GARC: a new associative classification approach
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Prince: an algorithm for generating rule bases without closure computations
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Pruning derivative partial rules during impact rule discovery
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
IGB: a new informative generic base of association rules
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets
Expert Systems with Applications: An International Journal
Iterative bayesian network implementation by using annotated association rules
EKAW'06 Proceedings of the 15th international conference on Managing Knowledge in a World of Networks
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Finding minimum representative pattern sets
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Computing Implications with Negation from a Formal Context
Fundamenta Informaticae - Concept Lattices and Their Applications
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Extraction of association rules based on literalsets
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Mining top-K non-redundant association rules
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
Resource recommendation for intelligent environments based on a multi-aspect metric
UCAmI'12 Proceedings of the 6th international conference on Ubiquitous Computing and Ambient Intelligence
A lattice-based approach for mining most generalization association rules
Knowledge-Based Systems
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Mining closed patterns in relational, graph and network data
Annals of Mathematics and Artificial Intelligence
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 0.01 |
The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies. Using the closure of the Galois connection, we define two new bases for association rules which union is a generating set for all valid association rules with support and confidence. These bases are characterized using frequent closed itemsets and their generators; they consist of the nonredundant exact and approximate association rules having minimal antecedents and maximal consequents, i.e. the most relevant association rules. Algorithms for extracting these bases are presented and results of experiments carried out on real-life databases show that the proposed bases are useful, and that their generation is not time consuming.