Sciweavers

5771 search results - page 817 / 1155
» Learning similarity space
Sort
View
INFORMS
1998
100views more  INFORMS 1998»
15 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
227
Voted
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
17 years 17 days ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
CVPR
2007
IEEE
16 years 9 months ago
Connecting the Out-of-Sample and Pre-Image Problems in Kernel Methods
Kernel methods have been widely studied in the field of pattern recognition. These methods implicitly map, "the kernel trick," the data into a space which is more approp...
Pablo Arias, Gregory Randall, Guillermo Sapiro
CVPR
2008
IEEE
16 years 9 months ago
Discovering class specific composite features through discriminative sampling with Swendsen-Wang Cut
This paper proposes a novel approach to discover a set of class specific "composite features" as the feature pool for the detection and classification of complex objects...
Feng Han, Ying Shan, Harpreet S. Sawhney, Rakesh K...
CVPR
2008
IEEE
16 years 9 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto