检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:于春雷[1] 朱征宇[1] 何杰[1] 董曙佳[1]
出 处:《计算机工程与应用》2012年第2期119-123,129,共6页Computer Engineering and Applications
基 金:国家科技支撑计划课题(No.2007BAH08B04)
摘 要:针对当前主流web搜索引擎存在信息检索个性化效果差和信息检索的精确率低等缺点,通过对已有方法的技术改进,介绍了一种基于用户历史兴趣网页和历史查询词相结合的个性化查询扩展方法。当用户在搜索引擎上输入查询词时,能根据学习到的当前用户兴趣模型动态判定用户潜在兴趣和计算词间相关度,并将恰当的扩展查询词组提交给搜索引擎,从而实现不同用户输入同一查询词能返回不同检索结果的目的。实验验证了算法的有效性,检索精确率也比原方法有明显提高。The current mainstream web search engines have many shortcomings such as the deficiency of personalization and the low precision.By introducing several improved techniques into a current algorithm,a new personalized query expansion method based on user's historical interested web pages and historical query terms is proposed in this paper.When a user submits a query keyword to a search engine,the new algorithm can automatically locate the current user's implicit search intention and compute the term-term associations according to the current user's interest profile.More personalized expansion words then will be generated by the proposed algorithm and be submitted to the search engine together with the query keyword.Thereby different search results can be returned to different users even though they input the same query Keywords.Experimental results show that this method is better than the current algorithm in average precision.
关 键 词:历史兴趣网页 历史查询词 个性化查询扩展 词间相关度 搜索引擎
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.118