An Improved Concept Lattice-Based Data Mining Algorithm

Article Preview

Abstract:

In order to solve the multidimensional data model and relational data model,query between the two-way data system, data cleansing, data conversion, distributed data accuracy and consistency control problem, this paper described the concept of grid related, the global data mining combined with local data mining is proposed based on local information based on the concept of a global grid of data mining algorithm, and the mining process was divided into ETI. Action, combined with the ETI. Process workflow, using amounts of data distributed parallel sequence mining. Experiments show that the algorithm has a good effect on enhanced data processing capability.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1214-1217

Citation:

Online since:

November 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Y .Y. Yao: A comparative study of formal concept analysis and rough set theory in data analysis. Proc of the rough sets and current trends in computing, LNCS. Berlin; Springcr, 2007 pp.59-68.

DOI: 10.1007/978-3-540-25929-9_6

Google Scholar

[2] X .F. Zhang, W. W. Sun and W. Wang, et al: incremental ETI. process automation generation method research. Journal of Computer Research and Devclopment, Vol. 6 (2010), pp.67-72.

Google Scholar

[3] M . W. Shao : The reduction for two kind of generalized concept lattice. Proc of the 4th Int 1 conf on machine learning and cybcrnctics. Berlin: Springer, 2009, pp.2217-2222.

Google Scholar

[4] H. Wang, W. X. Zhang : Knowledge Reduction in consistant decision formal context. International Journal of Information Technology, Vol. 11(2005), No5, pp.322-331.

Google Scholar