123
click to vote
FCT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
138
Voted
ACML
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
84
Voted
KDD
2003
ACM
16 years 2 months ago
2003
ACM
166
Voted
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
214
Voted
Book
Book web site includes links to a full course, software, and other material.