Unsupervised Descriptive Text Mining for Knowledge Graph Learning

被引:9
|
作者
Frisoni, Giacomo [1 ]
Moro, Gianluca [1 ]
Carbonaro, Antonella [1 ]
机构
[1] Univ Bologna, Dept Comp Sci & Engn DISI, Via Univ 50, I-47522 Cesena, Italy
关键词
Text Mining; Knowledge Graphs; Unsupervised Learning; Semantic Web; Ontology Learning; Rare Diseases; ACQUISITION; WEB;
D O I
10.5220/0010153603160324
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The use of knowledge graphs (KGs) in advanced applications is constantly growing, as a consequence of their ability to model large collections of semantically interconnected data. The extraction of relational facts from plain text is currently one of the main approaches for the construction and expansion of KGs. In this paper, we introduce a novel unsupervised and automatic technique of KG learning from corpora of short unstructured and unlabeled texts. Our approach is unique in that it starts from raw textual data and comes to: i) identify a set of relevant domain-dependent terms; ii) extract aggregate and statistically significant semantic relationships between terms, documents and classes; iii) represent the accurate probabilistic knowledge as a KG; iv) extend and integrate the KG according to the Linked Open Data vision. The proposed solution is easily transferable to many domains and languages as long as the data are available. As a case study, we demonstrate how it is possible to automatically learn a KG representing the knowledge contained within the conversational messages shared on social networks such as Facebook by patients with rare diseases, and the impact this can have on creating resources aimed to capture the "voice of patients".
引用
收藏
页码:316 / 324
页数:9
相关论文
共 50 条
  • [1] Text-Graph Enhanced Knowledge Graph Representation Learning
    Hu, Linmei
    Zhang, Mengmei
    Li, Shaohua
    Shi, Jinghan
    Shi, Chuan
    Yang, Cheng
    Liu, Zhiyuan
    [J]. FRONTIERS IN ARTIFICIAL INTELLIGENCE, 2021, 4
  • [2] Technology Opportunity Discovery using Deep Learning-based Text Mining and a Knowledge Graph
    Lee, MyoungHoon
    Kim, Suhyeon
    Kim, Hangyeol
    Lee, Junghye
    [J]. TECHNOLOGICAL FORECASTING AND SOCIAL CHANGE, 2022, 180
  • [3] Text Mining in Qualitative Research Application of an Unsupervised Learning Method
    Janasik, Nina
    Honkela, Timo
    Bruun, Henrik
    [J]. ORGANIZATIONAL RESEARCH METHODS, 2009, 12 (03) : 436 - 460
  • [4] Unsupervised learning of mDTD extraction patterns for Web text mining
    Kim, D
    Jung, HM
    Lee, GG
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2003, 39 (04) : 623 - 637
  • [5] An Unsupervised Graph Based Continuous Word Representation Method for Biomedical Text Mining
    Jiang, Zhenchao
    Li, Lishuang
    Huang, Degen
    [J]. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2016, 13 (04) : 634 - 642
  • [6] Knowledge Graph-based Algorithm for Text Data Mining
    Zhao, Yu-Feng
    He, Jie
    [J]. Journal of Network Intelligence, 2024, 9 (03): : 1892 - 1906
  • [7] On knowledgeable unsupervised text mining
    Hotho, A
    Maedche, A
    Staab, S
    Zacharias, V
    [J]. TEXT MINING: THEORETICAL ASPECTS AND APPLICATIONS, 2003, : 131 - 152
  • [8] Building Contextual Knowledge Graphs for Personalized Learning Recommendations using Text Mining and Semantic Graph Completion
    Abu-Rasheed, Hasan
    Dornhoefer, Mareike
    Weber, Christian
    Kismihok, Gabor
    Buchmann, Ulrike
    Fathi, Madjid
    [J]. 2023 IEEE INTERNATIONAL CONFERENCE ON ADVANCED LEARNING TECHNOLOGIES, ICALT, 2023, : 36 - 40
  • [9] Construction and Application of a Knowledge Graph for Iron Deposits Using Text Mining Analytics and a Deep Learning Algorithm
    Qinjun Qiu
    Kai Ma
    Hairong Lv
    Liufeng Tao
    Zhong Xie
    [J]. Mathematical Geosciences, 2023, 55 : 423 - 456
  • [10] Construction and Application of a Knowledge Graph for Iron Deposits Using Text Mining Analytics and a Deep Learning Algorithm
    Qiu, Qinjun
    Ma, Kai
    Lv, Hairong
    Tao, Liufeng
    Xie, Zhong
    [J]. MATHEMATICAL GEOSCIENCES, 2023, 55 (03) : 423 - 456