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.
翻译:随着语义网络的出现,为展示和整理知识采用了各种工具和技术。概念等级是这种技术之一,由于在创建被视为语义网络不可分割的一部分的域论学学领域有用,因此这种技术引起了人们的极大注意。自动概念等级学习算法侧重于从结构化的文本库中提取相关概念,并通过查明它们之间的某些潜在关系将其连接起来。在本文件中,我们提出一种新的方法,从纯文本中确定相关概念,然后通过利用它们之间的子虚构关系来学习概念的等级。首先,我们用概率化专题模型来模拟专题,然后利用一些轻量语言过程来提取具有语义丰富的概念。然后,我们通过在两种概念之间确定“is-a”关系来连接概念。拟议方法完全不受监督,不需要为概念的提取和学习建立特定的域训练方案。对大型和真实的文本组合进行实验,例如BC新闻数据集和路透社新闻简说,显示,如果拟议的方法超越了现有概念稳定性提取和高效的等级分析法研究模式,那么通过可能通过全面的方法学习一种概念分析,那么,拟议的方法就有可能通过整个任务等级分析。