Sciweavers

168 search results - page 6 / 34
» Feature selection focused within error clusters
Sort
View
ECML
1998
Springer
13 years 11 months ago
A Monotonic Measure for Optimal Feature Selection
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Huan Liu, Hiroshi Motoda, Manoranjan Dash
ACG
2009
Springer
14 years 2 months ago
Automated Discovery of Search-Extension Features
One of the main challenges with selective search extensions is designing effective move categories (features). This is a manual trial and error task, which requires both intuition...
Pálmi Skowronski, Yngvi Björnsson, Mar...
BIOINFORMATICS
2005
109views more  BIOINFORMATICS 2005»
13 years 7 months ago
Prediction error estimation: a comparison of resampling methods
In genomic studies, thousands of features are collected on relatively few samples. One of the goals of these studies is to build classifiers to predict the outcome of future obser...
Annette M. Molinaro, Richard Simon, Ruth M. Pfeiff...
NIPS
2004
13 years 8 months ago
The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
Robert Jenssen, Deniz Erdogmus, José Carlos...
ACL
2007
13 years 9 months ago
A Simple, Similarity-based Model for Selectional Preferences
We propose a new, simple model for the automatic induction of selectional preferences, using corpus-based semantic similarity metrics. Focusing on the task of semantic role labeli...
Katrin Erk