Sciweavers

364 search results - page 33 / 73
» On the generalization of soft margin algorithms
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti
CVPR
2004
IEEE
14 years 11 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
CEC
2007
IEEE
14 years 3 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
FOCS
1999
IEEE
14 years 1 months ago
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
Rosa I. Arriaga, Santosh Vempala
ECCV
2002
Springer
14 years 11 months ago
A Tale of Two Classifiers: SNoW vs. SVM in Visual Recognition
Numerous statistical learning methods have been developed for visual recognition tasks. Few attempts, however, have been made to address theoretical issues, and in particular, stud...
Ming-Hsuan Yang, Dan Roth, Narendra Ahuja