基于概念格的Web学术信息搜索结果的二次检索

摘要

According to the randomness and distractive nature of Web academic information search results,this article presents a concept lattice-based retrieval algorithm which traverses the search results.The article organizes and clusters the academic information searched out by the retrieval users for the first time,and forms the Hasse diagram.On this basis,a secondary retrieval is performed.In case that the number of the retrieval results is excessively large,help the users reduce the scope of retrieval so as to search out the required information more accurately.%针对Web学术信息搜索结果的无序性和纷杂性,提出一种遍历搜索结果概念格检索算法,将检索用户第一次检出的学术信息组织和聚类并形成Hasse图,以此为基础,进行二次检索,在搜索结果数目过于庞大的情况下,帮助用户缩小查找范围,更准确地检索出所需内容。