Sciweavers

11 search results - page 1 / 3
» SoftDoubleMinOver: A Simple Procedure for Maximum Margin Cla...
Sort
View
ICANN
2005
Springer
14 years 4 months ago
SoftDoubleMinOver: A Simple Procedure for Maximum Margin Classification
Thomas Martinetz, Kai Labusch, Daniel Schneega&szl...
JMLR
2010
144views more  JMLR 2010»
13 years 5 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
DAGM
2008
Springer
14 years 19 days ago
Simple Incremental One-Class Support Vector Classification
We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice...
Kai Labusch, Fabian Timm, Thomas Martinetz
ICPR
2006
IEEE
14 years 12 months ago
A maximum margin discriminative learning algorithm for temporal signals
We propose a new maximum margin discriminative learning algorithm here for classification of temporal signals. It is superior to conventional HMM in the sense that it does not nee...
Wenjie Xu, Jiankang Wu, Zhiyong Huang
SIGIR
2002
ACM
13 years 10 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby