Sciweavers

346 search results - page 14 / 70
» A New Approximate Maximal Margin Classification Algorithm
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
Prototype learning with margin-based conditional log-likelihood loss
The classification performance of nearest prototype classifiers largely relies on the prototype learning algorithms, such as the learning vector quantization (LVQ) and the minimum...
Cheng-Lin Liu, Xiaobo Jin, Xinwen Hou
NJC
2000
99views more  NJC 2000»
13 years 7 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
JMLR
2008
168views more  JMLR 2008»
13 years 7 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
CLEF
2010
Springer
13 years 8 months ago
A Multi Cue Discriminative Approach to Semantic Place Classification
This paper describes the participation of Idiap-MULTI to the Robot Vision Task at imageCLEF 2010. Our approach was based on a discriminative classification algorithm using multiple...
Marco Fornoni, Jesus Martínez-Gómez,...
NAACL
2010
13 years 5 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes