Indexed by:
Abstract:
Despite the massive growth of social media on the Internet, the process of organizing, understanding, and monitoring user generated content (UGC) has become one of the most pressing problems in today's society. Discovering topics on the web from a huge volume of UGC is one of the promising approaches to achieve this goal. Compared with classical topic detection and tracking in news articles, identifying topics on the web is by no means easy due to the noisy, sparse, and less-constrained data on the Internet. In this paper, we investigate methods from the perspective of similarity diffusion, and propose a clustering-like pattern across similarity cascades (SCs). SCs are a series of subgraphs generated by truncating a similarity graph with a set of thresholds, and then maximal cliques are used to capture topics. Finally, a topic-restricted similarity diffusion process is proposed to efficiently identify real topics from a large number of candidates. Experiments demonstrate that our approach outperforms the state-of-the-art methods on three public data sets.
Keyword:
Reprint Author's Address:
Email:
Source :
IEEE TRANSACTIONS ON MULTIMEDIA
ISSN: 1520-9210
Year: 2015
Issue: 6
Volume: 17
Page: 843-853
7 . 3 0 0
JCR@2022
ESI Discipline: COMPUTER SCIENCE;
ESI HC Threshold:168
JCR Journal Grade:1
CAS Journal Grade:2
Cited Count:
WoS CC Cited Count: 22
SCOPUS Cited Count: 26
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 2