Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/444630
Title: | Identifying and Ranking Influential Spreaders In Complex Networks |
Researcher: | Raamakirtinan, S |
Guide(s): | Jenila, Livingston L M |
Keywords: | Computer Science Computer Science Interdisciplinary Applications Engineering and Technology |
University: | Vellore Institute of Technology (VIT) University |
Completed Date: | 2022 |
Abstract: | In this digital age, identifying Influential Users (IU) in Complex Networks (CN) has newlinebecome an urgent necessity, and it has evolved as a significant and fascinating research newlinesubject. For instance, influential users help endorse a product campaign or immunize newlinerumors in their network community. Only some users in any given real-world network newlinepossess the ability to accelerate or decelerate the information outbreak. Hence, identifying newlineand ranking these sets of users is an important factor for the same purpose. To find newlineout these influential spreaders, there are several classical and advanced techniques such newlineas Centrality Measure (CM), K-Shell (KS), etc. however, each of these methods has its newlinedrawbacks. Numerous researches on this topic depict the same and propose improved newlinemethodologies. However, most of the proposed techniques compute rankings based on newlineraw network structures alone. In a real-world scenario, numerous metrics lie in the network, newlinewhich act as the crucial factor for information cascade. So, to address this, in this newlinethesis, we propose improved ranking schemes that effectively utilize various underlying newlinekey network metrics and identify influential users who can make information cascade newlinemuch faster. newlineInitially, utilizing a Sentiment Weighted Page Ranking Algorithm (SWPR), the approach newlineoffers a methodology in which a user s influential rank is computed. Here we newlineutilize the well-renowned page rank algorithm score concept of calculating ranks based newlineupon its in-links and out-links; along with it, we extract and infuse nodes underlying newlinesentiment, which helps to narrow down nodes with the right spreading capability. The newlineranking is based on sentiment weighted page ranks value where the number of node newlineconnections to considered node X and the sentiment related to a node which is inputted newlineas its weight plays crucial factors. From the experimentation, it is deduced that infection newline(information cascade) propagated by the top N users ranked by the proposed newlineranking method SWPR is high and quicker than traditional metrics |
Pagination: | i -xiii, 128 |
URI: | http://hdl.handle.net/10603/444630 |
Appears in Departments: | School of Computing Science and Engineering VIT-Chennai |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title_page.pdf | Attached File | 87.93 kB | Adobe PDF | View/Open |
02_prelim pages.pdf | 938.68 kB | Adobe PDF | View/Open | |
03_content.pdf | 193.4 kB | Adobe PDF | View/Open | |
04_abstract.pdf | 92.83 kB | Adobe PDF | View/Open | |
05_chapter_1.pdf | 502.37 kB | Adobe PDF | View/Open | |
06_chapter_2.pdf | 126.63 kB | Adobe PDF | View/Open | |
07_chapter_3.pdf | 865.66 kB | Adobe PDF | View/Open | |
08_chapter_4.pdf | 571.97 kB | Adobe PDF | View/Open | |
09_chapter_5.pdf | 720.56 kB | Adobe PDF | View/Open | |
10_chapter_6.pdf | 1.63 MB | Adobe PDF | View/Open | |
11_chapter_7.pdf | 74.27 kB | Adobe PDF | View/Open | |
12_annxuers.pdf | 770.72 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 168.82 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: