In recent years, topic detection has become a hot research point of the social network, which can be very good to find the key factors from the massive information and thus discover the topics. The traditional label propagation-based topic discovery algorithm (LPA) is widely concerned because of its approximate linear time complexity and there is no need to define the target function. However, LPA algorithm has the uncertainty and the randomness, which affects the accuracy and the stability of the topic discovery. In this paper, a method for clustering label words based on mutual information analysis is presented to find the current topic. Firstly, through filtering the stop words and extracting keywords with TF-IDF, topic words are been extracted out, and then a common word matrix is built, a topic discovery algorithm based on mutual information and label clustering is put forward. Finally, extensive experiments on two real datasets validate the effectiveness of the proposed MI-LC (Mutual information-Label clustering) algorithm against other well-established methods LPA and LDA in terms of running time, NMI value and perplexity value.
목차
Abstract 1. Introduction 2. Related Work 3. Theoretical Foundation 3.1 Mutual Information and Self Information 3.2 Information Entropy and Conditional Entropy 3.3 Average Mutual Information 3.4 Relationship between Average Mutual Information and Entropy 3.5 Constructing the Topic Time Series Relation Chain 4. The Proposed Algorithm 4.1 Measuring the Node Importance 4.2 Label Clustering of Vertices Based on K-Means Algorithm 4.3 Algorithm Implementation 5. Experimental Results and Analysis 5.1 Experimental Datasets and Experimental Environment 5.2 Evaluation Metrics 5.3 Experimental Results Analysis 6. Conclusions and Future Work Acknowledgements References
키워드
Dynamic social networkTopic discoveryMutual informationLabel clustering
저자
Lin Cui [ College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, Jiangsu, China, Intelligent Information Processing Laboratory, Suzhou University, Suzhou 234000, Anhui, China ]
Dechang Pi [ College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, Jiangsu, China ]
Caiyin Wang [ Intelligent Information Processing Laboratory, Suzhou University, Suzhou 234000, Anhui, China ]
보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Database Theory and Application
간기
격월간
pISSN
2005-4270
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Database Theory and Application Vol.9 No.5