Sciweavers

1719 search results - page 135 / 344
» Supervised Dictionary Learning
Sort
View
MICAI
2004
Springer
15 years 3 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
COLT
2006
Springer
15 years 1 months ago
Ranking with a P-Norm Push
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
Cynthia Rudin
91
Voted
NIPS
1998
14 years 11 months ago
Batch and On-Line Parameter Estimation of Gaussian Mixtures Based on the Joint Entropy
We describe a new iterative method for parameter estimation of Gaussian mixtures. The new method is based on a framework developed by Kivinen and Warmuth for supervised on-line le...
Yoram Singer, Manfred K. Warmuth
CORR
2010
Springer
70views Education» more  CORR 2010»
14 years 10 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
COLING
2002
14 years 10 months ago
Fine Grained Classification of Named Entities
While Named Entity extraction is useful in many natural language applications, the coarse categories that most NE extractors work with prove insufficient for complex applications ...
Michael Fleischman, Eduard H. Hovy