發明
中華民國
109140386
I 753659
社群網路中單一目標節點之挑選方法及其系統
國立清華大學
2022/01/21
本發明提供一種社群網路中單一目標節點之挑選方法。節點提供步驟設定社群網路之其中一節點為起始節點。機率計算步驟依據蒙地卡羅模組與層搜尋模組計算出起始節點之複數個傳播節點數。期望值產生步驟依據傳播節點數與傳播成功機率產生期望值。目標節點挑選步驟重新設定另一節點作為起始節點並重複執行機率計算步驟與期望值產生步驟而產生另一期望值, 然後比對期望值與另一 期望值而挑選出具有最大期望值之目標節點。藉此, 對目標節點投放訊息, 可在社群網路中達到最大的傳播節點數。 The present disclosure provides a method for selecting single target node within a social network. A node providing step is performed to set one of a plurality of nodes within the social network as an original node. A probability calculating step is performed to calculate a plurality of propagation-node amounts of the original node according to a Monte Carlo module and a layered-search module. An expected value generating step is performed to generate an expected value according to the propagation-node amounts and a plurality of propagating success probabilities. A target node selecting step is performed to reset another one of the nodes as the original node and repeat the probability calculating step and the expected value generating step to generate another expected value, and compare the expected value with the another expected value to select the target node having a maximum expected value. Therefore, it is favorable for achieving the max propagation-node amount within the social network through putting the message to the target node.
智財技轉組
03-5715131-62219
版權所有 © 國家科學及技術委員會 National Science and Technology Council All Rights Reserved.
建議使用IE 11或以上版本瀏覽器,最佳瀏覽解析度為1024x768以上|政府網站資料開放宣告
主辦單位:國家科學及技術委員會 執行單位:台灣經濟研究院 網站維護:台灣經濟研究院