Sciweavers

2100 search results - page 11 / 420
» Learning to rank on graphs
Sort
View
WAW
2010
Springer
269views Algorithms» more  WAW 2010»
14 years 7 months ago
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
Fan Chung, Wenbo Zhao
70
Voted
IPL
2006
87views more  IPL 2006»
14 years 9 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski
APWEB
2005
Springer
14 years 11 months ago
A Neural Network Approach to Web Graph Processing
In this paper, we will provide an overview of some of the more recent developments in web graph processing using the classic Google page rank equation as popularized by Brins and P...
Ah Chung Tsoi, Franco Scarselli, Marco Gori, Marku...
COLT
2005
Springer
15 years 3 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
15 years 4 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...