Tracking the Evolution: Discovering and Visualizing the Evolution of Literature

被引:0
作者
Wu, Siyuan [1 ]
Hou, Leong U. [1 ]
机构
[1] Univ Macau, State Key Lab Internet Things Smart City, Dept Comp & Informat Sci, Taipa, Macau, Peoples R China
来源
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2022, PT III | 2022年
关键词
Citation network; Factor graph; Steiner tree; Visualization;
D O I
10.1007/978-3-031-00129-1_5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A common task in research preparation is to survey related work in bibliographic databases. Scientists are finding the survey task notably difficult as the volume of the databases has been increased considerably over the past few decades. Making a good use of a survey paper of the research topic can vastly lower the difficulty but there may be no survey paper in some emerging research topics due to the rapid development. In this work, we propose a novel Literature Evolution Discovery (LED) process that aims to provide an explainable evolution structure of literature. The explainability is based on co-citation analysis and latent relationship extraction, which are done by Steiner tree algorithm and context-consistent factor graph model, respectively. The experiments show the superiority of our context-consistent factor graph model, compared with the state-of-the-art baselines. Our case studies and visualization results demonstrate the effectiveness and interpretability of our proposed algorithms in practice.
引用
收藏
页码:68 / 84
页数:17
相关论文
共 28 条
  • [1] [Anonymous], 2003, Technical Report
  • [2] Latent Dirichlet allocation
    Blei, DM
    Ng, AY
    Jordan, MI
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) : 993 - 1022
  • [3] A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
    Cai, HongYun
    Zheng, Vincent W.
    Chang, Kevin Chen-Chuan
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (09) : 1616 - 1637
  • [4] Charikar M., 1998, PROC 9 ANN ACM SIAM, P192
  • [5] Scholarly data mining: A systematic review of its applications
    Dridi, Amna
    Gaber, Mohamed Medhat
    Azad, R. Muhammad Atif
    Bhogal, Jagdev
    [J]. WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2021, 11 (02)
  • [6] Analysing Trends in Computer Science Research
    Effendy, Suhendry
    Yap, Roland H. C.
    [J]. WWW'17 COMPANION: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2017, : 1245 - 1250
  • [7] Gordon J, 2016, PROCEEDINGS OF THE 54TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 1, P866
  • [8] O(log2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm
    Grandoni, Fabrizio
    Laekhanukit, Bundit
    Li, Shi
    [J]. PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 253 - 264
  • [9] node2vec: Scalable Feature Learning for Networks
    Grover, Aditya
    Leskovec, Jure
    [J]. KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 855 - 864
  • [10] Attribute-Driven Backbone Discovery
    Guan, Sheng
    Ma, Hanchao
    Wu, Yinghui
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 187 - 195