Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases

Authors:
Bay Vo;Huy Nguyen;Tu Bao Ho;Bac Le
Affiliations:
Faculty of Information Technology, Ho Chi Minh City University of Technology, Vietnam;Faculty of Information Technology, Saigon University, Ho Chi Minh, Vietnam;School of Knowledge Science, Japan Advanced Institute of Science and Technology, Japan;Faculty of Information Technology, University of Science, Ho Chi Minh, Vietnam
Venue:
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Year:
2009

Citing 14
Cited 3

Communication-efficient distributed mining of association rules

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Parallel and Distributed Association Mining: A Survey

IEEE Concurrency
Parallel Mining of Association Rules

IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure

IEEE Transactions on Knowledge and Data Engineering
A fast high utility itemsets mining algorithm

UBDM '05 Proceedings of the 1st international workshop on Utility-based data mining
Mining itemset utilities from transaction databases

Data & Knowledge Engineering - Special issue: ER 2003
Distributed classification in peer-to-peer networks

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach

CIT '07 Proceedings of the 7th IEEE International Conference on Computer and Information Technology
A bottom-up projection based algorithm for mining high utility itemsets

AIDM '07 Proceedings of the 2nd international workshop on Integrating artificial intelligence and data mining - Volume 84
A Weighted Utility Framework for Mining Association Rules

EMS '08 Proceedings of the 2008 Second UKSIM European Symposium on Computer Modeling and Simulation
Mining long high utility itemsets in transaction databases

WSEAS Transactions on Information Science and Applications
A Novel Algorithm for Mining High Utility Itemsets

ACIIDS '09 Proceedings of the 2009 First Asian Conference on Intelligent Information and Database Systems
Association rule mining in peer-to-peer systems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Mining top-K high utility itemsets

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A tree-based approach for mining frequent weighted utility itemsets

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Mining high utility episodes in complex event sequences

Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mining high utility itemsets (HUIs) has been developing in recent years. However, the methods of mining from distributed databases have not mentioned yet. In this paper, we present a parallel method for mining HUIs in vertically partitioned distributed databases. We use WIT-tree structure to store local database on each site for parallel mining HUIs. The item ith in each SlaverSite is only sent to MasterSite if its Transaction-Weighted Utilization (TWU) satisfies minutility (minutil), and MasterSite only mines HUIs which exist at least on 2 sites. Besides, the parallel performance is also interesting because it reduces the waiting time of attended sites. Thus, the mining time is reduced more significant than that in mining from centralized database.