Efficient Distributed Approach for Density-Based Clustering
- 1 June 2011
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2011 IEEE 20th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
- p. 145-150
- https://doi.org/10.1109/wetice.2011.27
Abstract
Nowadays, large bodies of data in different domains are collected and stored. An efficient extraction of useful knowledge from these data becomes a huge challenge. This leads to the need for developing distributed data mining techniques. However, only a few research concerns distributed clustering for analysing large, heterogeneous and distributed datasets. Besides, current distributed clustering approaches are normally generating global models by aggregating local results that would lose important knowledge. In this paper, we present a new distributed data mining approach where local models are not directly merged to build the global ones. Preliminary results of this algorithm are also discussed.Keywords
This publication has 7 references indexed in Scilit:
- Toward Distributed Knowledge Discovery on Grid SystemsAdvanced Information and Knowledge Processing, 2010
- A New Approach for Distributed Density Based Clustering on Grid PlatformLecture Notes in Computer Science, 2007
- Exploratory spatio-temporal data mining and visualizationJournal of Visual Languages & Computing, 2007
- An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and RandomizationMachine Learning, 2000
- A Principal Components Approach to Combining Regression EstimatesMachine Learning, 1999
- Parallel mining of association rulesIEEE Transactions on Knowledge and Data Engineering, 1996
- The power of sampling in knowledge discoveryPublished by Association for Computing Machinery (ACM) ,1994