Leveraging a Hierarchical Selection of Communities in Social Networks to Maximize Diffusion

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.

HEIDARI MOHSEN; Fasahat Mohamad Ali; Afsharian Sanaz; Artishdar Parinaz

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2023 | Issue:9

Download Full-Text

View:

Download:

Information Seminar Paper

Title

Leveraging a Hierarchical Selection of Communities in Social Networks to Maximize Diffusion

Author(s)

HEIDARI MOHSEN | Fasahat Mohamad Ali | Afsharian Sanaz | Artishdar Parinaz

Keywords

Social network analysis

seed nodes

influence spread

diffusion

influence maximization

Abstract

For businesses, discovering key nodes in social networks has a high computational overhead and cost. Because of this, in the problem of influence maximization, at least key nodes with the most influence in social networks are chosen at the lowest possible cost. Numerous algorithms have been proposed to find key nodes in social networks using the technique of influence maximization under the characteristics of submodularity and monotonicity,however, these algorithms struggle with the issue of optimal influence spread because some graph characteristics are ignored when considering diffusion and influence spread in the social network. The HSMD method, which gives special weight to the structure of communities and selects key nodes hierarchically utilizing the structure of communities, has been presented as a solution to this challenge. Based on the characteristics and strategic placement of the nodes within each community, weight is given to each community in this algorithm. seed nodes are then chosen hierarchically using BFS traversal. This method enhanced the influence spread rate and execution time of recently introduced algorithms such as CTIM, IMBC, RNR, HEDVGreedy, and k-shell.

Cites

No record.

References

No record.

Cite

APA: Copy

HEIDARI, MOHSEN, Fasahat, Mohamad Ali, Afsharian, Sanaz, & Artishdar, Parinaz. (). . . SID. https://sid.ir/paper/1047277/en

Vancouver: Copy

HEIDARI MOHSEN, Fasahat Mohamad Ali, Afsharian Sanaz, Artishdar Parinaz. . . Available from: https://sid.ir/paper/1047277/en

IEEE: Copy

MOHSEN HEIDARI, Mohamad Ali Fasahat, Sanaz Afsharian, and Parinaz Artishdar, “,” presented at the . , [Online]. Available: https://sid.ir/paper/1047277/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops