Sciweavers

4903 search results - page 355 / 981
» The Set Covering Machine
Sort
View
ICML
2004
IEEE
16 years 8 days ago
Redundant feature elimination for multi-class problems
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
Annalisa Appice, Michelangelo Ceci, Simon Rawles, ...
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
15 years 10 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
ESANN
2007
15 years 8 months ago
One-class SVM regularization path and comparison with alpha seeding
One-class support vector machines (1-SVMs) estimate the level set of the underlying density observed data. Aside the kernel selection issue, one difficulty concerns the choice of t...
Alain Rakotomamonjy, Manuel Davy
ICML
2000
IEEE
16 years 7 months ago
Duality and Geometry in SVM Classifiers
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
Kristin P. Bennett, Erin J. Bredensteiner
ICFEM
2004
Springer
16 years 7 days ago
Learning to Verify Safety Properties
We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniqu...
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...