政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/122397

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/122397

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113822/144841 (79%)
造訪人次 : 51772329 線上人數 : 608

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/122397

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/122397

題名:	結合背景影響與群眾參與之社群事件規模及其應用 Social Event Magnitudes via Background Influences and Engagement Capacities and its Applications
作者:	劉奎谷 Liu, Kwei-Guu
貢獻者:	劉吉軒 Liu, Jyi-Shane 劉奎谷 Liu, Kwei-Guu
關鍵詞:	事件偵測非回溯矩陣社群參與譜演算法 Online event detection Engagement capacities Non-backtracking matrix Spectral algorithms
日期:	2019
上傳時間:	2019-03-04 21:42:56 (UTC+8)
摘要:	了解社群事件爆發(例如，阿拉伯之春)已是社群計算領域中受到廣泛重視的研究分支之一，因為除了社群事件偵測的相關應用多元之外，其亦與資訊擴散相關研究有著密切關係。社群事件的發生可從兩個角度來觀察: 一為資訊的異常變化(例如，關鍵文字於短時間內的暴增) 、二為活動的人氣高低(例如，資訊分享) 。事件偵測演算法通常針對前者中的異常變化進行設計，而社群事件強度則是透過統計方法針對分享的人氣高低提供一測度。換言之，社群事件強度提供了人們一個較為直覺的數值表達方式，藉由該數可易於瞭解事件在某個時空下的程度。然而，與事件偵測演算法相較下，社群事件強度於應用上有其劣勢: 一為其仰賴轉發數據、二為不易整合資訊進行估測。因此，本研究受事件偵測演算設計的啟發，提出了另一測度的表達方式，謂之為社群事件規模。社群事件規模的計算概念為某一時段內背景影響與群眾參與的乘值；背景影響值的抽取乃是應用非回溯矩陣從文字資訊中取出，而群眾參與的計算則是將網絡結構轉化為社群參與值(亦為Ordered Shapley Value)而得出。因此，社群事件規模的優勢，如事件偵測演算一樣，可整合資訊，且如社群事件強度一樣，可提供一個了解社群事件程度的概念性數字。此外，社群事件規模的計算也提供了另一資訊整合方式，有別於常用的相似度整合資訊的方法。另，本研究示範如何將社群事件規模應用在非特定事件與特定事件的動態偵測。於非特定事件動態偵測實驗，本研究發現社群事件規模呈現長尾分佈，而此分佈常見於社會活動現象。此外，因社群事件規模為一數值，故可提供簡便的視覺呈現來了解事件程度的動態變化。於特定事件偵測實驗方面，社群事件規模亦可有效率地偵測出指定事件。 Detecting outbreaks of social events (e.g., Arab Spring) has been an active research area in social computing, because of its close relationship to the research of information diffusion. Outbreaks of social events can be viewed from two angles: 1. anomalous changes of information (e.g., an influx of text), and 2. popular actions (e.g., retweets). Event detection algorithms focus on extracting anomalous information, while popular actions are measured by estimating social event intensity, which is a rate to show how popular an action is in a social network during a short period. The rate is relatively intuitive and gives a holistic view about activity levels in a network, but it has a few disadvantages. First, its estimation cannot work without the information about numbers of shares. Second, the estimation isn’t easy. Inspired by event detection algorithms, this study proposes an alternative measure using the product of background influence and cooperation value in a fixed time interval, and it is called social event magnitude. Background influence is extracted from text via non-backtracking matrices, and cooperation value is obtained via social engagement capacities, a modified version of Shapley value. The proposed alternative gives a holistic view about activity levels in a network. The construction of proposed alternative shows another way to integrate multiple sources of information for event detection. We demonstrated social event magnitude on specified and unspecified online event detections. In the specified detection, the alternative has a better performance in precision-recall evaluation. In the unspecified detection, social event magnitudes follow a long-tailed distribution. Furthermore, social event magnitudes can be visualized for changing levels of activities.
參考文獻:	[1] C. Zhang, G. Zhou, Q. Yuan, H. Zhuang, Y. Zheng, L. Kaplan, S. Wang and J. Han, "GeoBurst: Real-Time Local Event Detection in Geo-Tagged Tweet Streams," in ACM Special Interest Group on Information Retrieval, Pisa, Italy, 2016. [2] T. Sakaki, M. Okazaki and Y. Matsuo, "Earthquake Shakes Twitter Users: Real-Time Event Detection by Social Sensors," in World Wide Web, Raleigh, North Carolina, USA, 2010. [3] C. Aggarwal and K. Subbian, "Event Detection in Social Streams," in Society for Industrial and Applied Mathematics Data Mining, Anaheim, CA, USA, 2012. [4] M. Cordeiro and J. Gama, "Online Social Networks Event Detection: A Survey," in Solving Large Scale Learning Tasks. Challenges and Algorithms, Springer, 2016, pp. 1-41. [5] S. Ranshous, S. Shen, D. Kourtra, S. Harenberg, C. Faloutsos and N. Samatova, "Anomaly Detection in Dynamic Networks: A Survey," Wiley Interdisciplinary Reviews: Computational Statistics, vol. 7, no. May, pp. 223-247, 2015. [6] Q. Zhao, M. Erdogdu, H. He, A. Rajaraman and J. Leskovec, "SEISMIC: A Self-Exciting Point Process Model for Predicting Tweet Popularity," in ACM Knowledge Discovery and Data Mining, Sydney, 2015. [7] M.-A. Rizoiu, Y. Lee, S. Mishra and L. Xie, "Hawkes Processes for Events in Social Media," in Frontiers of Multimedia Research, New York, ACM, 2018, pp. 191-218. [8] W. W. Cohen, "Enron Email Dataset," Carnegie Mellon University, 8 May 2015. [Online]. Available: https://www.cs.cmu.edu/~enron/. [Accessed 10 July 2018]. [9] Y. Ogata, "Statistical Models for Earthquake Occurrences and Residual Analysis for Point Processes," Journal of the American Statistical Association, vol. 83, no. 401, pp. 9-27, 1985. [10] A. G. Hawkes, "Hawke Processes and their Applications to Finance: Review," Quantitative Finance, vol. 18, no. 2, pp. 193-198, 2018. [11] M.-A. Rizoiu, L. Xie, S. Sanner, M. Cebrian, H. Yu and P. V. Henteryck, "Expecting to be HIP: Hawkes Intensity Processses for Social Media Popularity," in World Wide Web, Perth, Australia, 2017. [12] R. Kobayashi and R. Lambiotte, "TiDeH: Time-Dependent Hawkes Process for Predicting Retweet Dynamics," in International Conference on Web and Social Media, Cologne, Germany, 2016. [13] M. Farajtabar, N. Du, M. Gomez-Rodriguez, I. Valera, H. Zha and L. Song, "Shaping Social Activity by Incentivizing Users," in Neural Information Processing Systems , Montreal, Canada, 2014. [14] T. Martin, X. Zhang and M. E. J. Newman, "Localization and Centrality in Networks," Physical Review E, vol. 90, no. 5, p. 052808, 2014. [15] F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborova and P. Zhang, "Spectral Redemption: Clustering Sparse Networks," Proceedings of the National Academy of Sciences of the United States of America, vol. 110, no. 52, pp. 20935-20940, 24 December 2013. [16] N. Alon, I. Benjamini, E. Lubetzky and S. Sodin, "Non-backtracking Random Walks Mix Faster," Communications in Contemporary Mathematics, vol. 9, no. 4, pp. 585-603, 2007. [17] O. Angel, J. Friedman and S. Hoory, "The Non-backtracking Spectrum of the Universal Cover of a Graph," Transactions of The American Mathematical Society, vol. 367, no. 6, pp. 4287-4318, 2015. [18] R. R. Nadakudiu and M. E. J. Newman, "Graph Spectra and Detectability of Community Structure in Networks," Physical Review Letters, vol. 108, no. 18, p. 188701, 2012. [19] T. Tao, Topics in Random Matrix Theory, Rhode Island: American Mathematical Society, 2012. [20] F. Chung, L. Lu and V. Vu, "The Spectra of Random Graphs with Given Expected Degrees," Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 11, pp. 6313-6318, 2003. [21] C. Moore, "The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness," European Association for Theoretical Computer Science, vol. 121, no. February, 2017. [22] A. Decelle, F. Krzakala, C. Moore and L. Zdeborova, "Asymptotic Analysis of the Stochastic Block Model for Modular Networks and its Algorithmic Applications," Physical Review E, vol. 84, no. 6, p. 066106, 2011. [23] C. Bordenave, M. Lelarge and L. Massoulie, "Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs," in Symposium on Foundations of Computer Science, Berkeley, CA, USA, 2015. [24] A. Nikolaev, S. Gore and V. Govindaraju, "Engagement Capacity and Engaging Team Formation for Reach Maximization of Online Social Media Platforms," in ACM Knowledge Discovery and Data Mining, San Francisco, CA, USA, 2016. [25] R. P. Gilles, The Cooperative Game Theory of Networks and Hierarchies, Berlin Heidelberg: Springer, 2010. [26] Y. Yang, T. Pierce and J. Carbonell, "A Study on Retrospective and On-Line Event Detection," in ACM Special Interest Group in Information Retrieval, Melbourne, Australia, 1998. [27] S. Kumar, H. Liu, S. Metha and L. Subramaniam, "Exploring a Scalable Solution to Identifying Events in Noisy Twitter Streams," in ACM Advances in Social Networks Analysis and Mining, Paris, France, 2015. [28] X. Dong, D. Mavroeidis, F. Calabrese and P. Frossard, "Multiscale Event Detection in Social Media," Data Mining and Knowledge Discovery, vol. 29, no. 5, pp. 1374-1405, 2015. [29] M. Newman, "Networks: An Introduction," Oxford University Press, New York, NY, USA, 2010. [30] Z. Bai, J. Demmel, J. Dongarra, A. Ruhe and H. Vorst, Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, Philadelphia: Society for Industrial and Applied Mathematics, 2000.
描述:	碩士國立政治大學資訊科學系 105753030
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0105753030
資料類型:	thesis
DOI:	10.6814/THE.NCCU.CS.006.2019.B02
顯示於類別:	[資訊科學系] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
303001.pdf	2323Kb	Adobe PDF2	0	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋