| Summary: | 碩士 === 中原大學 === 工業與系統工程研究所 === 102 === Now days, people communicate not only with face to face but also with instant messages and online social networks. Millions of messages spread to the world through the Internet. Therefore, if we could identify influential users and let them disseminate information through the social networks, this way will substantially increase the message spreading efficiency.
This study proposed to use Cost-Effective Lazy Forward (CELF) algorithm to identify influential users in a web social network, and the effectiveness of this algorithm was evaluated by an experiment. First the node connection model was built based on the relationship between users, the influence degrees were collected from the user survey, and they were calculated as influence probability between users. Using the independent cascade model in the CELF algorithm, this method can identify influential nodes as influential users in this web social network. The next stage is to verify the proposed method and an experiment was performed. Users joined a group with common interests in the Facebook. This study assumed that the more attention a user gets when he posts a text, the more influential he is. The time period of this experiment is five weeks, and user interactions were collected and analyzed to identify influential users. The experimental result is compared to the result from the CELF algorithm with a hypothesis test. It shows that identified influential users from the algorithm and experiment are similar.
|
|---|
