Comparison of Two-Pass Algorithms for Dynamic Topic Modeling Based on Matrix Decompositions

被引:0
|
作者
Skitalinskaya, Gabriella [1 ,2 ,4 ]
Alexandrov, Mikhail [3 ,4 ]
Cardiff, John [1 ]
机构
[1] Inst Technol, Dublin, Ireland
[2] Moscow Inst Phys & Technol, Dolgoprudnyi, Russia
[3] Autonomous Univ Barcelona, Barcelona, Spain
[4] Russian Presidential Acad Natl Econ & Publ Adm, Moscow, Russia
关键词
Dynamic topic modeling; Matrix decomposition; Latent Dirichlet Allocation;
D O I
10.1007/978-3-030-02840-4_3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we present a two-pass algorithm based on different matrix decompositions, such as LSI, PCA, ICA and NMF, which allows tracking of the evolution of topics over time. The proposed dynamic topic models as output give an easily interpreted overview of topics found in a sequentially organized set of documents that does not require further processing. Each topic is presented by a user-specified number of top-terms. Such an approach to topic modeling if applied to, for example, a news article data set, can be convenient and useful for economists, sociologists, political scientists. The proposed approach allows to achieve results comparable to those obtained using complex probabilistic models, such as LDA.
引用
收藏
页码:27 / 43
页数:17
相关论文
共 50 条
  • [1] A Comparative Review of Two-Pass Connected Component Labeling Algorithms
    Hernandez-Belmonte, Uriel H.
    Ayala-Ramirez, Victor
    Sanchez-Yanez, Raul E.
    ADVANCES IN SOFT COMPUTING, PT II, 2011, 7095 : 452 - 462
  • [2] Optimizing two-pass connected-component labeling algorithms
    Kesheng Wu
    Ekow Otoo
    Kenji Suzuki
    Pattern Analysis and Applications, 2009, 12 : 117 - 135
  • [3] Optimizing two-pass connected-component labeling algorithms
    Wu, Kesheng
    Otoo, Ekow
    Suzuki, Kenji
    PATTERN ANALYSIS AND APPLICATIONS, 2009, 12 (02) : 117 - 135
  • [4] NFC Based Two-Pass Mobile Authentication
    Vempati, Jagannadh
    Bajwa, Garima
    Dantu, Ram
    RESEARCH IN ATTACKS, INTRUSIONS, AND DEFENSES, 2013, 8145 : 467 - 468
  • [5] IDMN: A Two-Pass Attention Mechanism in Dynamic Memory Network
    Zhou, Zheng
    Kang, Xin
    Nishide, Shun
    Ren, Fuji
    PROCEEDINGS OF 2019 6TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENCE SYSTEMS (CCIS), 2019, : 1 - 5
  • [6] TRANSFORMER BASED DELIBERATION FOR TWO-PASS SPEECH RECOGNITION
    Hu, Ke
    Pang, Ruoming
    Sainath, Tara N.
    Strohman, Trevor
    2021 IEEE SPOKEN LANGUAGE TECHNOLOGY WORKSHOP (SLT), 2021, : 68 - 74
  • [7] Simulation based scheduling using a two-pass approach
    Chong, CS
    Sivakumar, AI
    Gay, R
    PROCEEDINGS OF THE 2003 WINTER SIMULATION CONFERENCE, VOLS 1 AND 2, 2003, : 1433 - 1439
  • [8] Two-Pass Smoother Based on the SVSF Estimation Strategy
    Gadsden, S. A.
    Al-Shabi, M.
    Kirubarajan, T.
    SIGNAL PROCESSING, SENSOR/INFORMATION FUSION, AND TARGET RECOGNITION XXIV, 2015, 9474
  • [9] Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
    Assadi, Sepehr
    Raz, Ran
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 342 - 353
  • [10] An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation
    Konrad, Christian
    Naidu, Kheeran K.
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2881 - 2899