CFP last date
20 December 2024
Reseach Article

Performance Improvement through Parallelization of Graph Clustering algorithm

by Yogendra Kumar Dehariya, Ravi Shankar Singh
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 93 - Number 9
Year of Publication: 2014
Authors: Yogendra Kumar Dehariya, Ravi Shankar Singh
10.5120/16241-5791

Yogendra Kumar Dehariya, Ravi Shankar Singh . Performance Improvement through Parallelization of Graph Clustering algorithm. International Journal of Computer Applications. 93, 9 ( May 2014), 7-10. DOI=10.5120/16241-5791

@article{ 10.5120/16241-5791,
author = { Yogendra Kumar Dehariya, Ravi Shankar Singh },
title = { Performance Improvement through Parallelization of Graph Clustering algorithm },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 93 },
number = { 9 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 7-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume93/number9/16241-5791/ },
doi = { 10.5120/16241-5791 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:15:20.596139+05:30
%A Yogendra Kumar Dehariya
%A Ravi Shankar Singh
%T Performance Improvement through Parallelization of Graph Clustering algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 93
%N 9
%P 7-10
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clustering is the task of Grouping of elements or nodes (in the case of graph) in to clusters or subgroup based on some similarity metrics. In general Clustering is unsupervised learning task requires very little or prior knowledge except the data set. However Clustering Task are computationally expensive as most of the algorithms require recursion or iterations and most of the time we have to deal with real life data set which are generally very huge in size. This paper deals with a well-known clustering algorithm MCL (Markov Clustering Algorithm) and proposes a parallel version of it using OPENMP.

References
  1. Sauta Elisa Schaeffer, "Survey Graph clustering," Elsevier Computer Science Review, vol. I, pp. 27-64, 2007.
  2. Venu Satuluri, "Markov Clustering of Protein Interaction Networks with Improved Balance and Scalability" ACM-BCB 2010, Niagara Falls, NY, USA.
  3. ULRIK BRANDES, MARCO GAERTLER and DOROTHEA WAGNER, "Engineering Graph Clustering: Models and Experimental Evaluation" ACM Journal of Experimental Algorithmic 12 (2007), Article 1. 1.
  4. S. van Dongen. MCL - Graph Clustering by Flow Simulation. Ph. D. Thesis, University of Utrecht, 2000.
  5. P. Upadhyaya. Clustering Techniques for Graph Representations of Data. Technical report, Indian Institute of Technology Bombay, 2008.
  6. V. Satuluri and S. Parthasarathy. Scalable Graph Clustering Using Stochastic Flows: Applications to Community Discovery. KDD, 2009.
  7. Nitin Agarwal and Huan Liu and Lei Tang and Philip S. Yu}, Booktitle = {Proccedings of the First ACM International Conference on Web Search and Data Mining (Video available at: http://videolectures. net/wsdm08_agarwal_iib/)},Title = {Identifying the Influential Bloggers}, Pages = {207--218}, Url ={http://videolectures. net/wsdm08_agarwal_iib/}, Year = {2008},}
  8. Yogendra Kumar Dehariya,"Comparative Analysis of graph Clustering algorithm using Bloggers Data",ICICT 2014.
Index Terms

Computer Science
Information Sciences

Keywords

MCL (Markov Clustering Algorithm) OPEN-MP Parallelization.