574 search results - page 17 / 115 » Maximum Margin Clustering |
161
click to vote
ICMLA
2009
15 years 3 months ago
2009
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
167
click to vote
IDA
2007
Springer
15 years 11 months ago
2007
Springer
The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assign...
167
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
It is common in classification methods to first place data in a vector space and then learn decision boundaries. We propose reversing that process: for fixed decision boundaries, ...
159
click to vote
ICPR
2008
IEEE
15 years 12 months ago
2008
IEEE
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
144
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...