检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大连东软信息学院网络中心,辽宁大连116023 [2]清华大学计算机科学与技术系,北京100084
出 处:《计算机应用》2010年第1期114-117,152,共5页journal of Computer Applications
基 金:国家自然科学基金资助项目(60773149);国家973计划项目(2007CB310900);国家863计划项目(2008AA01Z108)
摘 要:为了克服Web搜索引擎在可扩展性、协作性和个性化等方面存在的不足,提出了一种基于Peer-to-Peer的全分布、协作式、自组织的个性化Web信息检索,定义了以查询主题为中心进行主题聚类、数据组织和查询路由的用户协作共享策略,设计了协作生成用户兴趣列表向量、对相似语义查询进行主题聚类和更新、基于查询集建立倒排索引以及基于查询主题进行语义路由等算法和机制,以提供人性化、协作式、个性化的搜索。模拟实验表明,原型系统可以加快查询速度,减轻网络负荷,提高搜索的准确率。To overcome the shortcomings of the Web search engines on scalability, collaboration, and personalization, a personalized P2P based Web information retrieval was proposed based on wide distribution, collaboration and self-organization. The strategy of users' collaboration and sharing was defined. That is, user' s query topics were used to cluster the queries, to store data and to route queries. Towards the goal of providing more humanized and personalized retrieval by utilizing users' collaboration, some algorithms and mechanisms were designed in respect to building user' s favorite list vector collaboratively, clustering the queries to update the user' s interest topic by the semantic similarity, structuring the inverted index based on per unit of keyword group, and forwarding the query among peers according to the similarity of topic. The experimental results show that the prototype system can speed up the searching process, reduce the network load and improve the accuracy of the search.
关 键 词:WEB信息检索 对等网络 个性化 主题 协作过滤
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145