7215 search results - page 199 / 1443 » On the Consistency of Ranking Algorithms |
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...
EMNLP
2007
13 years 9 months ago
2007
We present a new approach to automatic summarization based on neural nets, called NetSum. We extract a set of features from each sentence that helps identify its importance in the...
NIPS
2004
13 years 9 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...