Name
Abstract | ||
|---|---|---|
We propose a method for constructing classifiers using logical combinations of elementary rules. The method is a form of rule-based classification, which has been widely discussed in the literature. In this work we focus specifically on issues that arise in the context of classifying cell samples based on RNA or protein expression measurements. The basic idea is to specify elementary rules that exhibit a locally strong pattern in favor of a single class. Strict admissibility criteria are imposed to produce a manageable universe of elementary rules. Then the elementary rules are combined using a set covering algorithm to form a composite rule that achieves a perfect fit to the training data. The user has explicit control over a parameter that determines the composite rule's level of redundancy and parsimony. This built-in control, along with the simplicity of interpreting the rules, makes the method particularly useful for classification problems in genomics. We demonstrate the new method using several microarray datasets and examine its generalization performance. We also draw comparisons to other machine-learning strategies such as CART, ID3, and C4.5. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1089/106652703322539033 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | DocType | Volume |
class prediction,genomics,gene expression,set covering | Journal | 10.0 |
Issue | ISSN | Citations |
5 | 1066-5277 | 1 |
PageRank | References | Authors |
0.37 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| George Michailidis | 1 | 303 | 35.19 |
| Kerby Shedden | 2 | 134 | 17.42 |