Towards Scalable Topic Detection on Web via Simulating Levy Walks Nature of Topics in Similarity Space
Junbiao Pang, Qingming Huang
TL;DR
This work tackles scalable topic detection on the web under a sea of noisy UGC by revealing heavy-tailed similarity patterns within topics that resemble Lévy walks. It introduces a model-free Explore-Exploit framework (EE) to simulate Lévy walks in a $k$-NN$^2$ similarity graph, coupled with Poisson deconvolution (PD) to rank topics without heavy optimization. The method selects seed pages via a Stationary Distribution/ SER mechanism, expands topics through an EE-driven growth rule, and supports multi-granularity topic generation with near-linear complexity. Empirical results on public datasets show LWTG achieves competitive effectiveness with substantially better efficiency and scalability than state-of-the-art baselines, making it suitable for large-scale web monitoring and trend analysis.
Abstract
Organizing a few webpages from social media websites into popular topics is one of the key steps to understand trends on web. Discovering popular topics from web faces a sea of noise webpages which never evolve into popular topics. In this paper, we discover that the similarity values between webpages in a popular topic contain the statistically similar features observed in Levy walks. Consequently, we present a simple, novel, yet very powerful Explore-Exploit (EE) approach to group topics by simulating Levy walks nature in the similarity space. The proposed EE-based topic clustering is an effective and effcient method which is a solid move towards handling a sea of noise webpages. Experiments on two public data sets demonstrate that our approach is not only comparable to the state-of-the-art methods in terms of effectiveness but also significantly outperforms the state-of-the-art methods in terms of efficiency.
