Itemset Trees for Targeted Association Querying

Miroslav Kubat, Alaaeldin Hafez, Vijay V. Raghavan, Jayakrishna R. Lekkala, Wei Kian Chen

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.

Original languageEnglish
Pages (from-to)1522-1534
Number of pages13
JournalIEEE Transactions on Knowledge and Data Engineering
Volume15
Issue number6
DOIs
StatePublished - Nov 1 2003

Fingerprint

Fruits
Processing
Industry
Experiments

Keywords

  • Association mining
  • Data mining
  • Market baskets

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Information Systems

Cite this

Itemset Trees for Targeted Association Querying. / Kubat, Miroslav; Hafez, Alaaeldin; Raghavan, Vijay V.; Lekkala, Jayakrishna R.; Chen, Wei Kian.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 6, 01.11.2003, p. 1522-1534.

Research output: Contribution to journalArticle

Kubat, Miroslav ; Hafez, Alaaeldin ; Raghavan, Vijay V. ; Lekkala, Jayakrishna R. ; Chen, Wei Kian. / Itemset Trees for Targeted Association Querying. In: IEEE Transactions on Knowledge and Data Engineering. 2003 ; Vol. 15, No. 6. pp. 1522-1534.
@article{06011343b0cf4adabdd5e8916e01086e,
title = "Itemset Trees for Targeted Association Querying",
abstract = "Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.",
keywords = "Association mining, Data mining, Market baskets",
author = "Miroslav Kubat and Alaaeldin Hafez and Raghavan, {Vijay V.} and Lekkala, {Jayakrishna R.} and Chen, {Wei Kian}",
year = "2003",
month = "11",
day = "1",
doi = "10.1109/TKDE.2003.1245290",
language = "English",
volume = "15",
pages = "1522--1534",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Itemset Trees for Targeted Association Querying

AU - Kubat, Miroslav

AU - Hafez, Alaaeldin

AU - Raghavan, Vijay V.

AU - Lekkala, Jayakrishna R.

AU - Chen, Wei Kian

PY - 2003/11/1

Y1 - 2003/11/1

N2 - Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.

AB - Association mining techniques search for groups of frequently co-occurring items in a market-basket type of data and turn these groups into business-oriented rules. Previous research has focused predominantly on how to obtain exhaustive lists of such associations. However, users often prefer a quick response to targeted queries. For instance, they may want to learn about the buying habits of customers that frequently purchase cereals and fruits. To expedite the processing of such queries, we propose an approach that converts the market-basket database into an itemset tree. Experiments indicate that the targeted queries are answered in a time that is roughly linear in the number of market baskets, N. Also, the construction of the itemset tree has O(N) space and time requirements. Some useful theoretical properties are proven.

KW - Association mining

KW - Data mining

KW - Market baskets

UR - http://www.scopus.com/inward/record.url?scp=0242578075&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242578075&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2003.1245290

DO - 10.1109/TKDE.2003.1245290

M3 - Article

VL - 15

SP - 1522

EP - 1534

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 6

ER -