检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]太原理工大学计算机与软件学院,山西太原030024
出 处:《广西师范大学学报(自然科学版)》2010年第1期131-134,共4页Journal of Guangxi Normal University:Natural Science Edition
基 金:国家自然科学基金资助项目(60472093)
摘 要:提出一种基于本体知识查询树(OKQT)的混合P 2P语义路由检索模型,通过对路由节点中OKQT的查询,使得用户节点能够根据检索词和OKQT中知识的匹配,在网络中进行快速准确的查询定位,对所需知识进行精确查询。同时对于网络中无法和检索词匹配的查询,通过计算它和其他知识的语义相似度,对检索词进行相应的缩放,返回相应的知识供用户参考。实验表明,这种先定位后查询的方法提高了语义路由效率,具有较强的查准率、查全率和扩展性。Routing mechanisms is one of key parts in knowledge discovery. The paper proposes a mixed P2P semantic Routing retrieval model based on Ontology Knowledge Query Tree. User node can match search term with knowledge of OKQT by querying OKQT on routing nodes,and makes sure the location query fleetly and accurately, and then queries the knowledge which meet user precisely. For the search term which is not match on the internet,by calculating the semantic similarity between search term and knowledge in OKQT,and zooming the search term,the corresponding results are given back. Experiment verifies that this method which make sure the location first and query knowledge second can improve the semantic routing efficiency ,recall ratio ,precision ratio and expansibility.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.130