A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem 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.

Aghaee Zahra; Ahmadi Beni Hamid; Kianian Sahar; 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:

Download:

126

Information Seminar Paper

Title

A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks

Author(s)

Aghaee Zahra | Ahmadi Beni Hamid | Kianian Sahar | Vahidipour Seyyed Mehdi

Keywords

Influence Maximization Problem

Influence Spread

Rich-Club Phenomenon

Eigenvector Centrality

Abstract

The strength of information diffusion on social networks depends on many factors, including the selected influential nodes. The problem of finding such nodes in the network is modeled by Influence Maximization Problem, which faces two essential challenges: (1) inadequate selection of the seed nodes due to the lack of focus on the Rich-Club Phenomenon and (2) high running time due to the lack of focus on pruning the graph nodes and localization. To solve these challenges, a computational localization-based RLIM algorithm is presented here to prevent the Rich-Club Phenomenon. In this algorithm, the graph nodes are pruned based on the Eigenvector Centrality to reduce the computational overhead, and then the computations are performed locally using localization criteria. After that, influential nodes are selected by avoiding the Rich-Club Phenomenon. In the RLIM algorithm, the seed nodes provided a better Influence Spread than the other algorithms. Experimental results on the synthetic and real-world datasets shows that the RLIM algorithm can verify the high effectiveness and efficiency than the comparable algorithms for an Influence Maximization Problem.

Video

Cites

No record.

References

No record.

Cite

APA: Copy

Aghaee, Zahra, Ahmadi Beni, Hamid, Kianian, Sahar, & Vahidipour, Seyyed Mehdi. (2020). A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949237/en

Vancouver: Copy

Aghaee Zahra, Ahmadi Beni Hamid, Kianian Sahar, Vahidipour Seyyed Mehdi. A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks. 2020. Available from: https://sid.ir/paper/949237/en

IEEE: Copy

Zahra Aghaee, Hamid Ahmadi Beni, Sahar Kianian, and Seyyed Mehdi Vahidipour, “A Heuristic Algorithm Focusing on the Rich-Club Phenomenon for the Influence Maximization Problem in Social Networks,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2020, [Online]. Available: https://sid.ir/paper/949237/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops