loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 First Asian Conference on Intelligent Information and Database Systems
A Novel Algorithm for Mining High Utility Itemsets
Dong hoi, Quang binh, Vietnam
April 01-April 03
ISBN: 978-0-7695-3580-7
ASCII Text
x 
 
Bac Le, Huy Nguyen, Tung Anh Cao, Bay Vo, "A Novel Algorithm for Mining High Utility Itemsets," Intelligent Information and Database Systems, Asian Conference on, pp. 13-17, 2009 First Asian Conference on Intelligent Information and Database Systems, 2009.
 
 
BibTex
x
 
@article{ 10.1109/ACIIDS.2009.55,
author = {Bac Le and Huy Nguyen and Tung Anh Cao and Bay Vo},
title = {A Novel Algorithm for Mining High Utility Itemsets},
journal ={Intelligent Information and Database Systems, Asian Conference on},
volume = {0},
year = {2009},
isbn = {978-0-7695-3580-7},
pages = {13-17},
doi = {http://doi.ieeecomputersociety.org/10.1109/ACIIDS.2009.55},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Intelligent Information and Database Systems, Asian Conference on
TI - A Novel Algorithm for Mining High Utility Itemsets
SN - 978-0-7695-3580-7
SP13
EP17
A1 - Bac Le,
A1 - Huy Nguyen,
A1 - Tung Anh Cao,
A1 - Bay Vo,
PY - 2009
KW - Utility itemset
KW - utility constraint
KW - utility upper bound
KW - transaction-weighted utilization
KW - WIT-tree
VL - 0
JA - Intelligent Information and Database Systems, Asian Conference on
ER -
 
The utility based itemset mining approach has been discussed widely in recent years. There are many algorithms mining high utility itemsets by pruning candidates based on estimated utility values, and based on transaction-weighted utilization values. These algorithms aim to reduce search space. Besides, candidate pruning based on transaction-weighted utilization value is better than other strategies. In this paper, we propose TWU-Mining, a novel algorithm based-on WIT-tree for improving the cost of time and search space. Experiments show that the proposed algorithm is more effective on the testing databases.
Index Terms:
Utility itemset, utility constraint, utility upper bound, transaction-weighted utilization, WIT-tree
Citation:
Bac Le, Huy Nguyen, Tung Anh Cao, Bay Vo, "A Novel Algorithm for Mining High Utility Itemsets," aciids, pp.13-17, 2009 First Asian Conference on Intelligent Information and Database Systems, 2009
Usage of this product signifies your acceptance of the Terms of Use.