检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周竞涛[1] 杨海成[1] 王明微[1] 赵寒[1] 张树生[1] 莫蓉[1]
机构地区:[1]西北工业大学现代设计与集成制造技术教育部重点实验室,陕西西安710072
出 处:《计算机集成制造系统》2011年第3期577-584,共8页Computer Integrated Manufacturing Systems
基 金:国家863计划资助项目(2009AA04Z122);中国博士后科学基金资助项目(20090450169)~~
摘 要:在面向对等网络知识集成网络的检索过程中,为了实现知识获取效率和语义一致性之间的均衡,提出一种融合分类检索、语义路由和加载推理的检索机制。该机制根据网络拓扑结构的特点定义面向不同范围的检索分类,将检索范围进行适度控制;基于语义匹配得到满足检索需求的知识节点路由列表,对节点加载范围进行选择性限定,以获得更高的检索效率和更合理的检索结果集;建立加载推理机制,在上下文语义模型的支持下,支持复杂检索语义的明确表达。该方法充分利用集成网络的拓扑结构特点和知识集成网络的语义推理特性,在降低搜索时间和空间消耗的基础上,提升了多节点检索结果的语义一致性和语义推理能力。In order to achieve equilibrium between knowledge acquisition efficiency and semantic consistence in query process of Peer-to-Peer(P2P)-oriented knowledge integration network,a query approach combing classified query,semantic routing and semantic inference mechanisms was proposed.Accoring to characteristics of network topological structure,the approach defined query category oriented to different scopes and limited the scope of query.Knowledge node routing lists based on semantic matching which satisfied query requirements were obtained.Semantic scope was limited selectively in order to obtain higher query efficiency and more reasonable query result sets.Semantic inference mechanism was established.With the help of contextual semantic models,it supported formal expression of complicated query semantics.This query mechanism made full use of topological structure characteristics of integrated network and semantic reasoning feature of knowledge integration network,it reduced search time and space consumption,enhanced semantic consistence and semantic reasoning ability.
关 键 词:对等网络 知识集成 分类检索 语义路由 加载推理 知识获取
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.129.39.144