2463 search results - page 2 / 493 » Rankings of Directed Graphs |
CIIA
2009
13 years 6 months ago
2009
Several rule discovery algorithms have the disadvantage to discover too much patterns sometimes obvious, useless or not very interesting to the user. In this paper we propose a new...
VLDB
2007
ACM
13 years 11 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
CIAC
2010
Springer
13 years 10 months ago
2010
Springer
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolv...
ALT
2010
Springer
13 years 9 days ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts