Sciweavers

2177 search results - page 17 / 436
» Relative Margin Machines
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ICML
2003
IEEE
14 years 8 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
ALT
2006
Springer
14 years 4 months ago
Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
Abstract. We propose a thresholded ensemble model for ordinal regression problems. The model consists of a weighted ensemble of confidence functions and an ordered vector of thres...
Hsuan-Tien Lin, Ling Li
SLSFS
2005
Springer
14 years 29 days ago
Random Projection, Margins, Kernels, and Feature-Selection
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
Avrim Blum
IJCAI
2003
13 years 8 months ago
Approximate Policy Iteration using Large-Margin Classifiers
We present an approximate policy iteration algorithm that uses rollouts to estimate the value of each action under a given policy in a subset of states and a classifier to general...
Michail G. Lagoudakis, Ronald Parr