Sciweavers

1584 search results - page 105 / 317
» Data selection for support vector machine classifiers
Sort
View
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
15 years 4 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario
TNN
2010
176views Management» more  TNN 2010»
14 years 4 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
IJBRA
2010
133views more  IJBRA 2010»
14 years 7 months ago
Scalable biomedical Named Entity Recognition: investigation of a database-supported SVM approach
This paper explores the scalability issues associated with solving the Named Entity Recognition (NER) problem using Support Vector Machines (SVM) and high-dimensional features and ...
Mona Soliman Habib, Jugal Kalita
BMCBI
2007
153views more  BMCBI 2007»
14 years 10 months ago
Analysis of nanopore detector measurements using Machine-Learning methods, with application to single-molecule kinetic analysis
Background: A nanopore detector has a nanometer-scale trans-membrane channel across which a potential difference is established, resulting in an ionic current through the channel ...
Matthew Landry, Stephen Winters-Hilt
ESANN
2006
14 years 11 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...