检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学电子与信息工程学院,西安710049 [2]西南科技大学信息工程学院,四川绵阳621010
出 处:《西安交通大学学报》2011年第10期13-18,共6页Journal of Xi'an Jiaotong University
基 金:国家高技术研究发展计划资助项目(2008AA01Z131)
摘 要:针对分布式建立与存储的领域本体主题图在融合过程中的语义与结构重复问题以及冗余信息的判断与消除问题,提出了基于语义词典与语料库相结合的主题图融合算法(TMMC),给出了概念相似度计算以及同义关系、整体部分关系等的处理方法.对本体中概念进行基于HowNet语义词典及其他语义词典的多层次相似度计算,定义概念间不同语义关系的融合规则,针对专业领域本体中大量术语词典未收录的问题,提出基于语料库的概念相似度算法,并对计算机教育专业领域扩展主题图进行了融合实验.实验结果表明,TMMC提高了融合的准确率与查全率.Aiming at the distributed design and storage of topic map of domain ontology in abundance latent repetition, and redundancy in meanings and structures during merging process, a topic map merging algorithm(TMMC)hased on common knowledge thesauri combined with corpus, is proposed, where the similarity of Chinese concepts in merging process is evaluated, then the hyponyms, part-of and other relations between concepts, are dealt with, and HowNet and the other thesauri are used to compose a multi-level similarity calculation during merging the concepts in ontology. The merging rules about the different semantic relationships among concepts are de- fined. For very large number of domain special terms are not included in the common knowledge thesauri, therefore a novel algorithm based corpus is presented for calculating similarities between domain special concepts. And the extended topic maps in computer specific education are tested to verify the improved F-measure value of TMMC.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.35