25041 search results - page 4453 / 5009 » Algorithms for Clustering Data |
183
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...
186
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
180
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
197
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
192
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...