Sciweavers

735 search results - page 81 / 147
» Margin based feature selection - theory and algorithms
Sort
View
ATAL
2007
Springer
15 years 8 months ago
Children in the forest: towards a canonical problem of spatio-temporal collaboration
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...
Yi Luo, Ladislau Bölöni
NAACL
2010
14 years 11 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
138
Voted
ICML
2003
IEEE
16 years 2 months ago
Hidden Markov Support Vector Machines
This paper presents a novel discriminative learning technique for label sequences based on a combination of the two most successful learning algorithms, Support Vector Machines an...
Yasemin Altun, Ioannis Tsochantaridis, Thomas Hofm...
CGO
2010
IEEE
15 years 8 months ago
Automatic creation of tile size selection models
Tiling is a widely used loop transformation for exposing/exploiting parallelism and data locality. Effective use of tiling requires selection and tuning of the tile sizes. This is...
Tomofumi Yuki, Lakshminarayanan Renganarayanan, Sa...
155
Voted
HAIS
2010
Springer
14 years 12 months ago
Reducing Dimensionality in Multiple Instance Learning with a Filter Method
In this article, we describe a feature selection algorithm which can automatically find relevant features for multiple instance learning. Multiple instance learning is considered a...
Amelia Zafra, Mykola Pechenizkiy, Sebastián...