Paper Title:
A New Distributed Mining Association Rules Algorithm in Distributed Database System
  Abstract

The traditional algorithms create the local candidate sets firstly, and then determine whether the local frequent item sets is the global frequent item sets by the traffic between the nodes. The most different between the proposed algorithm and the traditional algorithms is that it firstly generates all the local frequent item sets at each node and then communicates to the top point. At the top point, there are four cases to deal with all the local frequent item sets. For the fastest case, the determination could be made by the completion of round-trip communications. At the same time, all the operations of this algorithm are completed not by traditional data storage but by a new data storage in which the item is considered as the keyword. The method can save storage space, especially for sparse data. So the support can be calculated by the intersection of the transaction sets, which is much easier than by accessing to the database. Finally, the association rules in the distributed database are mined

  Info
Periodical
Advanced Materials Research (Volumes 143-144)
Edited by
H. Wang, B.J. Zhang, X.Z. Liu, D.Z. Luo, S.B. Zhong
Pages
658-662
DOI
10.4028/www.scientific.net/AMR.143-144.658
Citation
S. T. Gao, "A New Distributed Mining Association Rules Algorithm in Distributed Database System", Advanced Materials Research, Vols. 143-144, pp. 658-662, 2011
Online since
October 2010
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910
Authors: Li Hua Wu, Wen Feng Chen
Chapter 6: Information Technologies, WEB and Networks Engineering, Information Security, Software Application and Development
Abstract:Collaborative filtering recommendation is a mainstream personalized recommendation method, which has some flaws in actual application. And...
2288
Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765