Abstract
SAM Centrality: a Hop-Based Centrality Measure for Ranking Users in Social Network
Highlights
Social network is defined as a string of people, groups and their confidential connections [42]
Nieminen [37] altered some postulates of sabidussi [39] centrality index and proposed another centrality measure based on degrees of nodes for undirected network graph
As the PageRank, Betweeness, Degree and Closeness are targeted by the majority of authors and most commonly used, we treat them as a benchmark centrality measures to compare with our proposed centrality
Summary
Social network is defined as a string of people, groups and their confidential connections [42]. Social network is house of spreading news [21], marketing product [44], targeting groups [4] etc To carry out these types of tasks in social network, identifying the central or influential or significant node is challenging task. Centrality specify the most influential or central or significant node in the social network. The centrality of nodes, or detection of influential nodes which are most central than others, has been a basic issue in social network analysis. The majority of centrality measures use the structural information to identify the vital nodes in networks. The key contribution of our paper is the proposal of new centrality measure SAM based on the hop distance of nodes.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EAI Endorsed Transactions on Industrial Networks and Intelligent Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
