Ontologizing concept maps using graph theory.
SAC'11: The 2011 ACM Symposium on Applied Computing TaiChung Taiwan March, 2011(2011)
摘要
Given the new challenges of open and unsupervised information extraction, there is a need to identify important and relevant knowledge structures (concepts and relationships) in the vast amount of extracted data and to filter the noise that results from unsupervised information extraction. This is generally referred to as the ontologization task. This paper uses measures from graph theory to identify these key elements such as Page Rank, Betweenness, and Degree. We also propose a combination of metrics for ranking concepts and relationships. Our approach shows effective results in terms of precision compared to other standard measures for weighting concepts and relationships such as TF*IDF or frequency of co-occurrences.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络