Sciweavers

440 search results - page 29 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
ESANN
2006
13 years 9 months ago
Magnification control for batch neural gas
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
Barbara Hammer, Alexander Hasenfuss, Thomas Villma...
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
IDA
2005
Springer
14 years 1 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
ESANN
2000
13 years 9 months ago
Distributed clustering and local regression for knowledge discovery in multiple spatial databases
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Ob...