Call for Paper - May 2015 Edition
IJCA solicits original research papers for the May 2015 Edition. Last date of manuscript submission is April 20, 2015. Read More
PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 107 - Number 1
Year of Publication: 2014
|
10.5120/18715-9934 |
Raheleh Biglari and Alireza Bagheri. Article: PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm. International Journal of Computer Applications 107(1):22-26, December 2014. Full text available. BibTeX
@article{key:article,
author = {Raheleh Biglari and Alireza Bagheri},
title = {Article: 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},
month = {December},
note = {Full text available}
}
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.