PageRank algorithm
E66951
The PageRank algorithm is a link analysis method used by search engines, notably Google, to rank web pages in search results based on their importance within the web’s link structure.
All labels observed (5)
| Label | Occurrences |
|---|---|
| PageRank | 5 |
| PageRank algorithm canonical | 4 |
| Personalized PageRank | 1 |
| Topic-sensitive PageRank | 1 |
| Weighted PageRank | 1 |
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
graph algorithm
ⓘ
link analysis algorithm ⓘ ranking algorithm ⓘ |
| alsoUsedFor |
ranking scientific papers
ⓘ
ranking social network nodes ⓘ recommendation systems ⓘ spam detection ⓘ |
| basedOn |
Markov processes
ⓘ
surface form:
Markov chain
eigenvector centrality ⓘ random surfer model ⓘ |
| category |
Google
ⓘ
surface form:
Google technologies
search engine optimization ⓘ |
| complexity | iterative polynomial-time algorithm ⓘ |
| computationalMethod | power iteration ⓘ |
| coreIdea | a page is important if important pages link to it ⓘ |
| describedInPaper |
The Anatomy of a Large-Scale Hypertextual Web Search Engine
ⓘ
The Anatomy of a Large-Scale Hypertextual Web Search Engine ⓘ
surface form:
The PageRank Citation Ranking: Bringing Order to the Web
|
| developedAt | Stanford University ⓘ |
| developedBy |
Larry Page
ⓘ
Sergey Brin ⓘ |
| field |
information retrieval
ⓘ
network science ⓘ web search ⓘ |
| handlesIssue |
dangling nodes
ⓘ
rank sinks ⓘ |
| hasVariant |
PageRank algorithm
self-linksurface differs
ⓘ
surface form:
Personalized PageRank
PageRank algorithm self-linksurface differs ⓘ
surface form:
Topic-sensitive PageRank
PageRank algorithm self-linksurface differs ⓘ
surface form:
Weighted PageRank
|
| influenced |
graph-based ranking methods
ⓘ
modern search ranking algorithms ⓘ |
| input | hyperlinks between web pages ⓘ |
| introducedIn | 1998 ⓘ |
| licenseHistory | patented by Stanford University ⓘ |
| mathematicalFormulation | eigenvector of normalized link matrix ⓘ |
| operatesOn |
directed graph
ⓘ
web graph ⓘ |
| output | importance score for each page ⓘ |
| patentAssignee | Stanford University ⓘ |
| patentLicensedTo | Google ⓘ |
| primaryUse | ranking web pages in search results ⓘ |
| relatedConcept |
HITS algorithm
ⓘ
centrality measures in networks ⓘ |
| scale | web-scale graphs ⓘ |
| typicalDampingFactor | 0.85 ⓘ |
| usedBy |
Google Search
ⓘ
surface form:
Google search engine
|
| usesConcept |
link analysis
ⓘ
probability distribution over pages ⓘ stationary distribution of a Markov chain ⓘ |
| usesParameter | damping factor ⓘ |
Referenced by (12)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
PageRank
subject surface form:
PageRank
this entity surface form:
Personalized PageRank
subject surface form:
PageRank
this entity surface form:
Topic-sensitive PageRank
subject surface form:
PageRank
this entity surface form:
Weighted PageRank
this entity surface form:
PageRank
this entity surface form:
PageRank
this entity surface form:
PageRank
this entity surface form:
PageRank