Sciweavers

212 search results - page 8 / 43
» Random subspace method for multivariate feature selection
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
Informative Feature Selection for Object Recognition via Sparse PCA
Bag-of-words (BoW) methods are a popular class of object recognition methods that use image features (e.g., SIFT) to form visual dictionaries and subsequent histogram vectors to r...
Nikhil Naikal, Allen Y. Yang, S. Shankar Sastry
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ICPR
2008
IEEE
15 years 4 months ago
A feature selection algorithm for handwritten character recognition
We present a Genetic Algorithm based feature selection approach according to which feature subsets are represented by individuals of an evolving population. Evolution is controlle...
Luigi P. Cordella, Claudio De Stefano, Francesco F...
NIPS
2007
14 years 11 months ago
Feature Selection Methods for Improving Protein Structure Prediction with Rosetta
Rosetta is one of the leading algorithms for protein structure prediction today. It is a Monte Carlo energy minimization method requiring many random restarts to find structures ...
Ben Blum, Michael I. Jordan, David Kim, Rhiju Das,...
ALT
2006
Springer
15 years 6 months ago
Unsupervised Slow Subspace-Learning from Stationary Processes
Abstract. We propose a method of unsupervised learning from stationary, vector-valued processes. A low-dimensional subspace is selected on the basis of a criterion which rewards da...
Andreas Maurer