2100 search results - page 169 / 420 » Learning to rank on graphs |
185
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
This paper aims at presenting how natural language processing and machine learning techniques can help the internet surfer to get a better overview of the pages he is reading. The ...
269
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
186
click to vote
UAI
2008
15 years 8 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
153
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
156
click to vote
IJAC
2007
15 years 6 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...