Efficient unveiling of multi-members in a social network - Archive ouverte HAL Access content directly
Journal Articles Journal of Systems and Software, Special Issue on Social Cyber System (JSS) Year : 2014

Efficient unveiling of multi-members in a social network

(1) , (2) , (1)
1
2

Abstract

With the rapid growth of the Web 2.0, the discovery of key actors in social networks, called influencers, mediators, ambassadors or experts, has recently received a renewed of attention. In this article, we consider a particular type of actor that we call a multi-member since he belongs to several communities. We introduce a methodological framework to identify these actors in a hypergraph, in which the vertices are the actors and the hyperedges are the communities. We also show that detecting such multi-members is similar to the problem of the determination of a subset of minimal transversals of a hypergraph. An efficient algorithm that relies on the connection between the definition of a multi-member and that of an essential itemset is also introduced. Experiments done on several datasets showed that the introduced algorithm outperforms the pioneering ones of the literature.
Not file

Dates and versions

ujm-01017638 , version 1 (02-07-2014)

Identifiers

  • HAL Id : ujm-01017638 , version 1

Cite

Christine Largeron, Sadok Ben Yahia, Nidhal Jelassi. Efficient unveiling of multi-members in a social network. Journal of Systems and Software, Special Issue on Social Cyber System (JSS), 2014, 94, pp.30-38. ⟨ujm-01017638⟩
67 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More