摘要
传统的搜索引擎所提供的搜索结果仅仅是按照W eb与查询的相关性从高到低排成一个有序列表,不具备层次性,用户使用起来并不方便。文章通过采用覆盖聚类算法对搜索引擎的结果进行聚类来解决这个问题,并对其实现过程进行较为详细的描述。
The search result provided by traditional search engine is just a ranked list ordered by the correlation of the query, therefore, it is short of layering and convenience for the users. This paper presents a covering clustering approach to the clusters of search engine results for solving the problem mentioned above, and describes the process in detail.
出处
《大学图书情报学刊》
2006年第4期46-47,54,共3页
Journal of Academic Library and Information Science
关键词
WEB
信息检索
搜索引擎
覆盖聚类算法
web
information retrieval
search engine
covering clustering algorithm
