Mining High Utility Itemsets from Vertical Distributed Databases

Author

Vo, Bay ; Nguyen, Huy ; Le, Bac

Author_Institution

Fac. of Inf. Technol., Ho Chi Minh City Univ. of Technol., Ho Chi Minh City, Vietnam

fYear

2009

fDate

13-17 July 2009

Firstpage

1

Lastpage

4

Abstract

The utility based on itemsets mining approach has been discussed widely in recent years. There are many algorithms mining high utility itemsets (HUIs) by pruning candidates based on the estimated utility values, and based on the transaction-weighted utilization values. These algorithms aim to reduce search space. In this paper, we propose a method for HUIs from vertical distributed databases. This method does not integrate local databases in SlaverSites to MasterSite, and scan local database one time. Experiments show the run-time of this method is more efficient than that in the concentration database.

Keywords

data mining; distributed databases; MasterSite; SlaverSites; estimated utility value; high utility itemset; itemsets mining approach; pruning; transaction-weighted utilization value; vertical distributed database; Data mining; Data structures; Distributed databases; Information technology; Itemsets; Joining processes; Master-slave; Runtime; Transaction databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Computing and Communication Technologies, 2009. RIVF '09. International Conference on

Conference_Location

Da Nang

Print_ISBN

978-1-4244-4566-0

Electronic_ISBN

978-1-4244-4568-4

Type

conf

DOI

10.1109/RIVF.2009.5174650

Filename

5174650