检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]苏州大学智能信息处理及应用研究所,江苏苏州215006
出 处:《微电子学与计算机》2006年第7期199-201,共3页Microelectronics & Computer
基 金:教育部高校博士学科点科研基金项目(20040285016)
摘 要:元搜索引擎综合了多个搜索引擎的搜索结果,提高了搜索的覆盖率,但是它们返回的结果往往数目庞大,并且很多结果与用户查询并不相关,这直接影响了用户检索的质量,也大大提高了用户检索的代价。针对这一问题,文章提出了基于用户兴趣的结果合成算法。它根据用户兴趣对结果进行相似度计算和结果去重,从而为用户提供贴切的查询结果。实验表明,该算法提高了用户的检索效率和质量。Meta search engines are proposed to increase the search coverage by combining several search engines. However, the problem of the information overload becomes more severe and most returned results are irrelevant to user's interests. That affects the retrieval quality and increases the user cost. For settling this problem, an algorithm of results merging based on user profiles is brought forward. It provides users with suitable results by removing the reduplicate results and estimating the similarity between results and user query. We build a system (PMSE), researches and experiments are carried out on PMSE show the strategy can promotes the effectiveness and efficiency of retrieval.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222