摘要
当前的互联网已经达到数十亿网页的规模,因此,在解决搜索速度和查全率的基础上,如何提高查准率,并且把最恰当的、最可信的链接放在返回结果的最前面,成为互联网搜索的关键问题。本文提出了统一开放的排序公式,该公式把不同的排序算法整合在一起,用户可以根据不同的搜索要求动态地调整排序法。最后,给出了该公式一个简单的应用实例。
The world wide Web WWW are billions of pages already. Therefore it becomes a vital problem for search engines to optimize searching the WWW and sorting the returned results which includes issues of the search speed missing results vs. The whole result set accuracy the quality of the pages returned first.This essay presents a general formula to combine these algorithms together for users to change result sorting algorithm dynamically according to different search requirements.One application example of this formula is also presented.
出处
《现代计算机》
2005年第3期15-18,共4页
Modern Computer
