Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/51812
Title: | 基於直接分享訊息模式推論多個傳遞網路 FASTEN:Uncovering Multiple Diffusion Networks Using the First-Hand Sharing Pattern |
Authors: | Pei-Lun Liao 廖沛倫 |
Advisor: | 陳銘憲(Ming-Syan Chen) |
Keyword: | 傳播,傳播網路,傳播分析,社群網路,生存分析, Diffusion,Diffusion Network,Cascade Analytic,Social Network,Survival Analysis, |
Publication Year : | 2015 |
Degree: | 碩士 |
Abstract: | 在日常生活中我們能輕易地觀察到謠言傳遞的現象,然而直接觀察
謠言傳遞的過程是困難的。目前推測資訊傳遞過程的問題得到越來越 多的關注,因為當我們了解資訊傳遞的過程,我們便可以增減資訊傳 遞的影響力。例如流行病學家可以在疾病傳播的過程中減少感染的人 數,或是貨品銷售業者能夠提升他們廣告影響的效益。最近有很多的 方法被提出來解決這樣的問題,研究人員考慮資訊傳播於一個傳遞網 路上,在網路中連結或朋友關係表示資訊傳播的路徑;而節點或使用 者是資訊的接受者。其他人考慮資訊傳播於多個網路上,每一個網路 對應一個特定的主題,例如戰爭、科技或體育。在這個研究中,我們 觀察到實際資訊傳播的模式,發現大部分的節點傾向於直接分享或接 受訊息來源的資訊。換句話說,當資訊來自於二手的來源之後,影響 力便會開始衰減。這是因為人們喜歡直接關注消息來源,並不想成為 最後一個得知消息的人。因此,我們延伸之前的研究,提出一個機率 模型,這個模型模擬了我們觀察的資訊傳播模式,並推論隱藏的傳遞 網路和節點間傳遞速率。我們也提出一個有效率的最佳化方法去找出 有最大可能性的模型參數。實驗的結果顯示我們的模型能夠擊敗其他 的方法在多個不同的傳播網路結構和傳播過程中。 In our daily life rumors are spread among many people but diffusion processes and spreading paths behind rumors are usually hidden. The problem of finding this hidden process is getting more and more attention since after understanding the process, we can manipulate the diffusion speed of the process. For example, epidemiologists and the government can block a spread of a disease. Companies and goods sellers can facilitate adoptions of a product. To model the hidden information diffusion, it is usually assumed that information spreads in an underlying diffusion network where nodes, e.g. users, are receivers which adopt an information piece and edges, e.g. friendships, are transmission paths. In this work, we observe the pattern of information propagation that most of nodes are inclined to share the first-hand information. In other words, the virality of an information piece will generally decay as it becomes rephrased. We propose a generative model with the first-hand sharing patten (FASTEN), in order to infer the hidden networks and transmission rates between nodes. We further propose an efficient optimization method to infer the parameters of FASTEN. Experimental results show that FASTEN outperforms several state-of-the-arts algorithms on both synthetic and real datasets for network inference. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/51812 |
Fulltext Rights: | 有償授權 |
Appears in Collections: | 電機工程學系 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
ntu-104-1.pdf Restricted Access | 1.16 MB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.