東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Detecting colluders in PageRank: Fin...

Mason, Kahn.

FindBook

Google Book

Amazon

博客來

Detecting colluders in PageRank: Finding slow mixing states in a Markov chain.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Detecting colluders in PageRank: Finding slow mixing states in a Markov chain./
作者:	Mason, Kahn.
面頁冊數:	75 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-08, Section: A, page: 3044.
Contained By:	Dissertation Abstracts International66-08A.
標題:	Economics, Theory. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3187317
ISBN:	9780542295676

Detecting colluders in PageRank: Finding slow mixing states in a Markov chain.
Mason, Kahn.

Detecting colluders in PageRank: Finding slow mixing states in a Markov chain. - 75 p.

Source: Dissertation Abstracts International, Volume: 66-08, Section: A, page: 3044.

Thesis (Ph.D.)--Stanford University, 2005.

The PageRank algorithm evaluates webpage reputations based on the hyperlinks that connect them. Webpages that collude to boost their reputations significantly distort the resulting rankings. We introduce a measure for assessing the degree to which a set of webpages boosts its reputation. There is no known efficient algorithm that is guaranteed to detect significantly boosted sets when they exist. However, we provide metrics that, under reasonable conditions, are guaranteed to detect a member of a significantly boosted set, if one exists, and address various implementation issues that arise in incorporating these metrics into PageRank.

ISBN: 9780542295676Subjects--Topical Terms:

1017575
Economics, Theory.

Detecting colluders in PageRank: Finding slow mixing states in a Markov chain.
LDR:01551nmm 2200289 4500 001 1827947
005 20061228142235.5
008 130610s2005 eng d
020 $a 9780542295676
035 $a (UnM)AAI3187317
035 $a AAI3187317
040 $a UnM $c UnM
100 1 $a Mason, Kahn. $3 1916861
245 1 0 $a Detecting colluders in PageRank: Finding slow mixing states in a Markov chain.
300 $a 75 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-08, Section: A, page: 3044.
500 $a Adviser: Benjamin Van Roy.
502 $a Thesis (Ph.D.)--Stanford University, 2005.
520 $a The PageRank algorithm evaluates webpage reputations based on the hyperlinks that connect them. Webpages that collude to boost their reputations significantly distort the resulting rankings. We introduce a measure for assessing the degree to which a set of webpages boosts its reputation. There is no known efficient algorithm that is guaranteed to detect significantly boosted sets when they exist. However, we provide metrics that, under reasonable conditions, are guaranteed to detect a member of a significantly boosted set, if one exists, and address various implementation issues that arise in incorporating these metrics into PageRank.
590 $a School code: 0212.
650 4 $a Economics, Theory. $3 1017575
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, System Science. $3 1018128
690 $a 0511
690 $a 0984
690 $a 0790
710 2 0 $a Stanford University. $3 754827
773 0 $t Dissertation Abstracts International $g 66-08A.
790 1 0 $a Van Roy, Benjamin, $e advisor
790 $a 0212
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3187317