@inproceedings{54d87d5f7fcb456298eee519aa177734,
title = "The item-set tree: A data structure for data mining",
abstract = "Enhancements in data capturing technology have lead to exponential growth in amounts of data being stored in information systems. This growth in turn has motivated researchers to seek new techniques for extraction of knowledge implicit or hidden in the data. In this paper, we motivate the need for an incremental data mining approach based on data structure called the itemset tree. The motivated approach is shown to be effective for solving problems related to efficiency of handling data updates, accuracy of data mining results, processing input transactions, and answering user queries. We present efficient algorithms to insert transactions into the item-set tree and to count frequencies of itemsets for queries about strength of association among items. We prove that the expected complexity of inserting a transaction is ≈ O(1), and that of frequency counting is O(n), where n is the cardinality of the domain of items.",
author = "Alaaeldin Hafez and Jitender Deogun and Raghavan, {Vijay V.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 1st International Conference on Data Warehousing and Knowledge Discovery, DaWaK 1999 ; Conference date: 30-08-1999 Through 01-09-1999",
year = "1999",
doi = "10.1007/3-540-48298-9_20",
language = "English (US)",
isbn = "3540664580",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "183--192",
editor = "Tjoa, {A. Min} and Mukesh Mohania",
booktitle = "Data Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings",
}