Sciweavers

2033 search results - page 86 / 407
» Ranking on Data Manifolds
Sort
View
WWW
2011
ACM
13 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
NIPS
2001
13 years 11 months ago
Global Coordination of Local Linear Models
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
Sam T. Roweis, Lawrence K. Saul, Geoffrey E. Hinto...
PAMI
2008
203views more  PAMI 2008»
13 years 9 months ago
Free-Form Object Reconstruction from Silhouettes, Occluding Edges and Texture Edges: A Unified and Robust Operator Based on Dual
In this paper, the duality in differential form is developed between a 3D primal surface and its dual manifold formed by the surface's tangent planes, i.e., each tangent plan...
Shubao Liu, Kongbin Kang, Jean-Philippe Tarel, Dav...
KDD
2010
ACM
275views Data Mining» more  KDD 2010»
14 years 1 months ago
Combined regression and ranking
Many real-world data mining tasks require the achievement of two distinct goals when applied to unseen data: first, to induce an accurate preference ranking, and second to give g...
D. Sculley
ACMSE
2010
ACM
13 years 4 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins