Identifying Influential Nodes in Social Networks by Integrating the Centrality Method and Node Activity

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KARIMI A.; Bastami E.; NEMATI M.; SALEH ESFEHANI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ELECTRONIC AND CYBER DEFENCE Year:2020 | Volume:8 | Issue:3 (31) Page(s): 1-11

Download Full-Text

Persian Verion

View:

495

Download:

Cites:

Information Journal Paper

Title

Identifying Influential Nodes in Social Networks by Integrating the Centrality Method and Node Activity

Author(s)

KARIMI A. | Bastami E. | NEMATI M. | SALEH ESFEHANI M. | Issue Writer Certificate

Keywords

InfluenceQ1

Influential NodesQ1

Influence Maximization (IM)Q1

CentralityQ1

ActivityQ2

Abstract

Nowadays, social networks have become a strong tool among researchers in addition to their social functions. This tool has many applications in identifying crimes, criminals and terrorists, solving epidemic problems, successful marketing and other topics in various fields. The researchers are using the Influence maximization (IM) to achieve these goals. The task of maximization is to identify the Influential Nodes that are known as the seed nodes. It is a strategy to achieve the maximum information diffusion or minimum epidemy with minimal cost. Since maximization is an NP-hard problem, researchers are looking for ways to reduce the complexity and acceptable identification accuracy by identifying Influential Nodes. Therefore, to overcome the complexity and increase the identification accuracy, in this research a new method with Activity-Centrality combination is proposed. In this approach, to extract nodes by the Centrality method a total constraint is constructed on the network graph in order to proceed to the local nodes extracted from the node Activity analysis. The results of analyzing the Activity of each node are combined with its Centrality method score which ultimately leads to the identification of Influential Nodes. The proposed method is compared with other methods such as PageRank and Closeness Centrality methods, and the evaluation results show that whilst having a lower complexity, the proposed method is better than both in terms of accuracy. In the future, the concepts of repetitive scoring can be used to further enhance the accuracy of the Activity analysis phase.

Cites

No record.

References

No record.

Cite

APA: Copy

KARIMI, A., Bastami, E., NEMATI, M., & SALEH ESFEHANI, M.. (2020). Identifying Influential Nodes in Social Networks by Integrating the Centrality Method and Node Activity. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 8(3 (31) ), 1-11. SID. https://sid.ir/paper/386164/en

Vancouver: Copy

KARIMI A., Bastami E., NEMATI M., SALEH ESFEHANI M.. Identifying Influential Nodes in Social Networks by Integrating the Centrality Method and Node Activity. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2020;8(3 (31) ):1-11. Available from: https://sid.ir/paper/386164/en

IEEE: Copy

A. KARIMI, E. Bastami, M. NEMATI, and M. SALEH ESFEHANI, “Identifying Influential Nodes in Social Networks by Integrating the Centrality Method and Node Activity,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 8, no. 3 (31) , pp. 1–11, 2020, [Online]. Available: https://sid.ir/paper/386164/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops