.png){kind=icon}
返回
NMF-based approach to automatic term extraction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.117179.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work describes automatic term extraction approach based on the combination of the probabilistic topic modelling (PTM) and non-negative matrix factorization (NMF). Topic modeling algorithms including NMF-based ones do not require expensive and time-consuming manual annotations for domain terms, but only a corpus of domain documents. The topics emerge from the corpus documents without any supervision as sets of most probable words. This work is aimed to investigate how fully and precisely these most probable words from topics can reflect domain terminology. We run a series of experiments on the novel, qualitatively annotated dataset ACTER that was first used in the TermEval 2020 Shared Task. We compare five different NMF algorithms and four different NMF initializations when changing the number of topics extracted from documents and the number of most probable words extracted from topics in order to determine optimal combinations for best performance of term extraction. Finally, we compare the obtained optimal combinations of NMF with the competitive methods in TermEval 2020 and prove that our approach is second only to two much more sophisticated, domaindependent supervised methods.
Keyword:
Automatic term extraction
Probabilistic topic modeling
NMF
Unsupervised term extraction
ACTER dataset
TermEval shared task
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏分享收藏Optimal Multiple Attribute Decision Model for Key Parameters of Online Group Buying Product.png)
Mathematics
OAAI
MathematicsIF0
OAAI分享收藏
分享收藏Reducing Carbon Emissions: The Role of Democratic Institutions In Developed and Developing Countries
PREAI
分享收藏New SVD based initialization strategy for non-negative matrix factorization一种新的基于SVD的非负矩阵分解初始化策略OAAI
OAAI分享收藏
查看更多内容