Loading…
Link Analysis: Hubs and Authorities on the World Wide Web
Ranking the tens of thousands of retrieved webpages for a user query on a Web search engine such that the most informative webpages are on the top is a key information retrieval technology. A popular ranking algorithm is the HITS algorithm of Kleinberg. It explores the reinforcing interplay between...
Saved in:
| Published in: | SIAM review 2004-06, Vol.46 (2), p.256-268 |
|---|---|
| Main Authors: | , , , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c436t-f98c441d49ef8dfd54e8d195d4afa51cff4b265fd800ae2969b101cd1df067dc3 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c436t-f98c441d49ef8dfd54e8d195d4afa51cff4b265fd800ae2969b101cd1df067dc3 |
| container_end_page | 268 |
| container_issue | 2 |
| container_start_page | 256 |
| container_title | SIAM review |
| container_volume | 46 |
| creator | Ding, Chris H. Q. Zha, Hongyuan He, Xiaofeng Husbands, Parry Simon, Horst D. |
| description | Ranking the tens of thousands of retrieved webpages for a user query on a Web search engine such that the most informative webpages are on the top is a key information retrieval technology. A popular ranking algorithm is the HITS algorithm of Kleinberg. It explores the reinforcing interplay between authority and hub webpages on a particular topic by taking into account the structure of the Web graphs formed by the hyperlinks between the webpages. In this paper, we give a detailed analysis of the HITS algorithm through a unique combination of probabilistic analysis and matrix algebra. In particular, we show that to first-order approximation, the ranking given by the HITS algorithm is the same as the ranking by counting inbound and outbound hyperlinks. Using Web graphs of different sizes, we also provide experimental results to illustrate the analysis. |
| doi_str_mv | 10.1137/S0036144501389218 |
| format | article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_journals_194206050</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>20453505</jstor_id><sourcerecordid>20453505</sourcerecordid><originalsourceid>FETCH-LOGICAL-c436t-f98c441d49ef8dfd54e8d195d4afa51cff4b265fd800ae2969b101cd1df067dc3</originalsourceid><addsrcrecordid>eNplkE9Lw0AQxRdRsFY_gAdhETxGZ7K7ya63UqoVCh5Uegyb_UNTY1J3k0O_vQktevA0M_zeewyPkGuEe0SWP7wBsAw5F4BMqhTlCZkgKJHkKcApmYw4Gfk5uYhxC8MtmZoQtaqaTzprdL2PVXyky76MVDeWzvpu04aqq1ykbUO7jaPrNtSWris7rK68JGde19FdHeeUfDwt3ufLZPX6_DKfrRLDWdYlXknDOVqunJfWW8GdtKiE5dprgcZ7XqaZ8FYCaJeqTJUIaCxaD1luDZuS20PuLrTfvYtdsW37MDwcC1Q8hQwEDCI8iExoYwzOF7tQfemwLxCKsaDiX0GD5-4YrKPRtQ-6MVX8M4o8FyDH7JuDbhu7NvzyFLhgAgT7AerSbSE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>194206050</pqid></control><display><type>article</type><title>Link Analysis: Hubs and Authorities on the World Wide Web</title><source>SIAM Journals Archive</source><source>Business Source Ultimate【Trial: -2024/12/31】【Remote access available】</source><source>JSTOR Archival Journals and Primary Sources Collection</source><creator>Ding, Chris H. Q. ; Zha, Hongyuan ; He, Xiaofeng ; Husbands, Parry ; Simon, Horst D.</creator><creatorcontrib>Ding, Chris H. Q. ; Zha, Hongyuan ; He, Xiaofeng ; Husbands, Parry ; Simon, Horst D.</creatorcontrib><description>Ranking the tens of thousands of retrieved webpages for a user query on a Web search engine such that the most informative webpages are on the top is a key information retrieval technology. A popular ranking algorithm is the HITS algorithm of Kleinberg. It explores the reinforcing interplay between authority and hub webpages on a particular topic by taking into account the structure of the Web graphs formed by the hyperlinks between the webpages. In this paper, we give a detailed analysis of the HITS algorithm through a unique combination of probabilistic analysis and matrix algebra. In particular, we show that to first-order approximation, the ranking given by the HITS algorithm is the same as the ranking by counting inbound and outbound hyperlinks. Using Web graphs of different sizes, we also provide experimental results to illustrate the analysis.</description><identifier>ISSN: 0036-1445</identifier><identifier>EISSN: 1095-7200</identifier><identifier>DOI: 10.1137/S0036144501389218</identifier><identifier>CODEN: SIREAD</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Algebra ; Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Community structure ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Eigenvalues ; Eigenvectors ; Exact sciences and technology ; Hyperlinks ; Link analysis ; Mathematical analysis ; Mathematical models ; Mathematics ; Matrix ; Numerical analysis ; Numerical analysis. Scientific computation ; Numerical linear algebra ; Problems and Techniques ; Sciences and techniques of general use ; Search engines ; Software ; Studies ; Theoretical computing ; Thrombocytopenia ; World Wide Web</subject><ispartof>SIAM review, 2004-06, Vol.46 (2), p.256-268</ispartof><rights>Copyright 2004 Society for Industrial and Applied Mathematics</rights><rights>2004 INIST-CNRS</rights><rights>Copyright Society for Industrial and Applied Mathematics Jun 2004</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c436t-f98c441d49ef8dfd54e8d195d4afa51cff4b265fd800ae2969b101cd1df067dc3</citedby><cites>FETCH-LOGICAL-c436t-f98c441d49ef8dfd54e8d195d4afa51cff4b265fd800ae2969b101cd1df067dc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/20453505$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/20453505$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,780,784,3185,27924,27925,58238,58471</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15775080$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ding, Chris H. Q.</creatorcontrib><creatorcontrib>Zha, Hongyuan</creatorcontrib><creatorcontrib>He, Xiaofeng</creatorcontrib><creatorcontrib>Husbands, Parry</creatorcontrib><creatorcontrib>Simon, Horst D.</creatorcontrib><title>Link Analysis: Hubs and Authorities on the World Wide Web</title><title>SIAM review</title><description>Ranking the tens of thousands of retrieved webpages for a user query on a Web search engine such that the most informative webpages are on the top is a key information retrieval technology. A popular ranking algorithm is the HITS algorithm of Kleinberg. It explores the reinforcing interplay between authority and hub webpages on a particular topic by taking into account the structure of the Web graphs formed by the hyperlinks between the webpages. In this paper, we give a detailed analysis of the HITS algorithm through a unique combination of probabilistic analysis and matrix algebra. In particular, we show that to first-order approximation, the ranking given by the HITS algorithm is the same as the ranking by counting inbound and outbound hyperlinks. Using Web graphs of different sizes, we also provide experimental results to illustrate the analysis.</description><subject>Algebra</subject><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Community structure</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Eigenvalues</subject><subject>Eigenvectors</subject><subject>Exact sciences and technology</subject><subject>Hyperlinks</subject><subject>Link analysis</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Matrix</subject><subject>Numerical analysis</subject><subject>Numerical analysis. Scientific computation</subject><subject>Numerical linear algebra</subject><subject>Problems and Techniques</subject><subject>Sciences and techniques of general use</subject><subject>Search engines</subject><subject>Software</subject><subject>Studies</subject><subject>Theoretical computing</subject><subject>Thrombocytopenia</subject><subject>World Wide Web</subject><issn>0036-1445</issn><issn>1095-7200</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNplkE9Lw0AQxRdRsFY_gAdhETxGZ7K7ya63UqoVCh5Uegyb_UNTY1J3k0O_vQktevA0M_zeewyPkGuEe0SWP7wBsAw5F4BMqhTlCZkgKJHkKcApmYw4Gfk5uYhxC8MtmZoQtaqaTzprdL2PVXyky76MVDeWzvpu04aqq1ykbUO7jaPrNtSWris7rK68JGde19FdHeeUfDwt3ufLZPX6_DKfrRLDWdYlXknDOVqunJfWW8GdtKiE5dprgcZ7XqaZ8FYCaJeqTJUIaCxaD1luDZuS20PuLrTfvYtdsW37MDwcC1Q8hQwEDCI8iExoYwzOF7tQfemwLxCKsaDiX0GD5-4YrKPRtQ-6MVX8M4o8FyDH7JuDbhu7NvzyFLhgAgT7AerSbSE</recordid><startdate>20040601</startdate><enddate>20040601</enddate><creator>Ding, Chris H. Q.</creator><creator>Zha, Hongyuan</creator><creator>He, Xiaofeng</creator><creator>Husbands, Parry</creator><creator>Simon, Horst D.</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><scope>U9A</scope></search><sort><creationdate>20040601</creationdate><title>Link Analysis: Hubs and Authorities on the World Wide Web</title><author>Ding, Chris H. Q. ; Zha, Hongyuan ; He, Xiaofeng ; Husbands, Parry ; Simon, Horst D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c436t-f98c441d49ef8dfd54e8d195d4afa51cff4b265fd800ae2969b101cd1df067dc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algebra</topic><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Community structure</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Eigenvalues</topic><topic>Eigenvectors</topic><topic>Exact sciences and technology</topic><topic>Hyperlinks</topic><topic>Link analysis</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Matrix</topic><topic>Numerical analysis</topic><topic>Numerical analysis. Scientific computation</topic><topic>Numerical linear algebra</topic><topic>Problems and Techniques</topic><topic>Sciences and techniques of general use</topic><topic>Search engines</topic><topic>Software</topic><topic>Studies</topic><topic>Theoretical computing</topic><topic>Thrombocytopenia</topic><topic>World Wide Web</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ding, Chris H. Q.</creatorcontrib><creatorcontrib>Zha, Hongyuan</creatorcontrib><creatorcontrib>He, Xiaofeng</creatorcontrib><creatorcontrib>Husbands, Parry</creatorcontrib><creatorcontrib>Simon, Horst D.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>SIAM review</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ding, Chris H. Q.</au><au>Zha, Hongyuan</au><au>He, Xiaofeng</au><au>Husbands, Parry</au><au>Simon, Horst D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Link Analysis: Hubs and Authorities on the World Wide Web</atitle><jtitle>SIAM review</jtitle><date>2004-06-01</date><risdate>2004</risdate><volume>46</volume><issue>2</issue><spage>256</spage><epage>268</epage><pages>256-268</pages><issn>0036-1445</issn><eissn>1095-7200</eissn><coden>SIREAD</coden><abstract>Ranking the tens of thousands of retrieved webpages for a user query on a Web search engine such that the most informative webpages are on the top is a key information retrieval technology. A popular ranking algorithm is the HITS algorithm of Kleinberg. It explores the reinforcing interplay between authority and hub webpages on a particular topic by taking into account the structure of the Web graphs formed by the hyperlinks between the webpages. In this paper, we give a detailed analysis of the HITS algorithm through a unique combination of probabilistic analysis and matrix algebra. In particular, we show that to first-order approximation, the ranking given by the HITS algorithm is the same as the ranking by counting inbound and outbound hyperlinks. Using Web graphs of different sizes, we also provide experimental results to illustrate the analysis.</abstract><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/S0036144501389218</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0036-1445 |
| ispartof | SIAM review, 2004-06, Vol.46 (2), p.256-268 |
| issn | 0036-1445 1095-7200 |
| language | eng |
| recordid | cdi_proquest_journals_194206050 |
| source | SIAM Journals Archive; Business Source Ultimate【Trial: -2024/12/31】【Remote access available】; JSTOR Archival Journals and Primary Sources Collection |
| subjects | Algebra Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Community structure Computer science control theory systems Computer systems and distributed systems. User interface Eigenvalues Eigenvectors Exact sciences and technology Hyperlinks Link analysis Mathematical analysis Mathematical models Mathematics Matrix Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Problems and Techniques Sciences and techniques of general use Search engines Software Studies Theoretical computing Thrombocytopenia World Wide Web |
| title | Link Analysis: Hubs and Authorities on the World Wide Web |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T14%3A39%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Link%20Analysis:%20Hubs%20and%20Authorities%20on%20the%20World%20Wide%20Web&rft.jtitle=SIAM%20review&rft.au=Ding,%20Chris%20H.%20Q.&rft.date=2004-06-01&rft.volume=46&rft.issue=2&rft.spage=256&rft.epage=268&rft.pages=256-268&rft.issn=0036-1445&rft.eissn=1095-7200&rft.coden=SIREAD&rft_id=info:doi/10.1137/S0036144501389218&rft_dat=%3Cjstor_proqu%3E20453505%3C/jstor_proqu%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c436t-f98c441d49ef8dfd54e8d195d4afa51cff4b265fd800ae2969b101cd1df067dc3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=194206050&rft_id=info:pmid/&rft_jstor_id=20453505&rfr_iscdi=true |