InDegree Analysis (Link Analysis)
Revision as of 10:25, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:InDegree Analysis (Link Analysis)}} == Description == A simple heuristic that can be viewed as the predecessor of all Link Analysis Ranking algorithms is to rank the pages according to their popularity (also referred to as visibility (Marchiori 1997)). The popularity of a page is measured by the number of pages that link to this page. We refer to this algorithm as the InDegree algorithm, since it ranks pages according to their in-degree in the graph $G$....")
Description
A simple heuristic that can be viewed as the predecessor of all Link Analysis Ranking algorithms is to rank the pages according to their popularity (also referred to as visibility (Marchiori 1997)). The popularity of a page is measured by the number of pages that link to this page. We refer to this algorithm as the InDegree algorithm, since it ranks pages according to their in-degree in the graph $G$. That is, for every node $i$, $a_i = |B(i)|$.
Related Problems
Related: Link Analysis
Parameters
No parameters found.
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| The INDEGREE Algorithm | 1997 | $O(m^{2} n )$ | $O(n)$ | Exact | Deterministic | Time |
Time Complexity graph
Space Complexity graph
Pareto Decades graph
