174 search results - page 4 / 35 » Incremental and Decremental Learning for Linear Support Vect... |
152
Voted
ECML
2006
Springer
15 years 5 months ago
2006
Springer
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
147
Voted
COLING
2008
15 years 5 months ago
2008
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
147
Voted
KDD
2005
ACM
16 years 4 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
133
Voted
ALT
2001
Springer
16 years 22 days ago
2001
Springer
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
131
click to vote
ESANN
2007
15 years 5 months ago
2007
Imprecision, incompleteness, prior knowledge or improved learning speed can motivate interval–represented data. Most approaches for SVM learning of interval data use local kernel...