Sciweavers

3050 search results - page 228 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICML
2006
IEEE
16 years 5 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
COLT
2005
Springer
15 years 6 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer
COLT
2010
Springer
15 years 2 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 10 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
AAAI
2008
15 years 6 months ago
Sketch Recognition Based on Manifold Learning
Current feature-based methods for sketch recognition systems rely on human-selected features. Certain machine learning techniques have been found to be good nonlinear features ext...
Heeyoul Choi, Tracy Hammond