Online rumor detection in social network
Online social network has become a major medium for information propagation. Users are also confused by huge amount of information read every day. It is important to find a solution to judge the authenticity of a certain piece of information and figure out the rumor source, which is also our focus....
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/69502 |
| _version_ | 1826119182372044800 |
|---|---|
| author | Gao, Shiqi |
| author2 | Tay Wee Peng |
| author_facet | Tay Wee Peng Gao, Shiqi |
| author_sort | Gao, Shiqi |
| collection | NTU |
| description | Online social network has become a major medium for information propagation. Users are also confused by huge amount of information read every day. It is important to find a solution to judge the authenticity of a certain piece of information and figure out the rumor source, which is also our focus. In this paper, we transfer the social network data into an adjacent matrix, while each element of the matrix symbolizes the directed edge between two nodes. We described the process of rumor source detection by selecting a small group of nodes as monitors. Their work is to monitor data flow. We have classified the monitors into two kinds: one has heard the information called positive monitors, and the other one hasn’t heard information called negative monitors. After the ranking of four metrics about rumor source distance with monitors, we can figure out rumor source ID. The accuracy of the result depends on the number of monitors we select and the methods we use to select monitors.
For rumor assessment, it is a reasonable situation that an information generated by a small group of clustered spreaders tend to be rumor, while an information like news will have a wide range of independent source. So we adopt a greedy source set algorithm to figure out the original source set. Information started by smaller source set has a high possibility to be a rumor. |
| first_indexed | 2024-10-01T04:55:37Z |
| format | Thesis |
| id | ntu-10356/69502 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:55:37Z |
| publishDate | 2017 |
| record_format | dspace |
| spelling | ntu-10356/695022023-07-04T15:03:18Z Online rumor detection in social network Gao, Shiqi Tay Wee Peng School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering Online social network has become a major medium for information propagation. Users are also confused by huge amount of information read every day. It is important to find a solution to judge the authenticity of a certain piece of information and figure out the rumor source, which is also our focus. In this paper, we transfer the social network data into an adjacent matrix, while each element of the matrix symbolizes the directed edge between two nodes. We described the process of rumor source detection by selecting a small group of nodes as monitors. Their work is to monitor data flow. We have classified the monitors into two kinds: one has heard the information called positive monitors, and the other one hasn’t heard information called negative monitors. After the ranking of four metrics about rumor source distance with monitors, we can figure out rumor source ID. The accuracy of the result depends on the number of monitors we select and the methods we use to select monitors. For rumor assessment, it is a reasonable situation that an information generated by a small group of clustered spreaders tend to be rumor, while an information like news will have a wide range of independent source. So we adopt a greedy source set algorithm to figure out the original source set. Information started by smaller source set has a high possibility to be a rumor. Master of Science (Communications Engineering) 2017-02-01T01:14:44Z 2017-02-01T01:14:44Z 2017 Thesis http://hdl.handle.net/10356/69502 en 58 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Electrical and electronic engineering Gao, Shiqi Online rumor detection in social network |
| title | Online rumor detection in social network |
| title_full | Online rumor detection in social network |
| title_fullStr | Online rumor detection in social network |
| title_full_unstemmed | Online rumor detection in social network |
| title_short | Online rumor detection in social network |
| title_sort | online rumor detection in social network |
| topic | DRNTU::Engineering::Electrical and electronic engineering |
| url | http://hdl.handle.net/10356/69502 |
| work_keys_str_mv | AT gaoshiqi onlinerumordetectioninsocialnetwork |