Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams

Hua Fu Li; Hsin-Yun Huang; Yi-Cheng Chen; Yu-Jiun Liu; Suh-Yin Lee

doi:10.1109/ICDM.2008.107

Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams

Hua Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun Liu, Suh-Yin Lee

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

57 Scopus citations

Abstract

Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algorithms, MHUI-BIT and MHUI-TID, for mining high utility itemsets from data streams within a transaction-sensitive sliding window. Two effective representations of item information and an extended lexicographical tree-based summary data structure are developed to improve the efficiency of mining high utility itemsets. Experimental results show that the proposed algorithms outperform than the existing algorithms for mining high utility itemsets from data streams.

Original language	English
Title of host publication	ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS
Publisher	IEEE
Pages	88-+
ISBN (Electronic)	978-0-7695-3502-9
ISBN (Print)	978-0-7695-3502-9
DOIs	https://doi.org/10.1109/ICDM.2008.107
State	Published - 2008
Event	8th IEEE International Conference on Data Mining - Pisa, Italy Duration: 15 Dec 2008 → 19 Dec 2008

Publication series

Name	IEEE International Conference on Data Mining
Publisher	IEEE
ISSN (Print)	1550-4786
ISSN (Electronic)	1550-4786

Conference

Conference	8th IEEE International Conference on Data Mining
Country	Italy
City	Pisa
Period	15/12/08 → 19/12/08

Access to Document

10.1109/ICDM.2008.107

Fingerprint Dive into the research topics of 'Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams'. Together they form a unique fingerprint.

Cite this

@inbook{c237d73b0965438eb67ff346f0037e6b,

title = "Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams",

abstract = "Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algorithms, MHUI-BIT and MHUI-TID, for mining high utility itemsets from data streams within a transaction-sensitive sliding window. Two effective representations of item information and an extended lexicographical tree-based summary data structure are developed to improve the efficiency of mining high utility itemsets. Experimental results show that the proposed algorithms outperform than the existing algorithms for mining high utility itemsets from data streams.",

author = "Li, {Hua Fu} and Hsin-Yun Huang and Yi-Cheng Chen and Yu-Jiun Liu and Suh-Yin Lee",

year = "2008",

doi = "10.1109/ICDM.2008.107",

language = "English",

isbn = "978-0-7695-3502-9",

series = "IEEE International Conference on Data Mining",

publisher = "IEEE",

pages = "88--+",

booktitle = "ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS",

note = "null ; Conference date: 15-12-2008 Through 19-12-2008",

}

Li, HF, Huang, H-Y, Chen, Y-C, Liu, Y-J & Lee, S-Y 2008, Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams. in ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS. IEEE International Conference on Data Mining, IEEE, pp. 88-+, 8th IEEE International Conference on Data Mining, Pisa, Italy, 15/12/08. https://doi.org/10.1109/ICDM.2008.107

Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams. / Li, Hua Fu; Huang, Hsin-Yun; Chen, Yi-Cheng; Liu, Yu-Jiun; Lee, Suh-Yin.

ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS. IEEE, 2008. p. 88-+ (IEEE International Conference on Data Mining).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams

AU - Li, Hua Fu

AU - Huang, Hsin-Yun

AU - Chen, Yi-Cheng

AU - Liu, Yu-Jiun

AU - Lee, Suh-Yin

PY - 2008

Y1 - 2008

N2 - Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algorithms, MHUI-BIT and MHUI-TID, for mining high utility itemsets from data streams within a transaction-sensitive sliding window. Two effective representations of item information and an extended lexicographical tree-based summary data structure are developed to improve the efficiency of mining high utility itemsets. Experimental results show that the proposed algorithms outperform than the existing algorithms for mining high utility itemsets from data streams.

AB - Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algorithms, MHUI-BIT and MHUI-TID, for mining high utility itemsets from data streams within a transaction-sensitive sliding window. Two effective representations of item information and an extended lexicographical tree-based summary data structure are developed to improve the efficiency of mining high utility itemsets. Experimental results show that the proposed algorithms outperform than the existing algorithms for mining high utility itemsets from data streams.

U2 - 10.1109/ICDM.2008.107

DO - 10.1109/ICDM.2008.107

M3 - Chapter

SN - 978-0-7695-3502-9

T3 - IEEE International Conference on Data Mining

SP - 88-+

BT - ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS

PB - IEEE

Y2 - 15 December 2008 through 19 December 2008

ER -