Name
Abstract | ||
|---|---|---|
In this paper we discuss the relation and the difference between two algorithms BrowseRank and PageRank. We analyze their stationary distributions by the ergodic theory of Markov processes. We compare in detail the link graph used in PageRank and the user browsing graph used in BrowseRank. Along with the comparison, the importance of the metadata contained in the user browsing graph is explored. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-14355-7_1 | AAIM |
Keywords | Field | DocType |
stationary distribution,ergodic theory,page importance,algorithms browserank,link graph,ergodic theorem,markov process | PageRank,Graph,Metadata,Combinatorics,Markov process,Computer science,Ergodic theory,Algorithm,Theoretical computer science,Stationary distribution,Graph (abstract data type),Moral graph | Conference |
Volume | ISSN | ISBN |
6124 | 0302-9743 | 3-642-14354-7 |
Citations | PageRank | References |
1 | 0.38 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu-ting Liu | 1 | 188 | 8.95 |
| Zhi-Ming Ma | 2 | 227 | 18.26 |