SHOMAN: an efficient method for finding the important nodes in a network
by Shivam Bathla; Omprakash Sah Kanu; Anurag Singh
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 19, No. 3, 2021

Abstract: In this paper, we propose and study the SHOMAN metric for determining the importance of a node in a network. The method is based on a significant feature of networks, namely clustering coefficient, and uses the principle of six degrees of separation to go through only up to six nodes to find the score of node influence. We demonstrate that our algorithm is highly effective at calculating the importance of nodes when compared to other centrality measures. We also propose that our method can be used in viral marketing and controlling disease spreading.

Online publication date: Fri, 15-Oct-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com