Centrality Measures, Upper Bound, and Influence Maximization in Large Scale Directed Social Networks
Reads0
Chats0
TLDR
Two new centrality measures, Diffusion Degree for independent cascade model of information diffusion and Maximum Influence Degree are proposed, which provide the maximum theoretically possible influence Upper Bound for a node.Abstract:
The paper addresses the problem of finding top k influential nodes in large scale directed social networks. We propose two new centrality measures, Diffusion Degree for independent cascade model of information diffusion and Maximum Influence Degree. Unlike other existing centrality measures, diffusion degree considers neighbors' contributions in addition to the degree of a node. The measure also works flawlessly with non uniform propagation probability distributions. On the other hand, Maximum Influence Degree provides the maximum theoretically possible influence Upper Bound for a node. Extensive experiments are performed with five different real life large scale directed social networks. With independent cascade model, we perform experiments for both uniform and non uniform propagation probabilities. We use Diffusion Degree Heuristic DiDH and Maximum Influence Degree Heuristic MIDH, to find the top k influential individuals. k seeds obtained through these for both the setups show superior influence compared to the seeds obtained by high degree heuristics, degree discount heuristics, different variants of set covering greedy algorithms and Prefix excluding Maximum Influence Arborescence PMIA algorithm. The superiority of the proposed method is also found to be statistically significant as per T-test.read more
Citations
More filters
Journal ArticleDOI
A novel organizing scheme of single topic user group based on trust chain model in social network
TL;DR: An organizing scheme for single‐topic user groups is proposed for facilitating user sharing and communicating under common interests and contains 3 features: topic impact evaluation, interest degree measurement, and trust chain‐based organizing.
Journal ArticleDOI
A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks
TL;DR: An effective discrete shuffled frog-leaping algorithm (DSFLA) is proposed to solve influence maximization problem in a more efficient way and is superior than several state-of-the-art alternatives.
Journal ArticleDOI
Centrality measure in social networks based on linear threshold model
TL;DR: The possibilities of the linear threshold model for the definition of centrality measures to be used on weighted and labeled social networks are explored and a new centrality measure to rank the users of the network, the Linear Threshold Rank (LTR), and a centralization measure to determine to what extent the entire network has a centralized structure are explored.
Journal ArticleDOI
Fuzzy-rough community in social networks
Suman Kundu,Sankar K. Pal +1 more
TL;DR: Experimental results on benchmark data show the superiority of the proposed community detection algorithm compared to other well known methods, particularly when the network contains overlapping communities.
Journal ArticleDOI
A SI model for social media influencer maximization
Jyoti Sunil More,Chelpa Lingam +1 more
TL;DR: A two level approach, designed based on Suspected-Infected (SI) epidemic model for maximizing the influence spread, and multithreading approach for implementation of algorithm for the proposed SI model aids to further elevate the performance of proposed algorithm in terms of influence spread per second.
References
More filters
Journal ArticleDOI
On the centrality in a graph
TL;DR: An index for centrality satisfying the axioms is presented based on the degrees of the vertices in a given undirected graph, and it will enlarge the class of comparable graphs with respect to a centrality measure.
Using Complex Systems Analysis to Advance Marketing Theory Development: Modeling Heterogeneity Effects on New Product Growth through Stochastic Cellular Automata
TL;DR: In this paper, the authors show how a certain type of simulations that is based on complex systems studies (in this case stochastic cellular automata) may be used to generalize diffusion theory one of the fundamental theories of new product marketing.
Journal ArticleDOI
Context in problem solving: a survey
TL;DR: A survey of the literature dealing directly and explicitly with context whatever the domain points out the existence of different types of context in areas such as the representation of knowledge in a computer system, the reasoning that the system carries out using the knowledge, and the interaction the system has with people.
Posted Content
"Birds of a Feather": Does User Homophily Impact Information Diffusion in Social Media?
TL;DR: This article investigates the impact of user homophily on the social process of information diffusion in online social media and proposes a Dynamic Bayesian Network based framework to predict diffusion characteristics at a future time.
Proceedings ArticleDOI
Selecting the Most Influential Nodes in Social Networks
TL;DR: An algorithm for mapping social networks is proposed, which allows visualizing the infection process and how the different algorithms evolve, and the proposed approach is useful for mining large social networks.