Sciweavers

7215 search results - page 205 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
WWW
2011
ACM
13 years 3 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...
DOCENG
2006
ACM
14 years 2 months ago
NEWPAR: an automatic feature selection and weighting schema for category ranking
Category ranking provides a way to classify plain text documents into a pre-determined set of categories. This work proposes to have a look at typical document collections and ana...
Fernando Ruiz-Rico, José Luis Vicedo Gonz&a...
WIDM
2005
ACM
14 years 1 months ago
Web path recommendations based on page ranking and Markov models
Markov models have been widely used for modelling users' navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the w...
Magdalini Eirinaki, Michalis Vazirgiannis, Dimitri...
SIAMJO
2011
13 years 3 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 10 months ago
Comparison of cauchy EDA and rosenbrock's algorithms on the BBOB noiseless testbed
Estimation-of-distribution algorithm equipped with Cauchy distribution (Cauchy EDA) is compared with Rosenbrock’s local search algorithm. Both algorithms were already presented ...
Petr Posík