Detecting bridging nodes in network using spectral fuzzy clustering

Bridging nodes serve as junction or link between two or more clusters of a network or graph. In this paper, we propose a method for detecting the bridging nodes by analyzing membership coefficients (obtained from Fuzzy Communities or Clusters) and a flexible cluster size dependent threshold value. Spectral methods, which are based on eigen-decomposition are employed for obtaining fuzzy clusters.

[1]  T. Nepusz,et al.  Fuzzy communities and the concept of bridgeness in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[3]  Bhaskar Biswas,et al.  Dimension reduction using spectral methods in FANNY for fuzzy clustering of graphs , 2015, 2015 Eighth International Conference on Contemporary Computing (IC3).

[4]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[5]  Aidong Zhang,et al.  Bridging Centrality: Identifying Bridging Nodes in Scale-free Networks , 2006 .

[6]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[7]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[8]  J. Bezdek,et al.  FCM: The fuzzy c-means clustering algorithm , 1984 .

[9]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[10]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

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