CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm

by Raheleh Biglari, Alireza Bagheri
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 107 - Number 1
Year of Publication: 2014
Authors: Raheleh Biglari, Alireza Bagheri
10.5120/18715-9934

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 },
issue_date = { December 2014 },
volume = { 107 },
number = { 1 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 22-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume107/number1/18715-9934/ },
doi = { 10.5120/18715-9934 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:39:55.810472+05:30
%A Raheleh Biglari
%A Alireza Bagheri
%T PPreDeCon: A Parallel version of Preference Density Connected Clustering Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 107
%N 1
%P 22-26
%D 2014
%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
  1. 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
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. Kim, Wooyoung, "Parallel clustering algorithms: survey," CSC 8530 Parallel Algorithms, spring 2009.
  7. 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.
  8. H. Meyerhenke, "PFDC: A Parallel Algorithm for Fast Density-based Clustering in Large Spatial Databases," In Informatiktage 2002, Konradin Verlagsgruppe, pp. 48 – 52, 2003.
  9. 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

Keywords

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

Powered by PhDFocusTM