A two-phase algorithm for fast discovery of high utility itemsets

Ying Liu; Wei Keng Liao; Alok Choudhary

doi:10.1007/11430919_79

A two-phase algorithm for fast discovery of high utility itemsets

Ying Liu^*, Wei Keng Liao, Alok Choudhary

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

616 Scopus citations

Abstract

Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mining focuses on identifying the itemsets with high utilities. In this paper, we present a Two-Phase algorithm to efficiently prune down the number of candidates and precisely obtain the complete set of high utility itemsets. It performs very efficiently in terms of speed and memory cost both on synthetic and real databases, even on large databases that are difficult for existing algorithms to handle.

Original language	English (US)
Title of host publication	Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings
Publisher	Springer Verlag
Pages	689-695
Number of pages	7
ISBN (Print)	3540260765, 9783540260769
DOIs	https://doi.org/10.1007/11430919_79
State	Published - 2005
Event	9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005 - Hanoi, Viet Nam Duration: May 18 2005 → May 20 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3518 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005
Country/Territory	Viet Nam
City	Hanoi
Period	5/18/05 → 5/20/05

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11430919_79

Cite this

Liu, Y., Liao, W. K., & Choudhary, A. (2005). A two-phase algorithm for fast discovery of high utility itemsets. In Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings (pp. 689-695). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3518 LNAI). Springer Verlag. https://doi.org/10.1007/11430919_79

Liu, Ying ; Liao, Wei Keng ; Choudhary, Alok. / A two-phase algorithm for fast discovery of high utility itemsets. Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings. Springer Verlag, 2005. pp. 689-695 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{572ae6a0bff144dbb886a0b2cac3ce80,

title = "A two-phase algorithm for fast discovery of high utility itemsets",

abstract = "Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mining focuses on identifying the itemsets with high utilities. In this paper, we present a Two-Phase algorithm to efficiently prune down the number of candidates and precisely obtain the complete set of high utility itemsets. It performs very efficiently in terms of speed and memory cost both on synthetic and real databases, even on large databases that are difficult for existing algorithms to handle.",

author = "Ying Liu and Liao, {Wei Keng} and Alok Choudhary",

year = "2005",

doi = "10.1007/11430919_79",

language = "English (US)",

isbn = "3540260765",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "689--695",

booktitle = "Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings",

note = "9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005 ; Conference date: 18-05-2005 Through 20-05-2005",

}

Liu, Y, Liao, WK & Choudhary, A 2005, A two-phase algorithm for fast discovery of high utility itemsets. in Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3518 LNAI, Springer Verlag, pp. 689-695, 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005, Hanoi, Viet Nam, 5/18/05. https://doi.org/10.1007/11430919_79

A two-phase algorithm for fast discovery of high utility itemsets. / Liu, Ying; Liao, Wei Keng ; Choudhary, Alok.
Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings. Springer Verlag, 2005. p. 689-695 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3518 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A two-phase algorithm for fast discovery of high utility itemsets

AU - Liu, Ying

AU - Liao, Wei Keng

AU - Choudhary, Alok

PY - 2005

Y1 - 2005

N2 - Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mining focuses on identifying the itemsets with high utilities. In this paper, we present a Two-Phase algorithm to efficiently prune down the number of candidates and precisely obtain the complete set of high utility itemsets. It performs very efficiently in terms of speed and memory cost both on synthetic and real databases, even on large databases that are difficult for existing algorithms to handle.

AB - Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mining focuses on identifying the itemsets with high utilities. In this paper, we present a Two-Phase algorithm to efficiently prune down the number of candidates and precisely obtain the complete set of high utility itemsets. It performs very efficiently in terms of speed and memory cost both on synthetic and real databases, even on large databases that are difficult for existing algorithms to handle.

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

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

U2 - 10.1007/11430919_79

DO - 10.1007/11430919_79

M3 - Conference contribution

AN - SCOPUS:26944496038

SN - 3540260765

SN - 9783540260769

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

SP - 689

EP - 695

BT - Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings

PB - Springer Verlag

T2 - 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005

Y2 - 18 May 2005 through 20 May 2005

ER -

Liu Y, Liao WK , Choudhary A. A two-phase algorithm for fast discovery of high utility itemsets. In Advances in Knowledge Discovery and Data Mining - 9th Pacific-Asia Conference, PAKDD 2005, Proceedings. Springer Verlag. 2005. p. 689-695. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11430919_79

A two-phase algorithm for fast discovery of high utility itemsets

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this