Itemset Trees for Targeted Association Querying

@article{Kubat2003ItemsetTF,
  title={Itemset Trees for Targeted Association Querying},
  author={Miroslav Kubat and Aladdin Hafez and Vijay V. Raghavan and Jayakrishna R. Lekkala and Wei Kian Chen},
  journal={IEEE Trans. Knowl. Data Eng.},
  year={2003},
  volume={15},
  pages={1522-1534}
}
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… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS
35 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

55 Citations

0510'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

A Tree Projection Agorithm for Generation of Frequent Itemsets

  • R. Agarwal, C. Aggarwal, V.V.V. Prassad
  • J. Parallel and Distributed Computing, 2000.
  • 2000
Highly Influential
6 Excerpts

Depth-First Generation of Large Itemsets of Association Rules

  • R. Agarwal, C. Aggarwal, V.V.V. Prassad
  • IBM Technical. Report RC21538, July 1999.
  • 1999
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…