首页> 外文会议>Digital libraries'99 >Discovery of Similarity Computations on the Internet
【24h】

Discovery of Similarity Computations on the Internet

机译:在互联网上发现相似度计算

获取原文
获取原文并翻译 | 示例

摘要

The World Wide Web can be viewed as a huge digital library. A search engine is a typical means to tap into this vast source of information. There are several situations in which it is of interest to discover the formula used by a search engine to determine the similarity of a document to a query. One such situation is as follows. Currently, there are numerous search engines available on the Internet and the number is likely to increase many times in the future. Finding the most desired do cuments can be a formidable task as these documents may be located in different search engines. To facilitate the retrieval of documents, a solution is to construct a global search engine, also known as metabroker or metasearch engine, on top of the (local) search engines [3, 7, 9]. One of the challenging problems of building an efficient and effective global search engine is the document selection problem (discussed below). Our solution to this problem requires that the global search engine know how a local search engine a ssigns similarities to do cuments with respect to a given query. When such information is not available, the global search engine may need to employ some means to discover how a local search engine determines document similarities.
机译:可以将万维网视为一个巨大的数字图书馆。搜索引擎是利用这一庞大信息源的典型手段。在几种情况下,发现搜索引擎用来确定文档与查询的相似性的公式很重要。一种这样的情况如下。当前,Internet上有许多搜索引擎可用,并且将来这个数字可能会增加很多倍。由于这些文档可能位于不同的搜索引擎中,因此找到最理想的文档可能是一项艰巨的任务。为了促进文档的检索,一种解决方案是在(本地)搜索引擎之上构建全局搜索引擎,也称为metabroker或metasearch引擎[3,7,9]。建立高效有效的全局搜索引擎的挑战性问题之一是文档选择问题(如下所述)。我们对这个问题的解决方案要求全局搜索引擎知道本地搜索引擎如何赋予相似性以针对给定查询进行记录。当此类信息不可用时,全局搜索引擎可能需要采用某种方式来发现本地搜索引擎如何确定文档相似性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号