IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks

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.

Ahmadi Beni Hamid; Aghaee Zahra; Bouyer Asgarali; Vahidipour Seyyed Mehdi

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2020 | Issue:6

Download Full-Text

View:

143

Download:

Information Seminar Paper

Title

IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks

Author(s)

Ahmadi Beni Hamid | Aghaee Zahra | Bouyer Asgarali | Vahidipour Seyyed Mehdi

Keywords

Influence Maximization Problem

Information Diffusion

Influence Spread

Graph Topology

Centrality

Abstract

Influence maximization is a problem based on diffusion and probability in social networks with the aim of finding the least node with the most influence. These nodes play an essential role in the diffusion process. However, the Influence Maximization Problem faces two essential challenges of time efficiency and optimal selection of the seed nodes. To solve these challenges, we proposed an algorithm based on the properties of the Graph Topology structure and Centrality, called IMT (Influence Maximization based on the Topology) algorithm. This algorithm selects the seed nodes from the dense part of the graph that can access more nodes in the shortest distance. Finally, experiments showed that the proposed algorithm outperformed the other algorithms in terms of Influence Spread and running time.

Video

Cites

No record.

References

No record.

Cite

APA: Copy

Ahmadi Beni, Hamid, Aghaee, Zahra, Bouyer, Asgarali, & Vahidipour, Seyyed Mehdi. (2020). IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949228/en

Vancouver: Copy

Ahmadi Beni Hamid, Aghaee Zahra, Bouyer Asgarali, Vahidipour Seyyed Mehdi. IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks. 2020. Available from: https://sid.ir/paper/949228/en

IEEE: Copy

Hamid Ahmadi Beni, Zahra Aghaee, Asgarali Bouyer, and Seyyed Mehdi Vahidipour, “IMT: Selection of Top-k Nodes based on the Topology Structure in Social Networks,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2020, [Online]. Available: https://sid.ir/paper/949228/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops