Sciweavers

2018 search results - page 113 / 404
» Magnitude-preserving ranking algorithms
Sort
View
WIDM
2005
ACM
15 years 12 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
15 years 1 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»
15 years 8 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
SIAMJO
2010
246views more  SIAMJO 2010»
15 years 4 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
IJCAI
2003
15 years 7 months ago
Evaluating Matching Algorithms: the Monotonicity Principle
In this paper we present the monotonicity principle, a sufficient condition to ensure that exact mapping, a mapping as would be performed by a human observer, is ranked close to ...
Ateret Anaby-Tavor, Avigdor Gal, Alberto Trombetta