DAC: Descendant-aware clustering algorithm for network-based topic emergence prediction

被引:4
|
作者
Jung, Sukhwan [1 ]
Segev, Aviv [1 ]
机构
[1] Univ S Alabama, Dept Comp Sci, 150 Student Serv Dr, Mobile, AL 36688 USA
关键词
Topic evolution; Topic prediction; Clustering; Topic emergence prediction; Scientometrics; EVOLUTION;
D O I
10.1016/j.joi.2022.101320
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Topic emergence detection aids in pinpointing prominent topics within a given domain, providing practical insights into all interested parties on where to focus the limited resources. This paper employs the network-based topic evolution approach to overcome limitations in text-based topic evolution, providing prospective topic emergence prediction capabilities by representing emer-gent topics by their ancestors. A descendant-aware clustering algorithm is proposed to generate non-exhaustive and overlapping clusters, utilizing the pace of collaborations and structural sim-ilarities between topics with iterative edge removal and addition processes. Over 100 datasets specific to a research topic were extracted from the Microsoft Academic Graph dataset for the experiments, where the proposed algorithm consistently outperformed existing clustering algo-rithms in generating clusters with a higher likelihood of being ancestors to an emergent topic up to three years in the future. Regression-based cluster filtering using five structural cluster features and topic cluster qualities showed that the prediction performance can be enhanced by automat-ically classifying undesirable clusters from previously known data. The results showed that the proposed algorithm can enhance topic emergence predictions on a wide range of research do-mains regardless of their maturities, popularities, and magnitudes without having access to the data in the predicted year, paving a road to prospective predictions on emergent topics.
引用
收藏
页数:19
相关论文
共 50 条
  • [31] Link Prediction for Isolated Nodes in Heterogeneous Network by Topic-Based Co-clustering
    Tomobe, Katsufumi
    Oyamada, Masafumi
    Nakadai, Shinji
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2017, PT I, 2017, 10234 : 147 - 159
  • [32] Network-based prediction of drug combinations
    Cheng, Feixiong
    Kovacs, Istvan A.
    Barabasi, Albert-Laszlo
    NATURE COMMUNICATIONS, 2019, 10 (1)
  • [33] Network-based prediction of protein interactions
    Kovacs, Istvan A.
    Luck, Katja
    Spirohn, Kerstin
    Wang, Yang
    Pollis, Carl
    Schlabach, Sadie
    Bian, Wenting
    Kim, Dae-Kyum
    Kishore, Nishka
    Hao, Tong
    Calderwood, Michael A.
    Vidal, Marc
    Barabasi, Albert-Laszlo
    NATURE COMMUNICATIONS, 2019, 10 (1)
  • [34] Network-based drug sensitivity prediction
    Ahmed, Khandakar Tanvir
    Park, Sunho
    Jiang, Qibing
    Yeu, Yunku
    Hwang, TaeHyun
    Zhang, Wei
    BMC MEDICAL GENOMICS, 2020, 13 (Suppl 11)
  • [35] Network-based prediction of protein function
    Sharan, Roded
    Ulitsky, Igor
    Shamir, Ron
    MOLECULAR SYSTEMS BIOLOGY, 2007, 3 (1) : 1 - 13
  • [36] Network-based prediction of protein interactions
    István A. Kovács
    Katja Luck
    Kerstin Spirohn
    Yang Wang
    Carl Pollis
    Sadie Schlabach
    Wenting Bian
    Dae-Kyum Kim
    Nishka Kishore
    Tong Hao
    Michael A. Calderwood
    Marc Vidal
    Albert-László Barabási
    Nature Communications, 10
  • [37] Network-based drug sensitivity prediction
    Khandakar Tanvir Ahmed
    Sunho Park
    Qibing Jiang
    Yunku Yeu
    TaeHyun Hwang
    Wei Zhang
    BMC Medical Genomics, 13
  • [38] Network-based prediction of drug combinations
    Feixiong Cheng
    István A. Kovács
    Albert-László Barabási
    Nature Communications, 10
  • [39] Improved Network-Based Recommendation Algorithm
    Shan, Xiao-fei
    Mi, Chuan-min
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFTWARE ENGINEERING (AISE 2014), 2014, : 297 - 301
  • [40] The Recursive Network-Based Routing Algorithm
    Choi, Dongmin
    Chung, Ilyong
    SEPADS'10: PROCEEDINGS OF THE 9TH WSEAS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PARALLEL AND DISTRIBUTED SYSTEMS, 2010, : 78 - 80