Searching for high-support itemsets in itemset trees

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


One of the goals of Association Mining is to develop algorithms capable of finding frequently co-occurring groups of items (itemsets) in transaction databases. The recently published technique of Itemset Trees expedited the processing of so-called targeted queries where the user is interested only in itemsets that contain certain prespecified items. However, the technique did not seem to offer any cost-effective way how to find all frequent itemsets (general queries) as it is common with other association-mining algorithms. The purpose of this paper is to rectify this deficiency by a newly developed algorithm that we call IT-Mining. Experimental results indicate that itemset trees can now with advantage be used to answer both targeted and general queries, and that the technique compares favorably with previous atttempts under a broad range of data parameters.

Original languageEnglish (US)
Pages (from-to)105-120
Number of pages16
JournalIntelligent Data Analysis
Issue number2
StatePublished - Jan 1 2006


  • Data mining
  • frequent itemsets
  • itemset trees

ASJC Scopus subject areas

  • Artificial Intelligence
  • Theoretical Computer Science
  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Searching for high-support itemsets in itemset trees'. Together they form a unique fingerprint.

Cite this