24 search results - page 3 / 5 » Weighted PageRank: Cluster-Related Weights |
WEBI
2005
Springer
13 years 10 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
ML
2010
ACM
13 years 3 months ago
2010
ACM
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
ICDCS
2005
IEEE
13 years 10 months ago
2005
IEEE
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...