The Research of High Efficient Data Mining Algorithms for Massive Data Sets

Cui Xia Tao

doi:10.4028/www.scientific.net/AMM.556-562.3901

Paper Titles

Digital Simulation of Ecological Industry Development Based on Grey Clustering Algorithm
p.3881

Resource Optimization Algorithm Based on Evaluation Decision Model of Information Entropy
p.3886

Operation Mode of Resource Sharing Based on Remote Control of Network System
p.3891

Optimization Algorithm of Resource Allocation Based on Fuzzy Assessment Method
p.3896

The Research of High Efficient Data Mining Algorithms for Massive Data Sets
p.3901

Alphabet Computer Automatic Clarity Algorithm
p.3905

Simulation on the Aerobics Behavior Analysis Model Based on the Virtual Joint Point
p.3909

The Visual Simulation Analysis of Human Body Movement Model
p.3913

Simulation on the Mathematical Model of Two-Dimension Rotation Curve of Volleyball Serving
p.3917

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 556-562The Research of High Efficient Data Mining...

The Research of High Efficient Data Mining Algorithms for Massive Data Sets

Abstract:

Data mining means to extract information and knowledge that potentially useful while still unknown in advance, from a large quantity of implicit incomplete, random data. With the quick advancement of modern information technology, people are accumulating data volume on the increase sharply, often at the speed of TB. How to extract meaningful information from large amounts of data has become a big problem must be tackled. In view of the huge amounts of data mining, distributed parallel processing and incremental processing is valid solution.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 556-562)

Pages:

3901-3904

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.556-562.3901

Citation:

Cite this paper

Online since:

May 2014

Authors:

Cui Xia Tao*

Keywords:

Data Mining (DM), Granular Computing, Massive Data Processing, MC - Apriori Algorithms

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] J.S. Park, M-S. Chen, S.Y. Philip. An Effective Hash-Based Algorithm for Mining Association Rules. IBM Thomas J. Watson Research Center, (1995).

Google Scholar

[2] J. Han, J. pei, Y. Yin. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery, 8, 53-87, (2004).

DOI: 10.1023/b:dami.0000005258.31418.83

Google Scholar

[3] S. Ghemawat, H. Gobioff, S. Leung. The Google filesystem, In Proc. of ACM Symposium on Operating Systems Principles, Lake George, NY, Oct 2003, pp.29-43.

DOI: 10.1145/945445.945450

Google Scholar

[4] J. Dean and S. Ghemawat. Distributed programming with Mapreduce. In: Oram A, Wilson G, eds. Beautiful Code. Sebastopol: O'Reilly Media, Inc., 2007. 371-384.

Google Scholar