[图书][B] Frequent pattern mining algorithms: A survey

CC Aggarwal, MA Bhuiyan, MA Hasan - 2014 - Springer
This chapter will provide a detailed survey of frequent pattern mining algorithms. A wide
variety of algorithms will be covered starting from Apriori. Many algorithms such as Eclat …

Mining non-redundant association rules

MJ Zaki - Data mining and knowledge discovery, 2004 - Springer
The traditional association rule mining framework produces many redundant rules. The
extent of redundancy is a lot larger than previously suspected. We present a new framework …

Mining frequent patterns with counting inference

Y Bastide, R Taouil, N Pasquier, G Stumme… - ACM SIGKDD …, 2000 - dl.acm.org
In this paper, we propose the algorithm PASCAL which introduces a novel optimization of
the well-known algorithm Apriori. This optimization is based on a new strategy called pattern …

Generating a condensed representation for association rules

N Pasquier, R Taouil, Y Bastide, G Stumme… - Journal of intelligent …, 2005 - Springer
Association rule extraction from operational datasets often produces several tens of
thousands, and even millions, of association rules. Moreover, many of these rules are …

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 …

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 …

Efficient data mining based on formal concept analysis

G Stumme - International conference on database and expert …, 2002 - Springer
Abstract Formal Concept Analysis is an unsupervised learning technique for conceptual
clustering. We introduce the notion of iceberg concept lattices and show their use in …

[PDF][PDF] Closed sets for labeled data.

GC Garriga, P Kralj, N Lavrač - Journal of Machine Learning Research, 2008 - jmlr.org
Closed sets have been proven successful in the context of compacted data representation
for association rule learning. However, their use is mainly descriptive, dealing only with …

Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory

P Valtchev, R Missaoui, R Godin… - Journal of Experimental & …, 2002 - Taylor & Francis
Galois (concept) lattice theory has been successfully applied in data mining for the
resolution of the association rule problem. In particular, structural results about lattices have …

The chosen few: On identifying valuable patterns

B Bringmann, A Zimmermann - Seventh IEEE International …, 2007 - ieeexplore.ieee.org
Constrained pattern mining extracts patterns based on their individual merit. Usually this
results in far more patterns than a human expert or a machine learning technique could …