Extracting incidental and global knowledge through compact pattern trees in distributed environment

Authors:
K. Swarupa Rani;V. Kamakshi Prasad;C. Raghavendra Rao
Affiliations:
Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India,School of Information Technology, JNTU Hyderabad, Hyderabad, India;Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India,School of Information Technology, JNTU Hyderabad, Hyderabad, India;Department of Computer and Information Sciences, University of Hyderabad, Hyderabad, India,School of Information Technology, JNTU Hyderabad, Hyderabad, India
Venue:
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Year:
2012

Citing 5
Cited 0

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Privacy-preserving data mining

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient single-pass frequent pattern mining using a prefix-tree

Information Sciences: an International Journal
Parallel and Distributed Frequent Pattern Mining in Large Databases

HPCC '09 Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and Communications
Frequent pattern mining using modified CP-tree for knowledge discovery

ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes to extract incidental and global knowledge through Compact Pattern Trees in a hierarchical structure through distributed and parallel computing paradigm. This method also facilitates privacy preserving with a minimal communication load. We present the experiments on different kinds of benchmark datasets for proposed mechanism.