Sparseness-constrained Nonnegative Tensor Factorization for Detecting Topics at Different Time Scales
Preprint
Abstract
Temporal data (such as news articles or Twitter feeds) often consists of a mixture of long-lasting trends and popular but short-lasting topics of interest. A truly successful topic modeling strategy should be able to detect both types of topics and clearly locate them in time. In this paper, we first show that nonnegative CANDECOMP/PARAFAC decomposition (NCPD) is able to discover topics of variable persistence automatically. Then, we propose sparseness-constrained NCPD (S-NCPD) and its online variant in order to actively control the length of the learned topics effectively and efficiently. Further, we propose quantitative ways to measure the topic length and demonstrate the ability of S-NCPD (as well as its online variant) to discover short and long-lasting temporal topics in a controlled manner in semi-synthetic and real-world data including news headlines. We also demonstrate that the online variant of S-NCPD reduces the reconstruction error more rapidly than S-NCPD.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Generalized temporal similarity-based nonnegative tensor decomposition for modeling transition matrix of dynamic collaborative filteringInformation Sciences, 2023
- On Large-Scale Dynamic Topic Modeling with Nonnegative CP Tensor Decomposition2021
- Identifying Covid-19 misinformation tweets and learning their spatio-temporal topic dynamics using Nonnegative Coupled Matrix Tensor FactorizationSocial Network Analysis and Mining, 2021
- Exploring the Political Agenda of the European Parliament Using a Dynamic Topic Modeling ApproachPolitical Analysis, 2017
- Semi-supervised non-negative matrix factorization for image clustering with graph LaplacianMultimedia Tools and Applications, 2013
- Deciphering Signatures of Mutational Processes Operative in Human CancerCell Reports, 2013
- SVD based initialization: A head start for nonnegative matrix factorizationPattern Recognition, 2008
- Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysisBioinformatics, 2007
- Learning the parts of objects by non-negative matrix factorizationNature, 1999
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” DecompositionPsychometrika, 1970