Sciweavers

337 search results - page 35 / 68
» Efficient algorithms for ranking with SVMs
Sort
View
TOMS
2008
96views more  TOMS 2008»
15 years 6 months ago
Block variants of Hammarling's method for solving Lyapunov equations
This paper is concerned with the efficient numerical solution of the Lyapunov equation AT X +XA = -C with a stable matrix A and a symmetric positive semidefinite matrix C of possi...
Daniel Kressner
ICML
2006
IEEE
16 years 7 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...
PVLDB
2010
225views more  PVLDB 2010»
15 years 28 days ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
ICDE
2005
IEEE
86views Database» more  ICDE 2005»
16 years 7 months ago
Personalized Queries under a Generalized Preference Model
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The un...
Georgia Koutrika, Yannis E. Ioannidis
JMLR
2006
156views more  JMLR 2006»
15 years 6 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...