Integrating heterogeneous information within a social network for detecting communities

ABSTRACT

Attributed graphs can be described using two dimensions: first a structural dimension that contains the social graph, e.g. the actors and the relationships between them, and second a compositional dimension describing the actors, e.g. their profile, their textual publications, the metadata of the videos they share, etc. Each of these dimensions can be used to explain different phenomena occurring on the social network, whether from a connectivity or an thematic perspective. This paper claims that the integration of both dimensions would allow researchers to analyze real social networks from different perspectives. We present here a novel approach to the community detection problem with the integration of the two dimensions composing an attributed graph. We show how to integrate but also how to control the integration of two different partitions, one based on the links, the other one based on the attributes. The resulting partition exhibits interesting properties, such as dense and homogeneous groups of actors, revealing new types of communities to the analyst. Because we use a contingency matrix, and because the analyst may invent new ways of combining rows and columns, we open new perspectives for the exploration of attributed social networks.

References

1. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. No. 8 in Structural Analysis in the Social Science, Cambridge University Press, 1994.
2. J. Neville, M. Adler, and D. D. Jensen, "Clustering relational data using attribute and link information," in Proceedings of the Workshop on Text Mining and Link Analysis, Eighteenth International Joint Conference on Artificial Intelligence, (Acapulco, Mexico), 2003.
3. K. Steinhaeuser and N. Chawla, "Community detection in a large real-world social network," in Social Computing, Behavioral Modeling, and Prediction (H. Liu, J. Salerno, and M. Young, eds.), pp. 168--175, Springer US, 2008.
4. J. D. Cruz, C. Bothorel, and F. Poulet, "Entropy based community detection in augmented social networks," in Computational Aspects of Social Networks (CASoN), 2011 International Conference on, pp. 163--168, oct. 2011.
5. Y. Zhou, H. Cheng, and J. X. Yu, "Graph clustering based on structural/attribute similarities," Proc. VLDB Endow., vol. 2, pp. 718--729, August 2009.
6. L. Hubert and P. Arabie, "Comparing partitions," Journal of Classification, vol. 2, pp. 193--218, 1985. 10.1007/BF01908075.
7. J. D. Cruz, C. Bothorel, and F. Poulet, "Community detection and visualization in social networks: integrating structural and semantic information," Transactions on Intelligent Systems and Technology -- TIST, Accepted - To be published 2013.
8. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, no. 10, p. P10008 (12pp), 2008.
9. T. Kohonen, Self-Organizing Maps. Springer, 1997.