Research on Association Rule Mining Algorithm Based on Distributed Data

Cheng Luo; Ying Chen

doi:10.4028/www.scientific.net/AMR.998-999.899

Paper Titles

Iterative ML Symbol Detection without Timing and Phase Synchronization
p.878

Multi-View Face Detection Based on Multi-Features AdaBoost Collaborative Learning Algorithm
p.884

Non-Line-of-Sight Positioning Algorithm Based on Robust Principal Component Analysis
p.889

Palmprint Recognition Based on Sparse Two-Dimensional Local Discriminant Projections
p.894

Research on Association Rule Mining Algorithm Based on Distributed Data
p.899

Research on Building IMC Model in Mobile Bank
p.903

Research on Text-Related Speaker Recognition Based on First Order Differential
p.907

Research on the Application of BP Neural Networks in 3D Reconstruction Noise Filter
p.911

Research on Topology Association Rules Algorithm Based on Spatial Constraints
p.915

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 998-999Research on Association Rule Mining Algorithm...

Research on Association Rule Mining Algorithm Based on Distributed Data

Abstract:

Existing data miming algorithms have mostly implemented data mining under centralized environment, but the large-scale database exists in the distributed form. According to the existing problem of the distributed data mining algorithm FDM and its improved algorithms, which exist the problem that the frequent itemsets are lost and network communication cost too much. This paper proposes a association rule mining algorithm based on distributed data (ARADD). The mapping marks the array mechanism is included in the ARADD algorithm, which can not only keep the integrity of the frequent itemsets, but also reduces the cost of network communication. The efficiency of algorithm is proved in the experiment.

You might also be interested in these eBooks

Advances in Applied Sciences, Engineering and Technology II

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 998-999)

Pages:

899-902

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.998-999.899

Citation:

Cite this paper

Online since:

July 2014

Authors:

Cheng Luo*, Ying Chen

Keywords:

Association Rule, Data Mining (DM), Distributed Data, Frequent Itemsets

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] B. HE: Control and Decision, vol. 8, 26 (2011), pp.1214-1216.

Google Scholar

[2] Novak PK, Lavra N. Webb GI: Journal of Machine Learning Research, Vol. 10 (2009) No. 9, pp.43-48.

Google Scholar

[3] M. Sun, Z.H. Sun and G.L. Ji: Fast Mining of Gobal Frequent Itemsets, Journal of Computer Research and Development, Vol. 6 (2008) No. 40, pp.620-622.

Google Scholar

[4] Agrawal R, Imielinski T, Swami A: Mining Association Rules between Sets of Items in Large Databases, ACM SIGMOD Conf, Management of Data, (1993).

DOI: 10.1145/170035.170072

Google Scholar

[5] C.H. Wan, H.K. Huang and H.L. LI: Journal of Computer Research and Development, Vol. 6, (2007) No. 38 . pp.438-441.

Google Scholar

[6] D.W. Cheung, J. Han, Ng V, Fu AWC, Y. Fu: A Fast Distributed Algorithm for Mining Association Rules. Proc. 1996 Int'l Conf, Parallel and Distributed Information Systems (PDIS '96). 1996, pp.31-42.

DOI: 10.1109/pdis.1996.568665

Google Scholar

[7] Nijssen S, Guns T, Raedt LD: Correlated itemsets mining in roc space: a constraint programming approach. KDD, (2009).

DOI: 10.1145/1557019.1557092

Google Scholar