A NEW SPECTRAL CLUSTERING APPROACH TO DETECTING COMMUNITIES IN GRAPHS

Authors

  • R. Moulay Taj Operational Research Team, Faculty of Science and Technology Errachidia, Morocco.
  • Z. Ait El Mouden Software Engineering & Information Systems Engineering Team, Faculty of Science and Technology, Errachidia, Morocco.
  • A. Jakimi Software Engineering & Information Systems Engineering Team, Faculty of Science and Technology, Errachidia, Morocco.
  • M. Hajar Operational Research Team, Faculty of science and technology, Errachidia, Morocco.

Keywords:

Clustering, Spectral Clustering, Similarity Matrix, Graph Laplacians, Language R

Abstract

Recently, clustering is one of the most important approaches used for exploratory data analysis. It is one of the most widely used approaches for exploratory data analysis. Spectral Clustering (SC) is a technique which relies on the eigenstructure of a similarity matrix to partition points into disjoint clusters with the points in the same cluster having high similarity and the points in various clusters having low similarity.

Clustering nodes in graph is a general technique used in data mining for large network data sets. This paper presents an approach for the detection of communities from graphs with Spectral Clustering. In this research paper, for simulation and implementation, we used igraph package in language R.

References

C. Drouin, “Datamining La famille des rois de France.” http://jeanjacques.villemag.free.fr/

Ajit Kumar, Dharmender Kumar, S. K. Jarial, A Review on Artificial Bee Colony Algorithms and Their Applications to Data Clustering, Journal of Institute of Information and Communication Technologies of Bulgarian Academy of Sciences, V17, I3, 2017.

Studies in Classification, Data Analysis, and Knowledge Organization}. Springer, Heidelberg, 3–10. Bock, H.-H. , 2008.

A. Hatamlou, “Black hole: A new heuristic optimization approach for data clustering,” Inf. Sci. (Ny)., vol. 222, pp. 175–184, 2013.

C. D. Dan A. Simovici, Mathematical Tools for Data Mining. (Advanced Information and Knowledge Processing) , Book, Springer, 2008.

U. Von Luxburg, “A tutorial on spectral clustering,” Stat. Comput., vol. 17, no. 4, pp. 395–416, 2007.

Z. Jingmao and S. Yanxia, “Review on spectral methods for clustering,” Chinese Control Conf. CCC, vol. 2015–Septe, no. 20130093110011, pp. 3791–3796, 2015.

S. White and P. Smyth, “A Spectral Clustering Approach To Finding Communities in Graphs.” pp. 76–84, 2005.

M. C. V Nascimento and A. C. P. L. F. De Carvalho, “Spectral methods for graph clustering – A survey,” vol. 211, pp. 221–231, 2011.

S. Meenakshi and R. Renukadevi, “A Review on Spectral Clustering and its,” pp. 14840–14845, 2016.

A. Y. Ng, M. I. Jordan, and Y. Weiss, “On Spectral Clustering: Analysis and an algorithm,” Adv. Neural Inf. Process. Syst., pp. 849–856, 2001.

G. Csárdi and T. Nepusz, “The igraph software package for complex network research,” InterJournal, Complex Syst., vol. 1695, no. 5, pp. 1–9, 2006.

F. B. De Sousa and S. P. Brazil, “Evaluating and comparing the igraph community detection algorithms,” 2014, pp. 408–413.

Additional Files

Published

15-08-2018

How to Cite

R. Moulay Taj, Z. Ait El Mouden, A. Jakimi, & M. Hajar. (2018). A NEW SPECTRAL CLUSTERING APPROACH TO DETECTING COMMUNITIES IN GRAPHS . International Educational Journal of Science and Engineering, 1(1). Retrieved from https://iejse.com/journals/index.php/iejse/article/view/1