Research Article

PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm

by  Raheleh Biglari, Alireza Bagheri
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 107 - Issue 1
Published: December 2014
Authors: Raheleh Biglari, Alireza Bagheri
10.5120/18715-9934
PDF

Raheleh Biglari, Alireza Bagheri . PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm. International Journal of Computer Applications. 107, 1 (December 2014), 22-26. DOI=10.5120/18715-9934

                        @article{ 10.5120/18715-9934,
                        author  = { Raheleh Biglari,Alireza Bagheri },
                        title   = { PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm },
                        journal = { International Journal of Computer Applications },
                        year    = { 2014 },
                        volume  = { 107 },
                        number  = { 1 },
                        pages   = { 22-26 },
                        doi     = { 10.5120/18715-9934 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2014
                        %A Raheleh Biglari
                        %A Alireza Bagheri
                        %T PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm%T 
                        %J International Journal of Computer Applications
                        %V 107
                        %N 1
                        %P 22-26
                        %R 10.5120/18715-9934
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

Clustering is one of the major techniques in data mining. PreDeCon is a density-based clustering algorithm for computing clusters of spatial objects. In this paper, PPreDeCon is presented as a parallel version of this algorithm in shared memory model. The theoretical analysis and experimental results show that PPreDeCon offers nearly linear speedup while keeps other advantages of PreDeCon.

References
  • D. Joshi, A. K. Samal, and Leen-Kiat Soh, "Density-based clustering of polygons," Computational Intelligence and Data Mining: CIDM'09, IEEE , pp. 171-178, 2009
  • M. Ester, HP. Kriegel, J. Sander, X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," In Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining: KDD, Vol. 96, pp. 226-231, 1996.
  • J. Sander, M. Ester, HP Kriegel and X. Xu, "Density-based clustering in spatial databases: The algorithm GDBSCAN and its Applications," Data Mining and Knowledge Discovery, Vol. 2, Iss. 2, pp. 169-194, 1998.
  • M. Ankerst, MM. Breunig, HP. Kriegel and J. Sander, "OPTICS: ordering points to identify the clustering structure," ACM SIGMOD Record, Vol. 28, Iss. 2, pp. 49-60, 1999.
  • B. Zhou, D. W. Cheung and B. Kao, "A fast algorithm for density-based clustering in large database," Methodologies for Knowledge Discovery and Data Mining, Springer Berlin Heidelberg, Vol. 1574, pp. 338-349, 1999.
  • Kim, Wooyoung, "Parallel clustering algorithms: survey," CSC 8530 Parallel Algorithms, spring 2009.
  • X. Xu, J. Jager, and HP. Kriegel, "A Fast Parallel Clustering Algorithm for Large Spatial Databases," High Performance Data Mining, Springer, pp. 263 – 290, 2002.
  • H. Meyerhenke, "PFDC: A Parallel Algorithm for Fast Density-based Clustering in Large Spatial Databases," In Informatiktage 2002, Konradin Verlagsgruppe, pp. 48 – 52, 2003.
  • C. Böhm, K. Railing and HP. Kriegel, "Density connected clustering with local subspace preferences," 4th Int. Conf. on Data Mining: ICDM'04, IEEE, pp. 27-34, 2004.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

clustering algorithms parallel algorithms spatial databases density-based clustering shared memory model.

Powered by PhDFocusTM