Sciweavers

120 search results - page 18 / 24
» Convex Principal Feature Selection
Sort
View
JMLR
2010
187views more  JMLR 2010»
13 years 2 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
IJCNN
2007
IEEE
14 years 2 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
ICCV
2005
IEEE
14 years 9 months ago
A Supervised Learning Framework for Generic Object Detection in Images
In recent years Kernel Principal Component Analysis (Kernel PCA) has gained much attention because of its ability to capture nonlinear image features, which are particularly impor...
Saad Ali, Mubarak Shah
AVSS
2009
IEEE
14 years 29 days ago
Compact Signatures for 3D Face Recognition under Varying Expressions
We present a novel approach to 3D face recognition using compact face signatures based on automatically detected 3D landmarks. We represent the face geometry with inter-landmark d...
Fahad Daniyal, Prathap Nair, Andrea Cavallaro
CEC
2008
IEEE
14 years 2 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva