Laplacian Matrix Based Spectral Graph Clustering

Recent attention in the research field of clustering is focused on grouping of clusters based on structure of a graph. At present, there are plentiful literature work has been proposed towards the clustering techniques but it is still an open challenge to find the best technique for clustering. This paper present a comprehensive review of our insights towards emerging clustering methods on graph based spectral clustering. Graph Laplacians have become a core technology for the spectral clustering which works based on the properties of the Laplacian matrix. In our study, we discuss correlation between similarity and Laplacian matrices within a graph and spectral graph theory concepts. Current studies on graph-based clustering methods requires a well defined good quality graph to achieve high clustering accuracy. This paper describes how spectral graph theory has been used in the literature of clustering concepts and how it helps to predict relationships that have not yet been identified in the existing literature. Some application areas on the graph clustering algorithms are discussed. This survey outlines the problems addressed by the existing research works on spectral clustering with its problems, methodologies, data sets and advantages. This paper identifies fundamental issues of graph clustering which provides a better direction for more applications in social network analysis, image segmentation, computer vision and other domains.