Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

NIPS
2004

favoriteEmaildiscussreport

95views Information Technology» more NIPS 2004»

PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data

14 years 8 days ago

PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data

Download books.nips.cc

We propose a "soft greedy" learning algorithm for building small conjunctions of simple threshold functions, called rays, defined on single real-valued attributes. We also propose a PAC-Bayes risk bound which is minimized for classifiers achieving a non-trivial tradeoff between sparsity (the number of rays used) and the magnitude of the separating margin of each ray. Finally, we test the soft greedy algorithm on four DNA micro-array data sets.

Mario Marchand, Mohak Shah

Real-time Traffic

NIPS 2004 | NIPS 2007 | Simple Threshold Functions | Single Real-valued Attributes | Soft Greedy Algorithm |

claim paper

Related Content

» A combinational feature selection and ensemble neural network method for classification of...

» Kernelbased distance metric learning for microarray data classification

» Kernelimbedded Gaussian processes for disease classification using microarray gene express...

» Gene Expression Data Classification with Revised Kernel Partial Least Squares Algorithm

» Gene Selection for Tumor Classification Using Microarray Gene Expression Data

» Recursive Cluster Elimination RCE for classification and feature selection from gene expre...

» Strangenessbased feature weighting and classification of gene expression profiles

» Learning Rough Set Classifiers from Gene Expressions and Clinical Data

» Learning Microarray Gene Expression Data by Hybrid Discriminant Analysis

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	NIPS
Authors	Mario Marchand, Mohak Shah

Comments (0)