Sciweavers

392 search results - page 77 / 79
» A unified framework for generalized Linear Discriminant Anal...
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 6 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
RECSYS
2009
ACM
14 years 10 days ago
Learning to recommend with trust and distrust relationships
With the exponential growth of Web contents, Recommender System has become indispensable for discovering new information that might interest Web users. Despite their success in th...
Hao Ma, Michael R. Lyu, Irwin King
COMPGEOM
2009
ACM
14 years 10 days ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
ICML
2010
IEEE
13 years 6 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
SIAMCO
2000
89views more  SIAMCO 2000»
13 years 5 months ago
Stability Radius and Internal Versus External Stability in Banach Spaces: An Evolution Semigroup Approach
In this paper the theory of evolution semigroups is developed and used to provide a framework to study the stability of general linear control systems. These include autonomous and...
Stephen Clark, Yuri Latushkin, Stephen Montgomery-...