Sciweavers

9 search results - page 2 / 2
» The Concave-Convex Procedure (CCCP)
Sort
View
ICANN
2005
Springer
15 years 3 months ago
The LCCP for Optimizing Kernel Parameters for SVM
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
77
Voted
CVPR
2010
IEEE
15 years 3 months ago
Latent Hierarchical Structural Learning for Object Detection
We present a latent hierarchical structural learning method for object detection. An object is represented by a mixture of hierarchical tree models where the nodes represent objec...
Leo Zhu, Yuanhao Chen, Antonio Torralba, Alan Yuil...
82
Voted
CVPR
2010
IEEE
15 years 3 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
14 years 11 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang