The item-set tree: A data structure for data mining

Alaaeldin Hafez, Jitender Deogun, Vijay V. Raghavan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationData Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings
EditorsA. Min Tjoa, Mukesh Mohania
PublisherSpringer Verlag
Pages183-192
Number of pages10
ISBN (Print)3540664580, 9783540664581
DOIs
StatePublished - Jan 1 1999
Event1st International Conference on Data Warehousing and Knowledge Discovery, DaWaK 1999 - Florence, Italy
Duration: Aug 30 1999Sep 1 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1676
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Data Warehousing and Knowledge Discovery, DaWaK 1999
CountryItaly
CityFlorence
Period8/30/999/1/99

Fingerprint

Transactions
Data mining
Data structures
Data Structures
Data Mining
Data handling
Query
Data Handling
Information systems
Exponential Growth
Information Systems
Cardinality
Counting
Count
Efficient Algorithms
Enhancement
Processing
Update
Knowledge

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hafez, A., Deogun, J., & Raghavan, V. V. (1999). The item-set tree: A data structure for data mining. In A. M. Tjoa, & M. Mohania (Eds.), Data Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings (pp. 183-192). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1676). Springer Verlag. https://doi.org/10.1007/3-540-48298-9_20

The item-set tree : A data structure for data mining. / Hafez, Alaaeldin; Deogun, Jitender; Raghavan, Vijay V.

Data Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings. ed. / A. Min Tjoa; Mukesh Mohania. Springer Verlag, 1999. p. 183-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1676).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hafez, A, Deogun, J & Raghavan, VV 1999, The item-set tree: A data structure for data mining. in AM Tjoa & M Mohania (eds), Data Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1676, Springer Verlag, pp. 183-192, 1st International Conference on Data Warehousing and Knowledge Discovery, DaWaK 1999, Florence, Italy, 8/30/99. https://doi.org/10.1007/3-540-48298-9_20
Hafez A, Deogun J, Raghavan VV. The item-set tree: A data structure for data mining. In Tjoa AM, Mohania M, editors, Data Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings. Springer Verlag. 1999. p. 183-192. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-48298-9_20
Hafez, Alaaeldin ; Deogun, Jitender ; Raghavan, Vijay V. / The item-set tree : A data structure for data mining. Data Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings. editor / A. Min Tjoa ; Mukesh Mohania. Springer Verlag, 1999. pp. 183-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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.}",
year = "1999",
month = "1",
day = "1",
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",

}

TY - GEN

T1 - The item-set tree

T2 - A data structure for data mining

AU - Hafez, Alaaeldin

AU - Deogun, Jitender

AU - Raghavan, Vijay V.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/3-540-48298-9_20

DO - 10.1007/3-540-48298-9_20

M3 - Conference contribution

AN - SCOPUS:22844454993

SN - 3540664580

SN - 9783540664581

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 183

EP - 192

BT - Data Warehousing and Knowledge Discovery - 1st International Conference, DaWaK 1999, Proceedings

A2 - Tjoa, A. Min

A2 - Mohania, Mukesh

PB - Springer Verlag

ER -