A survey on condensed representations for frequent sets
Solving inductive queries which have to return complete collections of patterns satisfying a
given predicate has been studied extensively the last few years. The specific problem of …
given predicate has been studied extensively the last few years. The specific problem of …
Constraining and summarizing association rules in medical data
C Ordonez, N Ezquerra, CA Santana - Knowledge and information …, 2006 - Springer
Association rules are a data mining technique used to discover frequent patterns in a data
set. In this work, association rules are used in the medical domain, where data sets are …
set. In this work, association rules are used in the medical domain, where data sets are …
Non-derivable itemset mining
T Calders, B Goethals - Data Mining and Knowledge Discovery, 2007 - Springer
All frequent itemset mining algorithms rely heavily on the monotonicity principle for pruning.
This principle allows for excluding candidate itemsets from the expensive counting phase. In …
This principle allows for excluding candidate itemsets from the expensive counting phase. In …
Comparing association rules and decision trees for disease prediction
C Ordonez - Proceedings of the international workshop on …, 2006 - dl.acm.org
Association rules represent a promising technique to find hidden patterns in a medical data
set. The main issue about mining association rules in a medical data set is the large number …
set. The main issue about mining association rules in a medical data set is the large number …
Pattern-based topics for document modelling in information filtering
Many mature term-based or pattern-based approaches have been used in the field of
information filtering to generate users' information needs from a collection of documents. A …
information filtering to generate users' information needs from a collection of documents. A …
Constraint-based data mining
JF Boulicaut, B Jeudy - Data mining and knowledge discovery handbook, 2010 - Springer
Summary Knowledge Discovery in Databases (KDD) is a complex interactive process. The
promising theoretical framework of inductive databases considers this is essentially a …
promising theoretical framework of inductive databases considers this is essentially a …
Reliable representations for association rules
Association rule mining has contributed to many advances in the area of knowledge
discovery. However, the quality of the discovered association rules is a big concern and has …
discovery. However, the quality of the discovered association rules is a big concern and has …
Evaluating association rules and decision trees to predict multiple target attributes
C Ordonez, K Zhao - Intelligent Data Analysis, 2011 - content.iospress.com
Association rules and decision trees represent two well-known data mining techniques to
find predictive rules. In this work, we present a detailed comparison between constrained …
find predictive rules. In this work, we present a detailed comparison between constrained …
Essential patterns: A perfect cover of frequent patterns
The extraction of frequent patterns often yields extremely voluminous results which are
difficult to handle. Computing a concise representation or cover of the frequent pattern set is …
difficult to handle. Computing a concise representation or cover of the frequent pattern set is …
Adequate condensed representations of patterns
A Soulet, B Crémilleux - Data mining and knowledge discovery, 2008 - Springer
Patterns are at the core of the discovery of a lot of knowledge from data but their uses are
limited due to their huge number and their mining cost. During the last decade, many works …
limited due to their huge number and their mining cost. During the last decade, many works …