## Bottom-Up Induction of Oblivious Read-Once Decision Graphs (1994)

### Cached

### Download Links

- [robotics.stanford.edu]
- [robotics.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 45 - 8 self |

### BibTeX

@MISC{Kohavi94bottom-upinduction,

author = {Ron Kohavi},

title = {Bottom-Up Induction of Oblivious Read-Once Decision Graphs},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We investigate the use of oblivious, read-once decision graphs as structures for representing concepts over discrete domains, and present a bottom-up, hill-climbing algorithm for inferring these structures from labelled instances. The algorithm is robust with respect to irrelevant attributes, and experimental results show that it performs well on problems considered difficult for symbolic induction methods, such as the Monk's problems and parity. 1 Introduction Top down induction of decision trees [25, 24, 20] has been one of the principal induction methods for symbolic, supervised learning. The tree structure, which is used for representing the hypothesized target concept, suffers from some wellknown problems, most notably the replication problem and the fragmentation problem [23]. The replication problem forces duplication of subtrees in disjunctive concepts, such as (A B) (C D); the fragmentation problem causes partitioning of the data into fragments, when a high-arity attrib...