A Longitudinal Social Network Clustering Method Based on Tie Strength

Longitudinal social network clustering is an emerging research area with many applications. Previous research typically focuses on the development of the clusters in the longitudinal network. In this paper, we propose an alternative method for longitudinal social network clustering, in which we assume that the clustering and the evolution of the network are the results of its inner structure, the strength of the ties among the nodes in the network. We estimate the strength of the ties based on the evolution of the network over time through a continuous Markov process and then clustering the network based on the strength of the ties of the whole network. A simulation study shows that the proposed method performs well under a variety of conditions. The application of the method is illustrated through the analysis of a real set of data.

[1]  J. R. Landis,et al.  The measurement of observer agreement for categorical data. , 1977, Biometrics.

[2]  Youngdo Kim,et al.  Finding communities in directed networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  René Veenstra,et al.  Network–Behavior Dynamics , 2013 .

[4]  Jacob Cohen.  A Coefficient of Agreement for Nominal Scales , 1960 .

[5]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[6]  Kon Shing Kenneth Chung,et al.  Capturing actor-level dynamics of longitudinal networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[7]  Srinivasan Parthasarathy,et al.  An event-based framework for characterizing the evolutionary behavior of interaction graphs , 2007, KDD '07.

[8]  Linton C. Freeman,et al.  The Sociological Concept of "Group": An Empirical Test of Two Models , 1992, American Journal of Sociology.

[9]  T. Snijders.  Statistical Models for Social Networks , 2011 .

[10]  Bart Selman,et al.  Tracking evolving communities in large linked networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Neil Henry.  Latent structure analysis , 1969 .

[12]  Nick S. Jones,et al.  Dynamic communities in multichannel data: an application to the foreign exchange market during the 2007-2008 credit crisis. , 2008, Chaos.

[13]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[14]  Arif Khan,et al.  A topological framework to explore longitudinal social networks , 2014, Computational and Mathematical Organization Theory.

[15]  H. Jeffreys.  An invariant form for the prior probability in estimation problems , 1946, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[16]  André Carlos Ponce de Leon Ferreira de Carvalho,et al.  Spectral methods for graph clustering - A survey , 2011, Eur. J. Oper. Res..

[17]  Tom A. B. Snijders,et al.  Social Network Analysis , 2011, International Encyclopedia of Statistical Science.

[18]  Tom A. B. Snijders,et al.  Introduction to stochastic actor-based models for network dynamics , 2010, Soc. Networks.

[19]  Arif Khan,et al.  A set of measures to quantify the dynamicity of longitudinal social networks , 2016, Complex..

[20]  Paul F. Lazarsfeld,et al.  Latent Structure Analysis. , 1969 .

[21]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[22]  T. Caliński,et al.  A dendrite method for cluster analysis , 1974 .

[23]  Mark Huisman,et al.  Imputation of missing network data: Some simple procedures , 2009, J. Soc. Struct..

[24]  Tom A. B. Snijders,et al.  Friendship Networks Through Time: An Actor-Oriented Dynamic Statistical Network Model , 1999, Comput. Math. Organ. Theory.

[25]  G. W. Milligan,et al.  An examination of procedures for determining the number of clusters in a data set , 1985 .

[26]  Peter D. Hoff,et al.  Bilinear Mixed-Effects Models for Dyadic Data , 2005 .

[27]  T. Snijders.  Stochastic actor-oriented models for network change , 1996 .

[28]  Marina Meila,et al.  Clustering by weighted cuts in directed graphs , 2007, SDM.

[29]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[30]  Anja Znidarsic,et al.  Non-response in social networks: The impact of different non-response treatments on the stability of blockmodels , 2012, Soc. Networks.

[31]  Zhengding Lu,et al.  Community mining on dynamic weighted directed graphs , 2009, CIKM-CNIKM.

[32]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[33]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[34]  Srinivasan Parthasarathy,et al.  Symmetrizations for clustering directed graphs , 2011, EDBT/ICDT '11.

[35]  T. Snijders,et al.  The Use of Multilevel Modeling for Analysing Personal Networks: Networks of Cocaine Users in an Urban Area. , 1995 .

[36]  Michalis Vazirgiannis,et al.  Clustering and Community Detection in Directed Networks: A Survey , 2013, ArXiv.

[37]  Yun Chi,et al.  Evolutionary spectral clustering by incorporating temporal smoothness , 2007, KDD '07.