Variance-based Clustering Technique for Distributed Data Mining Applications
|Title:||Variance-based Clustering Technique for Distributed Data Mining Applications||Authors:||Aouad, Lamine
|Permanent link:||http://hdl.handle.net/10197/7849||Date:||28-Jun-2007||Abstract:||Nowadays, huge amounts of data are naturally collected in distributed sites due to different facts and moving these data through the network for extracting useful knowledge is almost unfeasible for either technical reasons or policies. Furthermore, classical parallel algorithms cannot be applied, specially in loosely coupled environments. This requires to develop scalable distributed algorithms able to return the global knowledge by aggregating local results in an effective way. In this paper we propose a distributed algorithm based on independent local clustering processes and a global merging based on minimum variance increases and requires a limited communication overhead. We also introduce the notion of distributed sub-clusters perturbation to improve the global generated distribution. We show that this algorithm improves the quality of clustering compared to classical local centralized ones and is able to find real global data nature or distribution.||Type of material:||Conference Publication||Publisher:||CSREA Press||Keywords:||Data mining;Clustering algorithms||Language:||en||Status of Item:||Peer reviewed||Is part of:||Proceedings of the 2007 International Conference on Data Mining, DMIN 2007, June 25-28, 2007, Las Vegas, Nevada, USA||Conference Details:||2007 International Conference on Data Mining (DMIN'07), Las Vegas, Nevada, USA, 25-28 June 2007|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.