Mining frequent itemsets with convertible constraints

Jian Pei, Jiawei Han, Laks V.S. Lakshmanan

Research output: Contribution to journalArticlepeer-review


Recent work has highlighted the importance of the constraint-based mining paradigm in the context of frequent itemsets, associations, correlations, sequential patterns, and many other interesting patterns in large databases. In this paper, we study constraints which cannot be handled with existing theory and techniques. For example, avg(S) θ v, median(S) θ v, sum(S) θ v (S can contain items of arbitrary values) (θ ∈ (≥, ≤)), are customarily regarded as "tough" constraints in that they cannot be pushed inside an algorithm such as Apriori. We develop a notion of convertible constraints and systematically analyze, classify, and characterize this class. We also develop techniques which enable them to be readily pushed deep inside the recently developed FP-growth algorithm for frequent itemset mining. Results from our detailed experiments show the effectiveness of the techniques developed.

Original languageEnglish (US)
Pages (from-to)433-442
Number of pages10
JournalProceedings - International Conference on Data Engineering
StatePublished - 2001
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems


Dive into the research topics of 'Mining frequent itemsets with convertible constraints'. Together they form a unique fingerprint.

Cite this