Sciweavers

2033 search results - page 115 / 407
» Ranking on Data Manifolds
Sort
View
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SIGIR
2011
ACM
14 years 9 months ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
16 years 3 months ago
Towards Recency Ranking in Web Search
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detect...
Anlei Dong, Yi Chang, Zhaohui Zheng, Gilad Mishne,...
FGR
2008
IEEE
132views Biometrics» more  FGR 2008»
16 years 29 days ago
Logit-RankBoost with pruning for face recognition
In this paper a novel ranking-based face recognition (FR) scheme is proposed. Compared with classical twoclass (intra/extra person) and multi-class (each person a single class) sc...
Bangpeng Yao, Haizhou Ai, Shihong Lao
DIS
2006
Springer
15 years 10 months ago
Optimal Bayesian 2D-Discretization for Variable Ranking in Regression
In supervised machine learning, variable ranking aims at sorting the input variables according to their relevance w.r.t. an output variable. In this paper, we propose a new relevan...
Marc Boullé, Carine Hue