计算机科学
情报检索
雅卡索引
图形
词典序
语义相似性
知识图
领域(数学分析)
注释
领域知识
语义学(计算机科学)
语义网络
人工智能
聚类分析
理论计算机科学
组合数学
数学分析
程序设计语言
数学
作者
Yuezhong Wu,Zhihong Wang,Shuhong Chen,Guojun Wang,Changyun Li
标识
DOI:10.1109/ispa/iucc.2017.00111
摘要
Massive network document resources provide abundant retrieving and reading information, but it is consuming and exhausting to quickly search, understand and analyze those documents. In order to seek semantic support for searching, understanding, analyzing, and mining, this paper proposes a more convenient way which based on domain knowledge graph to annotate network document automatically. The method firstly adopts an upgraded TF-IDF model based on the contribution to quantify instances in knowledge graph, then analyzes the semantic similarity between unannotated documents and instances based on Jaccard distance and lexicographic tree distance comprehensively. After the accuracy tests conducted by collecting network documents, the results show the initial marking accuracy is up to 74%, successfully certifying the method being able to automatically annotate network documents in terms of semantics from the domain knowledge graph.
科研通智能强力驱动
Strongly Powered by AbleSci AI