- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Google搜索与Inter网的信息检索汇编
Google搜索与Inter网的信息检索 马志明 May 16, 2008 Email: mazm@ /member/mazhiming/index.html 约有626,000项符合中国科学院数学与系统科学研究院的查询结果,以下是第1-100项。(搜索用时 0.45 秒) How can google make a ranking of 626,000 pages in 0.45 seconds? Nevanlinna Prize(2006)Jon Kleinberg Page Rank, the ranking system used by the Google search engine. Query independent content independent. using only the web graph structure Page Rank, the ranking system used by the Google search engine. Can a surfer jump from page 5 of site 1 to a page in site 2 ? Ranking Websites, a Probabilistic View Ying Bao, Gang Feng, Tie-Yan Liu, Zhi-Ming Ma, and Ying Wang n webs in N sites, Based on the above discussions, the direct approach of computing the AggregateRank ξ(α) is to accumulate PageRank values (denoted by PageRankSum). However, this approach is unfeasible because the computation of PageRank is not a trivial task when the number of web pages is as large as several billions. Therefore, Efficient computation becomes a significant problem . AggregateRank 1. Divide the n × n matrix into N × N blocks according to the N sites. Experiments In our experiments, the data corpus is the benchmark data for the Web track of TREC 2003 and 2004, which was crawled from the .gov domain in the year of 2002. It contains 1,247,753 webpages in total. From: pcchairs@ Sent: Thursday, April 03, 2008 9:48 AMDear Yuting Liu, Bin Gao, Tie-Yan Liu, Ying Zhang, Zhiming Ma, Shuyuan He, Hang Li We are pleased to inform you that your paperTitle: BrowseRank: Letting Web Users Vote for Page Importancehas been accepted for oral presentation as a full paper and for publication as an eightpaper in the proceedings of the 31st Annual International ACM SIGIR Conference on Research Development on Information Retrieval. Congratulations!! learning to rank The goal of learning to rank is to construct a real-valued function that can
文档评论(0)