Sciweavers

137 search results - page 12 / 28
» A Method for Classification of Convex Polygons
Sort
View
ACMSE
2010
ACM
13 years 2 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
NIPS
2008
13 years 9 months ago
Clustered Multi-Task Learning: A Convex Formulation
In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from th...
Laurent Jacob, Francis Bach, Jean-Philippe Vert
ICML
2009
IEEE
14 years 8 months ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
MP
2006
94views more  MP 2006»
13 years 7 months ago
Optimization-based simulation of nonsmooth rigid multibody dynamics
We present a time-stepping method to simulate rigid multibody dynamics with inelastic collision, contact, and friction. The method progresses with fixed time step without backtrac...
Mihai Anitescu
ICML
2007
IEEE
14 years 8 months ago
Classifying matrices with a spectral regularization
We propose a method for the classification of matrices. We use a linear classifier with a novel regularization scheme based on the spectral 1-norm of its coefficient matrix. The s...
Ryota Tomioka, Kazuyuki Aihara