Incrementally mining high utility itemsets in dynamic databases

Chun Wei Lin, Tzung Pei Hong, Guo Cheng Lan, Hsin Yi Chen, Hung Yu Kao

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

Abstract

Utility mining is proposed to consider additional measures, such as profits or costs according to user preference. In the past, a two-phase mining algorithm was proposed for fast discovering high utility itemsets from databases. In this paper, an incremental mining algorithm to efficiently update high utility itemsets is proposed for record insertion. Experimental results also show that the proposed algorithm executes faster than the two-phase batch mining algorithm.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010
Pages303-307
Number of pages5
DOIs
Publication statusPublished - 2010 Nov 1
Event2010 IEEE International Conference on Granular Computing, GrC 2010 - San Jose, CA, United States
Duration: 2010 Aug 142010 Aug 16

Publication series

NameProceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010

Other

Other2010 IEEE International Conference on Granular Computing, GrC 2010
CountryUnited States
CitySan Jose, CA
Period10-08-1410-08-16

Fingerprint

Profitability
Costs

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this

Lin, C. W., Hong, T. P., Lan, G. C., Chen, H. Y., & Kao, H. Y. (2010). Incrementally mining high utility itemsets in dynamic databases. In Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010 (pp. 303-307). [5575938] (Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010). https://doi.org/10.1109/GrC.2010.151
Lin, Chun Wei ; Hong, Tzung Pei ; Lan, Guo Cheng ; Chen, Hsin Yi ; Kao, Hung Yu. / Incrementally mining high utility itemsets in dynamic databases. Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010. 2010. pp. 303-307 (Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010).
@inproceedings{865b90a4e590481cbe9ed512114a0c2f,
title = "Incrementally mining high utility itemsets in dynamic databases",
abstract = "Utility mining is proposed to consider additional measures, such as profits or costs according to user preference. In the past, a two-phase mining algorithm was proposed for fast discovering high utility itemsets from databases. In this paper, an incremental mining algorithm to efficiently update high utility itemsets is proposed for record insertion. Experimental results also show that the proposed algorithm executes faster than the two-phase batch mining algorithm.",
author = "Lin, {Chun Wei} and Hong, {Tzung Pei} and Lan, {Guo Cheng} and Chen, {Hsin Yi} and Kao, {Hung Yu}",
year = "2010",
month = "11",
day = "1",
doi = "10.1109/GrC.2010.151",
language = "English",
isbn = "9780769541617",
series = "Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010",
pages = "303--307",
booktitle = "Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010",

}

Lin, CW, Hong, TP, Lan, GC, Chen, HY & Kao, HY 2010, Incrementally mining high utility itemsets in dynamic databases. in Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010., 5575938, Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010, pp. 303-307, 2010 IEEE International Conference on Granular Computing, GrC 2010, San Jose, CA, United States, 10-08-14. https://doi.org/10.1109/GrC.2010.151

Incrementally mining high utility itemsets in dynamic databases. / Lin, Chun Wei; Hong, Tzung Pei; Lan, Guo Cheng; Chen, Hsin Yi; Kao, Hung Yu.

Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010. 2010. p. 303-307 5575938 (Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010).

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

TY - GEN

T1 - Incrementally mining high utility itemsets in dynamic databases

AU - Lin, Chun Wei

AU - Hong, Tzung Pei

AU - Lan, Guo Cheng

AU - Chen, Hsin Yi

AU - Kao, Hung Yu

PY - 2010/11/1

Y1 - 2010/11/1

N2 - Utility mining is proposed to consider additional measures, such as profits or costs according to user preference. In the past, a two-phase mining algorithm was proposed for fast discovering high utility itemsets from databases. In this paper, an incremental mining algorithm to efficiently update high utility itemsets is proposed for record insertion. Experimental results also show that the proposed algorithm executes faster than the two-phase batch mining algorithm.

AB - Utility mining is proposed to consider additional measures, such as profits or costs according to user preference. In the past, a two-phase mining algorithm was proposed for fast discovering high utility itemsets from databases. In this paper, an incremental mining algorithm to efficiently update high utility itemsets is proposed for record insertion. Experimental results also show that the proposed algorithm executes faster than the two-phase batch mining algorithm.

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

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

U2 - 10.1109/GrC.2010.151

DO - 10.1109/GrC.2010.151

M3 - Conference contribution

AN - SCOPUS:77958583964

SN - 9780769541617

T3 - Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010

SP - 303

EP - 307

BT - Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010

ER -

Lin CW, Hong TP, Lan GC, Chen HY, Kao HY. Incrementally mining high utility itemsets in dynamic databases. In Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010. 2010. p. 303-307. 5575938. (Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010). https://doi.org/10.1109/GrC.2010.151