稀疏约束非负张量分解用于检测不同时间尺度的主题
Sparseness-constrained Nonnegative Tensor Factorization for Detecting Topics at Different Time Scales
AI总结:
本文提出稀疏约束非负张量分解(S-NCPD)及其在线变体,用于自动检测时间数据中不同持续时间的主题,并定量控制主题长度,实验表明在线变体能更快降低重构误差。
摘要:
时间数据(如新闻文章或推特信息流)通常由长期趋势和流行但短暂的兴趣主题混合而成。一个真正成功的主题建模策略应能检测这两类主题,并在时间上清晰地定位它们。在本文中,我们首先证明非负CANDECOMP/PARAFAC分解(NCPD)能够自动发现具有不同持续时间的主题。然后,我们提出稀疏约束的NCPD(S-NCPD)及其在线变体,以有效且高效地主动控制学习到的主题长度。此外,我们提出了定量测量主题长度的方法,并展示了S-NCPD(及其在线变体)在半合成数据和真实世界数据(包括新闻标题)中能够以受控方式发现短期和长期时间主题的能力。我们还证明,S-NCPD的在线变体比S-NCPD更快地降低重构误差。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。