Identifying Influential Nodes in Two-mode Data Networks using Formal Concept Analysis

09/07/2021
by   Mohamed-Hamza Ibrahim, et al.
0

Identifying important actors (or nodes) in a two-mode network often remains a crucial challenge in mining, analyzing, and interpreting real-world networks. While traditional bipartite centrality indices are often used to recognize key nodes that influence the network information flow, they frequently produce poor results in intricate situations such as massive networks with complex local structures or a lack of complete knowledge about the network topology and certain properties. In this paper, we introduce Bi-face (BF), a new bipartite centrality measurement for identifying important nodes in two-mode networks. Using the powerful mathematical formalism of Formal Concept Analysis, the BF measure exploits the faces of concept intents to identify nodes that have influential bicliques connectivity and are not located in irrelevant bridges. Unlike off-the shelf centrality indices, it quantifies how a node has a cohesive-substructure influence on its neighbour nodes via bicliques while not being in network core-peripheral ones through its absence from non-influential bridges. Our experiments on several real-world and synthetic networks show the efficiency of BF over existing prominent bipartite centrality measures such as betweenness, closeness, eigenvector, and vote-rank among others.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2021

Detecting Important Patterns Using Conceptual Relevance Interestingness Measure

Discovering meaningful conceptual structures is a substantial task in da...
research
02/05/2019

Detecting Local Community Structures in Social Networks Using Concept Interestingness

One key challenge in Social Network Analysis is to design an efficient a...
research
06/12/2018

Bipartite graph analysis as an alternative to reveal clusterization in complex systems

We demonstrate how analysis of co-clustering in bipartite networks may b...
research
12/20/2018

A spectral method for bipartizing a network and detecting a large anti-community

Relations between discrete quantities such as people, genes, or streets ...
research
03/02/2023

Sensitivity of matrix function based network communicability measures: Computational methods and a priori bounds

When analyzing complex networks, an important task is the identification...
research
06/13/2020

Top influencers can be identified universally by combining classical centralities

Information flow, opinion, and epidemics spread over structured networks...
research
12/12/2012

Bayesian one-mode projection for dynamic bipartite graphs

We propose a Bayesian methodology for one-mode projecting a bipartite ne...

Please sign up or login with your details

Forgot password? Click here to reset