Sciweavers

411 search results - page 18 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Learning low-rank kernel matrices
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
Brian Kulis, Inderjit S. Dhillon, Máty&aacu...
ICML
2008
IEEE
14 years 8 months ago
Optimizing estimated loss reduction for active sampling in rank learning
Learning to rank is becoming an increasingly popular research area in machine learning. The ranking problem aims to induce an ordering or preference relations among a set of insta...
Pinar Donmez, Jaime G. Carbonell
ICPR
2008
IEEE
14 years 2 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
ICASSP
2011
IEEE
12 years 11 months ago
Comparison of several covariance matrix estimators for portfolio optimization
Modern portfolio theory dates back to a seminal 1952 paper by H. Markowitz and has been very influential both in academic finance and among practitioners in the financial indus...
Ka Ki Ng, Priyanka Agarwal, Nathan Mullen, Dzung D...
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
11 years 10 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...