arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.09573cs.AIcs.CLcs.IR
收藏

基于概率主题模型的概念层次学习

Learning Concept Hierarchies through Probabilistic Topic Modeling

Indian Institute of Information Technology and Management - Kerala (IIITM-K)(印度喀拉拉信息技术与管理学院 (IIITM-K));Queen’s University(女王大学)

V. S. Anoop, S. Asharaf, P. Deepak

摘要:

随着语义网的出现,各种工具和技术已被引入表示和组织知识。概念层次结构就是这样一种技术,由于其在创建领域本体(被认为是语义网的一个组成部分)方面的有用性而受到了极大的关注。自动概念层次学习算法的核心是从非结构化文本中抽取相关概念,并通过识别概念之间的潜在关系将概念连接起来。在本文中,我们提出了一种新的方法,从纯文本中识别相关的概念,然后学习层次的概念,利用它们之间的包容关系。首先,我们使用概率主题模型对主题进行建模,然后使用一些轻量级的语言过程来提取语义丰富的概念。然后,我们通过识别概念对之间的“是-a”关系来连接概念。所提出的方法是完全无监督的,并且不需要用于概念提取和学习的特定于领域的训练语料库。在BBC新闻数据集和路透社新闻数据集等大型真实文本语料库上的实验表明,该方法优于现有的一些概念提取方法,并且如果整个任务由概率主题建模算法指导,则可以进行有效的概念层次学习。

英文摘要:

With the advent of semantic web, various tools and techniques have been introduced for presenting and organizing knowledge. Concept hierarchies are one such technique which gained significant attention due to its usefulness in creating domain ontologies that are considered as an integral part of semantic web. Automated concept hierarchy learning algorithms focus on extracting relevant concepts from unstructured text corpus and connect them together by identifying some potential relations exist between them. In this paper, we propose a novel approach for identifying relevant concepts from plain text and then learns hierarchy of concepts by exploiting subsumption relation between them. To start with, we model topics using a probabilistic topic model and then make use of some lightweight linguistic process to extract semantically rich concepts. Then we connect concepts by identifying an "is-a" relationship between pair of concepts. The proposed method is completely unsupervised and there is no need for a domain specific training corpus for concept extraction and learning. Experiments on large and real-world text corpora such as BBC News dataset and Reuters News corpus shows that the proposed method outperforms some of the existing methods for concept extraction and efficient concept hierarchy learning is possible if the overall task is guided by a probabilistic topic modeling algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑