Cross-Face Centrality: A New Measure for Identifying Key Nodes in Networks Based on Formal Concept Analysis

Discovering influential nodes (or actors) in the network is often the key task of mining, analyzing, and understanding real-life networks. Centrality measures are commonly used to detect important nodes that control the information propagation in the network. While off-the-shelf centrality indices may provide effective node identification in several situations, they frequently produce inadequate results when confronted with massive networks, in the presence of complex local structures or the lack of certain characteristics. In this paper, we introduce Cross-face, a new scalable centrality measurement for the identification of key nodes in such networks. Inspired by the Formal Concept Analysis (FCA) framework, the conceptual idea of “Cross-face” is to leverage the faces of concepts to identify nodes that are located in “face bridges” and have an influential “cross clique” connectivity. Thus, it concurrently measures how the node influences its neighbour nodes through its cross cliques while linking the densely connected substructures of the network via its presence in bridges. Unlike traditional centrality measures, the cross-face of nodes can be computed using only a set of symmetrical concepts, which is often quite small compared to the set of nodes or edges in the network. Our experiments on several real-world networks show the efficiency of Cross-face over existing prominent centrality indices such as betweenness, closeness, eigenvector, and k-shell among others.

[1]  Ben D. Fulcher,et al.  Consistency and differences between centrality measures across distinct classes of networks , 2018, PloS one.

[2]  Francisco Aparecido Rodrigues,et al.  Network Centrality: An Introduction , 2018, A Mathematical Modeling Approach from Nonlinear Dynamics to Complex Systems.

[3]  Xiang-Yang Li,et al.  Ranking of Closeness Centrality for Large-Scale Social Networks , 2008, FAW.

[4]  S. Borgatti,et al.  Analyzing Clique Overlap , 2009 .

[5]  Changxing Pei,et al.  Modeling and Analyzing the Influence of Multi-Information Coexistence on Attention , 2019, IEEE Access.

[6]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Seyed Shahriar Arab,et al.  CentiServer: A Comprehensive Resource, Web-Based Application and R Package for Centrality Analysis , 2015, PloS one.

[8]  Rokia Missaoui,et al.  Detecting communities in social networks using concept interestingness , 2018, CASCON.

[9]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[10]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[11]  Uyen Trang Nguyen,et al.  A Study of XSS Worm Propagation and Detection Mechanisms in Online Social Networks , 2013, IEEE Transactions on Information Forensics and Security.

[12]  Mark S. Granovetter T H E S T R E N G T H O F WEAK TIES: A NETWORK THEORY REVISITED , 1983 .

[13]  Christina Durón,et al.  Heatmap centrality: A new measure to identify super-spreader nodes in scale-free networks , 2020, PloS one.

[14]  M. Newman Mathematics of networks , 2018, Oxford Scholarship Online.

[15]  Hiroyuki Ohsaki,et al.  Analysis of the Robustness of Degree Centrality against Random Errors in Graphs , 2015, CompleNet.

[16]  U. Brandes A faster algorithm for betweenness centrality , 2001 .

[17]  Nan Zhao,et al.  Ranking Influential Nodes in Complex Networks with Information Entropy Method , 2020, Complex..

[18]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[19]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[20]  Rokia Missaoui,et al.  A partition-based approach towards constructing Galois (concept) lattices , 2002, Discret. Math..

[21]  Vicky Choi Faster Algorithms for Constructing a Concept (Galois) Lattice , 2006, ArXiv.

[22]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[24]  Xiao Zhang,et al.  Localization and centrality in networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Yang Gao,et al.  A New Approach to Identify Influential Spreaders in Complex Networks , 2013, WAIM.