AN EFFICIENT ALGORITHM FOR INFLUENCE BLOCKING MAXIMIZATION BASED ON COMMUNITY DETECTION

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.

Arazkhani Niloofar; MEYBODI MOHAMMAD REZA; Rezvanian Alireza

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2019 | Issue:5

Download Full-Text

View:

125

Download:

201

Information Seminar Paper

Title

AN EFFICIENT ALGORITHM FOR INFLUENCE BLOCKING MAXIMIZATION BASED ON COMMUNITY DETECTION

Author(s)

Arazkhani Niloofar | MEYBODI MOHAMMAD REZA | Rezvanian Alireza

Keywords

SOCIAL NETWORK ANALYSIS

INFLUENCE BLOCKING MAXIMIZATION

COMMUNITY DETECTION

FUZZY CLUSTERING

CENTRALITY MEASURES

Abstract

POPULARITY OF ONLINE SOCIAL NETWORK SERVICES MAKES IT A SUITABLE PLATFORM FOR RAPID INFORMATION DIFFUSION RANGING FROM POSITIVE TO NEGATIVES INFORMATION. ALTHOUGH THE POSITIVE DIFFUSED INFORMATION MAY WELCOMED BY PEOPLE, THE NEGATIVE INFORMATION SUCH AS RUMOR, HATE AND MISINFORMATION CONTENT SHOULD BE BLOCKED. HOWEVER, BLOCKING INAPPROPRIATE, UNWANTED AND CONTAMINATION DIFFUSION ARE NOT TRIVIAL. IN PARTICULAR, IN THIS PAPER, WE STUDY THE NOTION OF COMPETING NEGATIVE AND POSITIVE CAMPAIGNS IN A SOCIAL NETWORK BY ADDRESSING THE INFLUENCE BLOCKING MAXIMIZATION (IBM) PROBLEM TO MINIMIZE THE BAD EFFECT OF MISINFORMATION. IBM PROBLEM CAN BE DEFINED AS FINDING A SUBSET OF NODES TO PROMOTE THE POSITIVE INFLUENCE UNDER MULTICAMPAIGN INDEPENDENT CASCADE MODEL AS DIFFUSION MODEL TO MINIMIZE THE NUMBER OF NODES THAT ADOPT THE NEGATIVE INFLUENCE AT THE END OF BOTH PROPAGATION PROCESSES. IN THIS REGARD, WE PROPOSED A COMMUNITY BASED ALGORITHM CALLED FC_IBM ALGORITHM USING FUZZY CLUSTERING AND CENTRALITY MEASURES FOR FINDING A GOOD CANDIDATE SUBSET OF NODES FOR DIFFUSION OF POSITIVE INFORMATION IN ORDER TO MINIMIZING THE IBM PROBLEM. THE EXPERIMENTAL RESULTS ON WELL-KNOWN NETWORK DATASETS SHOWED THAT THE PROPOSED ALGORITHM NOT ONLY OUTPERFORMS THE BASELINE ALGORITHMS WITH RESPECT TO EFFICIENCY BUT ALSO WITH RESPECT TO THE FINAL NUMBER OF POSITIVE NODES.

Cites

No record.

References

No record.

Cite

APA: Copy

Arazkhani, Niloofar, MEYBODI, MOHAMMAD REZA, & Rezvanian, Alireza. (2019). AN EFFICIENT ALGORITHM FOR INFLUENCE BLOCKING MAXIMIZATION BASED ON COMMUNITY DETECTION. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949090/en

Vancouver: Copy

Arazkhani Niloofar, MEYBODI MOHAMMAD REZA, Rezvanian Alireza. AN EFFICIENT ALGORITHM FOR INFLUENCE BLOCKING MAXIMIZATION BASED ON COMMUNITY DETECTION. 2019. Available from: https://sid.ir/paper/949090/en

IEEE: Copy

Niloofar Arazkhani, MOHAMMAD REZA MEYBODI, and Alireza Rezvanian, “AN EFFICIENT ALGORITHM FOR INFLUENCE BLOCKING MAXIMIZATION BASED ON COMMUNITY DETECTION,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2019, [Online]. Available: https://sid.ir/paper/949090/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops