基於PrefixSpan演算法的時間序列特徵模式社群網路探勘

Social network mining of time sequence pattern base on PrefixSpan algorithm

翁愷澤(Kai-Ze Weng)

指導教授 ： 王英宏

淡江大學/工學院/資訊工程學系碩士班/碩士(2021年)

https://doi.org/10.6846/TKU.2021.00612

摘要

時序性資料是常見且龐大的資料型態，無時無刻都會有新的資料生成且被記錄。社群網路是近年因網路快速發展所興起的線上虛擬社群，也因這種發展狀況，社群網路已經成為我們生活幾乎不可或缺的一部分，人與人之間的網絡關係也成為另一項重點研究項目，在社群內的各個使用者之間的連結與互動將會形成一個龐大而複雜的社群網路，並將記錄下在社群中所有用戶的的活動狀態、發言記錄、使用者之間的互動狀況及活動發生的時間，然而對於這些龐大且雜亂的社群網路的時間序列資料集合，要如何有效且迅速的篩選並處理這些資料將是本次要探討的重點。本次研究所提出的概念是結合數據分析與社群網路資料集，利用大量的時序性資料在經過篩選去除多餘資訊之後，經過標記起始時間點及結束時間點後，再利用PrefixSpan演算法去找出頻繁出現的使用者時序性序列資訊，再將其輸出結果加以記錄來實現。

關鍵字

資料探勘 ； 時序性資料 ； 社群網路 ； 特徵模式探勘

並列摘要

Time Sequence is a common and enormous data type. Every second will generate a new set of data sequences then be recorded. Social network is a virtual online community that has developed in the last decades. Since this kind of development status, social network has become a part of our daily life. The connection between people has become another important research project. As the connection between people, the interaction and connectivity between users will form a humongous and complicated social network. This will record every user in this network’s activity status, speech record, interactive between users and record interactive time. Facing this kind of enormous and messy social network sequence datasets. How can we filter and process these datasets efficiently? We proposed a concept that uses a huge amount of time sequence data after filter them without extra information. Marked the starting-time point and end-time point. Then we used PrefixSpan algorithm to find the frequency of the user’s time sequence data, then recorded them for further usage.

並列關鍵字

Data Mining ； Time Sequence Data ； Social Network ； Sequence Pattern Mining

參考文獻

[1] R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proc. 20th int. conf. very large data bases, VLDB, 1994, vol. 1215: Citeseer, pp. 487-499.

[2] R. Agrawal and R. Srikant, "Mining sequential patterns," in Proceedings of the eleventh international conference on data engineering, 1995: IEEE, pp. 3-14.

[3] J. F. Allen, "Maintaining knowledge about temporal intervals," Communications of the ACM, vol. 26, no. 11, pp. 832-843, 1983.

[4] J. Chen, "An updown directed acyclic graph approach for sequential pattern mining," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 7, pp. 913-928, 2009.

[5] Y.-C. Chen, J.-C. Jiang, W.-C. Peng, and S.-Y. Lee, "An efficient algorithm for mining time interval-based patterns in large database," in Proceedings of the 19th ACM international conference on Information and knowledge management, 2010, pp. 49-58.