Soft and Adaptive Aggregation of Heterogeneous Graphs with Heterogeneous Attributes

  • Amine LouatiEmail author
  • Marie-Aude Aufaure
  • Etienne Cuvelier
  • Bruno Pimentel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9507)


In the enterprise context, people need to exploit, interpret and mainly visualize different types of interactions between heterogeneous objects. Graph model is an appropriate way to represent those interactions. Nodes represent the individuals or objects and edges represent the relationships between them. However, extracted graphs are in general heterogeneous and large sized which makes it difficult to visualize and to analyze easily. An adaptive aggregation operation is needed to have more understandable graphs in order to allow users discovering underlying information and hidden relationships between objects. Existing graph summarization approaches such as k-SNAP are carried out in homogeneous graphs where nodes are described by the same list of attributes that represent only one community. The aim of this work is to propose a general tool for graph aggregation which addresses both homogeneous and heterogeneous graphs. To do that, we develop a new soft and adaptive approach to aggregate heterogeneous graphs (i.e., composed of different node attributes and different relationship types) using the definition of Rough Set Theory (RST) combined with Formal Concept Analysis (FCA), the well known K-Medoids and the hierarchical clustering methods. Aggregated graphs are produced according to user-selected node attributes and relationships. To evaluate the quality of the obtained summaries, we propose two quality measures that evaluate respectively the similarity and the separability in groups based on the notion of common neighbor nodes. Experimental results demonstrate that our approach is effective for its ability to produce a high quality solution with relevant interpretations.


Graphs Homogeneous and heterogeneous social networks Aggregation Clustering 


  1. 1.
    Freeman, L.: A set of measures of centrality based upon betweenness. Sociometry 40, 35–41 (1977)CrossRefGoogle Scholar
  2. 2.
    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. JProc. Natl. Acad. Sci. USA 99(12), 7821–7826 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E. 69(2), 026113 (2004)CrossRefGoogle Scholar
  4. 4.
    Schaeffer, S.A.: Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM, pp. 721–724(2002)Google Scholar
  7. 7.
    Sun, Y., Aggarwal, C.C., Han, J.: Relation strength-aware clustering of heterogeneous information networks with incomplete attributes. Proc. VLDB Endow. 5(5), 394–405 (2012)CrossRefGoogle Scholar
  8. 8.
    Tian, Y., Hankins, R.A., Pate, l.J.M.: Efficient aggregation for graph summarization. In: SIGMOD, pp. 567–580. ACM (2008)Google Scholar
  9. 9.
    Soussi, R., Aufaure, M.A., Zghal, H.B.: Towards social network extraction using a graph database. In: DBKDA, pp. 28–34. IEEE Computer Society (2010)Google Scholar
  10. 10.
    Santo, F.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Cam, L.M.L., Neyman, J. (eds.): Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297. University of California Press (1967)Google Scholar
  12. 12.
    Newman, M.E.J.: Detecting community structure in networks. Eur. Phys. J. B 38, 321–330 (2004)CrossRefGoogle Scholar
  13. 13.
    Rodrigues Jr., J.F., Traina, A.J.M., Faloutsos, C., Traina Jr., C.: Supergraph visualization. In: ISM 2006: Proceedings of the Eighth IEEE International Symposium on Multimedia, pp. 227–234. IEEE Computer Society (2006)Google Scholar
  14. 14.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE TPAMI 22(8), 888–905 (2000)CrossRefGoogle Scholar
  15. 15.
    Ng, A., Jordan, M., Weiss, Y., Dietterich, T., Becker, S., Ghahramani, Z.: Advances in Neural Information Processing Systems. MIT Press, Cambridge (2002)Google Scholar
  16. 16.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Chakrabarti, D., Faloutsos, C., Zhan, Y.: Visualization of large networks with min-cut plots, A-plots and R-MAT. Int. J. Hum.-Comput. Stud. 65(5), 434–445 (2007)CrossRefGoogle Scholar
  18. 18.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)CrossRefGoogle Scholar
  19. 19.
    Ren, X., Wang, Y., Yu, X., Yan, J., Chen, Z., Han, J.: Heterogeneous graph-based intent learning with queries, web pages and wikipedia concepts. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 23–32. ACM (2014)Google Scholar
  20. 20.
    Wei, L., Qi, J.J.: Relation between concept lattice reduction and rough set reduction. Knowl.-Based Syst. 23(8), 934–938 (2010)CrossRefGoogle Scholar
  21. 21.
    Shi, C., Niu, Z., Wang, T.: Considering the relationship between RST and FCA. In: WKDD, pp. 224–227. IEEE Computer Society (2010)Google Scholar
  22. 22.
    Stumme, G.: Formal concept analysis. In: Handbook on Ontologies 2009, pp. 177–199 (2009)Google Scholar
  23. 23.
    Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264–323 (1999)CrossRefGoogle Scholar
  24. 24.
    Duda, R.O., Stork, D.G., Hart, P.E.: Pattern Classification. Wiley, New York; Chichester (2000)zbMATHGoogle Scholar
  25. 25.
    Gan, G., Ma, C., Wu, J.: Data Clustering - Theory, Algorithms, and Applications. SIAM, Philadelphia (2007)CrossRefzbMATHGoogle Scholar
  26. 26.
    Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Kluwer Academic Publishers, Norwell (1981)CrossRefzbMATHGoogle Scholar
  27. 27.
    Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)CrossRefGoogle Scholar
  28. 28.
    Salvador, S., Chan, P.: Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms. In: ICTAI, pp. 576–584. IEEE Computer Society (2004)Google Scholar
  29. 29.
    Adamic, L.A., Glance, N.: The political blogosphere and the 2004 U.S. election: Divided they blog. In: LinkKDD, pp. 36–43. ACM (2005)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Amine Louati
    • 1
    Email author
  • Marie-Aude Aufaure
    • 2
  • Etienne Cuvelier
    • 3
  • Bruno Pimentel
    • 4
  1. 1.PSL, Université Paris-DauphineParisFrance
  2. 2.École Centrale Paris MAS LaboratoryParisFrance
  3. 3.ICHEC Brussels School of ManagementBrusselsBelgium
  4. 4.Centro de InformaticaUniversidade Federal de PernambucoRecifeBrazil

Personalised recommendations