Sciweavers

159 search results - page 1 / 32
» Boosting margin based distance functions for clustering
Sort
View
ICML
2004
IEEE
14 years 5 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
CVPR
2004
IEEE
14 years 6 months ago
Learning Distance Functions for Image Retrieval
Image retrieval critically relies on the distance function used to compare a query image to images in the database. We suggest to learn such distance functions by training binary ...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
CVPR
2011
IEEE
12 years 8 months ago
TaylorBoost: First and Second-order Boosting Algorithms with Explicit Margin Control
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
Mohammad Saberian, Hamed Masnadi-Shirazi, Nuno Vas...
COLT
2004
Springer
13 years 10 months ago
Boosting Based on a Smooth Margin
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...
Cynthia Rudin, Robert E. Schapire, Ingrid Daubechi...
BMCBI
2006
111views more  BMCBI 2006»
13 years 4 months ago
PepDist: A New Framework for Protein-Peptide Binding Prediction based on Learning Peptide Distance Functions
Background: Many different aspects of cellular signalling, trafficking and targeting mechanisms are mediated by interactions between proteins and peptides. Representative examples...
Tomer Hertz, Chen Yanover