博碩士論文 995202016 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:86 、訪客IP:3.137.189.14
姓名 蘇信輔(Hsin-Fu Su)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 社群網路之訊息傳播分析
(Information Diffusion Analysis on Social Network)
相關論文
★ 應用自組織映射圖網路及倒傳遞網路於探勘通信資料庫之潛在用戶★ 基於社群網路特徵之企業電子郵件分類
★ 行動網路用戶時序行為分析★ 社群網路中多階層影響力傳播探勘之研究
★ 以點對點技術為基礎之整合性資訊管理 及分析系統★ 在分散式雲端平台上對不同巨量天文應用之資料區域性適用策略研究
★ 應用資料倉儲技術探索點對點網路環境知識之研究★ 從交易資料庫中以自我推導方式探勘具有多層次FP-tree
★ 建構儲存體容量被動遷徙政策於生命週期管理系統之研究★ 應用服務探勘於發現複合服務之研究
★ 利用權重字尾樹中頻繁事件序改善入侵偵測系統★ 有效率的處理在資料倉儲上連續的聚合查詢
★ 入侵偵測系統:使用以函數為基礎的系統呼叫序列★ 有效率的在資料方體上進行多維度及多層次的關聯規則探勘
★ 在網路學習上的社群關聯及權重之課程建議★ 在社群網路服務中找出不活躍的使用者
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 擴散範圍最大化之問題是從網路中找出能夠使訊息傳播的範圍最大之節點集合。由於網路之結構複雜且龐大,往往不易於資料分析及探勘,同時社群網路之興起,越來越多相關研究利用社群網路之結構來找出社群網路中,最有影響力之節點並期望能將擴散範圍最大化。本研究中共分為兩個部份:第一部份,藉著模組化函數之定義,選擇SetCover之路徑長度,並結合Label演算法將網路節點做分群。第二部份,在社群網路中利用SetCover之方法,找出社群中具備不同角色之節點。而在第二部份中,我們提出兩種不同的挑選方式選取節點。第一種是同時具備對於社群內及社群間最有影響力之節點;第二種是將對於社群內及社群間最有影響力之節點分別挑選。籍由提出社群化網路結構及影響力節點之挑選,能讓專家分析社群行為,有利於企業之口碑行銷手法,將產品推廣於不同社群中之使用者,以增加新客戶群;同時也有利於政府政策之推廣。
摘要(英) The structure and scale of the Internet is tremendous. It’s not easy to do research in the domain of data analysis and data mining. With the rise of the social network, there are more and more research showing how to make use the structure of social network, and to find the most influence nodes to maximize the influence spread. This research is composed of two parts: In the first part, we will cluster the network by SetCover and Label algorithm, and apply the modularity function to determine the length of path. In the second part, we will propose two different methods to measure the influence rank of nodes in social network. For the first method, we consider about that the influence of node for their community and for all communities simultaneously. Different from first method, the second method select the most influence nodes for their communities. Next, we select the most influence node for the other communities as well. By proposing the selection of the influence nodes in the structure of social network, the behavior of social network could be analyzed by experts. It also can support web marketing for enterprises to spend less cost to reach maximum benefits.
關鍵字(中) ★ 社群網路分析
★ 擴散範圍最大化
★ 節點影響力
關鍵字(英) ★ Social Network Analysis
★ Influence Maximization
★ Influence of Node
論文目次 摘要 v
Abstract vi
目錄 viii
圖目錄 ix
一、緒論 1
1.1 背景介紹 1
1.2 論文章節介紹 5
二.文獻探討 6
三、背景介紹 10
3.1 傳統Greedy演算法 11
3.2 Information Diffusion 11
3.2.1 Independent Cascade Model 12
3.2.2 Linear Threshold Model 12
3.3 Modularity Function 13
3.4 Set Cover Greedy Algorithm 14
四.研究方法 16
4.1 分群 16
4.2 挑選Top K 19
4.3 社群傳播力 20
五、實驗 22
5.1 實驗資料 22
5.2 實驗設定 22
5.3 實驗結果 24
六、結論 31
參考文獻 32
參考文獻 [1] V. Mahajan, E. Muller, F. Bass. New Product Diffusion Models in Marketing: A Review and Directions for Research. Journal of Marketing 54:1(1990) pp. 1-26
[2] J Goldenberg, B. Libai, E. Muller. Talk of the Network: A Complex Sustem Look at the Underlying Process of Word-of-Mouth. Marketing Letters 12:3(2001), 211-223.
[3] P. Domingos and M. Richardson, “Mining the network value of customers,” in KDD ’01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM Press, 2001, pp.57-66
[4] D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In the Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 137-146,2003.
[5] Tian Zhu, Bin Wu, Bai Wang.Social Influence and Role Analysis Based on Community Structure in Social Network. Proc.
Advanced Data Mining and Applications,2009,pp.788-795.
[6] Brai,S., Page,L.: The anatomy of a large-scale hypertextual Web search engine. In: Proceedings of the 7th World Wide Web Conference (WWW7), Brisbane, Australia (1998)
[7] Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Transactions on Internet Technology 5(1), 92-128 (2006)
[8] Kimura, M.; Saito, K.; Nakano, R.; and Motoda, H. 2010.
Extracting influential nodes on a social network for information diffusion. Data Mining and Knowledge Discovery
20:70–97.
[9] R. Narayanam and Y. Narahari, “A shapley value based
approach to discover influential nodes in social networks,”
IEEE Transactions on Automation Science and Engineering 99,
1-18,2010.
[10] W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD, pages 199-208, 2009.
[11] J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBrisesn, and N. S. Glance. Cost-effective outbreak detection in networks. In Proc. SIGKDD, pages 420-429, 2007.
[12] Leicht, E. A. and M. E. J. Newman. 2008. Community structure in directed networks. Physical Review Letters 100:
XX. American Express, 2011. Sources New Customers Use to Find Them according to US Small Business. Graph. Available from:
http://searchenginewatch.com/3642207
[13] P. A. Estevez, P. A. Vera, and K. Saito. Selecting the most influential nodes in social networks. In Proceedings of the International Joint Conference on Neural Networks, pages 2397–2402, 2007
[14] Y. Wang, G. Cong, G. Song, and K. Xie. Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2010
[15] U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. In Phys. Rev. E76, 2007.
[16] PewInternet
http://libraryview.wordpress.com/2011/02/25/1029/
[17] emarket
http://tobydawsonmarketing.blogspot.com/2011/04/consumer-control-interactivity-and-word.html
[18] Buzfactor
http://www.buzfactor.com/tag/online-marketing/
[19] Social Commerce Today:
http://socialcommercetoday.com/word-of-mouth-still-most-trusted-resource-says-nielsen-implications-for-social-commerce/
[20] SNAP
http://snap.stanford.edu/snap/download.html
指導教授 蔡孟峰(Meng-Feng Tsai) 審核日期 2012-8-9
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明