A Novel Graph Clustering Algorithm Based on Structural Attribute Neighborhood Similarity (SANS)

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 43)


Graph Clustering techniques are widely used in detecting densely connected graphs from a graph network. Traditional Algorithms focus only on topological structure but mostly ignore heterogeneous vertex properties. In this paper we propose a novel graph clustering algorithm, Structural Attribute Neighbourhood Similarity (SANS) algorithm, provides an efficient trade-off between both topological and attribute similarities. First, the algorithm partitions the graph based on structural similarity, secondly the degree of contribution of vertex attributes with the vertex in the partition is evaluated and clustered. An extensive experimental result proves the effectiveness of SANS cluster with the other conventional algorithms.


Structural attribute similarity Graph clustering Neighborhood 


  1. 1.
    Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Networks 16(3), 645–678 (2005)CrossRefGoogle Scholar
  2. 2.
    Ng, R., Han, J.: Efficient and effective clustering method for spatial data mining. In: Proceedings of the International Conference Very Large Data Bases (VLDB’94), pp. 144–155 (1994)Google Scholar
  3. 3.
    Lin, G., Bie, Y., Wang, G., Lei, M.: A novel clustering algorithm based on graph matching. J. Software 8(4) (2013)Google Scholar
  4. 4.
    Fortunato, S.: Community detection in graphs. Physics Reports (2010)Google Scholar
  5. 5.
    Balsubramanan, R., Cohen, W.W.: Block-Ida: jointly modelling entity-annotated text and entity-entity links. In: SDM (2011)Google Scholar
  6. 6.
    McAuley, J., Leskovec, J.: Learning to discover social circles in ego network. In: NIPS (2009)Google Scholar
  7. 7.
    Ahn, Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multi-scale complexity in networks. Nature 466, 761 (2010)CrossRefGoogle Scholar
  8. 8.
    Girvan, M., Newman, M.: Community structure in social and biological networks. PNAS 99(12), 7821–7826 (2002)MATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)CrossRefGoogle Scholar
  10. 10.
    Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: Proceedings of the International Conference Knowledge Discovery and Data Mining (KDD’07), pp. 824–833 (2007)Google Scholar
  11. 11.
    Sun, Y., Han, J., Zhao, P., Yin, Z., Cheng, H., Wu, T.: Rankclus: integrating clustering with ranking for heterogeneous information network analysis. In: Proceedings of the International Conference Extending Database Technology (EDBT’09), pp. 565–576 (2009)Google Scholar
  12. 12.
    Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the ACM-SIGMOD International Conference Management of Data, pp. 567–580 (2008)Google Scholar
  13. 13.
    Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538–543 (2002)Google Scholar
  14. 14.
    Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E. 69, 066133 (2004)CrossRefGoogle Scholar
  15. 15.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)CrossRefGoogle Scholar
  16. 16.
    Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: ICDM (2013)Google Scholar
  17. 17.
    Blondel, V.D., Van Dooren, P.: The measure of similarity between graph vertices, with applications to synonym extraction and web searching. J. Siam Rev. 46(4), 647–666 (2004)MATHCrossRefGoogle Scholar
  18. 18.
    Zhou, Y., Cheng, H., Yu, J.X.: Clustering large attributed graphs: a balance between structural and attribute similarities. TKDD 5(2), 12 (2011)Google Scholar
  19. 19.
    Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural/attribute similarities. VLDB 2(1), 718–729 (2009)Google Scholar
  20. 20.
    Zhou, Y., Cheng, H., Yu, J.X.: Clustering large attributed graphs: an efficient incremental approach. In: ICDM. pp. 689–698 (2010)Google Scholar
  21. 21.
    Xu, Z., Ke, Y., Wang, Y., Cheng, H., Cheng, J.: A model-based approach to attributed graph clustering. In: ACM-SIGMOD (2012)Google Scholar
  22. 22.
    Gleich, D.F., Seshadhri, C.: Neighborhoods are good communities. In: KDD (2012)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.School of Information Technology & EngineeringVIT UniversityVelloreIndia

Personalised recommendations