- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
9 web ranking课件
Introduction Early search engines mainly compare content similarity of the query and the indexed pages. I.e., They use information retrieval methods, cosine, TF-IDF, ... From 1996, it became clear that content similarity alone was no longer sufficient. The number of pages grew rapidly in the mid-late 1990’s. Try “classification technique”, Google estimates: 10 million relevant pages. How to choose only 30-40 pages and rank them suitably to present to the user? Content similarity is easily spammed. A page owner can repeat some words and add many related words to boost the rankings of his pages and/or to make the pages relevant to a large number of queries. Introduction (cont …) Starting around 1996, researchers began to work on the problem. They resort to hyperlinks. In Feb, 1997, Yanhong Li (Scotch Plains, NJ) filed a hyperlink based search patent. The method uses words in anchor text of hyperlinks. Web pages on the other hand are connected through hyperlinks, which carry important information. Some hyperlinks: organize information at the same site. Other hyperlinks: point to pages from other Web sites. Such out-going hyperlinks often indicate an implicit conveyance of authority to the pages being pointed to. Those pages that are pointed to by many other pages are likely to contain authoritative information. Introduction (cont …) During 1997-1998, two most influential hyperlink based search algorithms PageRank and HITS were reported. Both algorithms are related to social networks. They exploit the hyperlinks of the Web to rank pages according to their levels of “prestige” or “authority”. HITS: Jon Kleinberg (Cornel University), at Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1998 PageRank: Sergey Brin and Larry Page, PhD students from Stanford University, at Seventh International World Wide Web Conference (WWW7) in April, 1998. PageRank powers the Google search engine. “Stanford University” the great! Google: Sergey Brin and Larry
您可能关注的文档
最近下载
- 国家开放大学《MySQL数据库应用》形考任务(1-4)试题及答案解析.pdf VIP
- (最新最全)2025贵州专业技术公需科目题目(含答案).docx VIP
- 2025京东自营在线客服考试题库及答案.docx VIP
- 国际工程承包和管理实务英语(西南交通大学)中国大学MOOC慕课章节测验答案(课程ID:1206453815).pdf VIP
- 旅游管理职业生涯规划..pdf VIP
- 高速公路挡土墙施工专项方案0001.docx VIP
- 2022浪潮信创服务器CS5280H2技术白皮书-v1.2.pdf
- 秘书实务(第二版)全套教学课件(共604页PPT).pptx
- 外研社新视野商务英语综合教程2:第二版教师用书U9.pdf VIP
- 大众进口途观途威Tiguan 2011-2016用户手册说明书.pdf VIP
原创力文档


文档评论(0)