Sciweavers

422 search results - page 36 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
JMLR
2012
11 years 10 months ago
A Stick-Breaking Likelihood for Categorical Data Analysis with Latent Gaussian Models
The development of accurate models and efficient algorithms for the analysis of multivariate categorical data are important and longstanding problems in machine learning and compu...
Mohammad Emtiyaz Khan, Shakir Mohamed, Benjamin M....
JMLR
2012
11 years 10 months ago
A metric learning perspective of SVM: on the relation of LMNN and SVM
Support Vector Machines, SVMs, and the Large Margin Nearest Neighbor algorithm, LMNN, are two very popular learning algorithms with quite different learning biases. In this paper...
Huyen Do, Alexandros Kalousis, Jun Wang, Adam Wozn...
WWW
2003
ACM
14 years 8 months ago
Adaptive ranking of web pages
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It...
Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Ma...
COMPUTING
2004
108views more  COMPUTING 2004»
13 years 7 months ago
Fairness Criteria for Algebraic Curves
We develop methods for the variational design of algebraic curves. Our approach is based on truly geometric fairness criteria, such as the elastic bending energy. In addition, we ...
Pavel Chalmovianský, Bert Jüttler
JMLR
2008
169views more  JMLR 2008»
13 years 8 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen