Abstract
This paper proposes a new algorithm for acquisition of preference predicates by a learning apprentice, termed Compositional Instance-Based Learning (CIBL), that permits multiple instances of a preference predicate to be composed, directly exploiting the transitivity of preference predicates. In an empirical evaluation, CIBL was consistently more accurate than a 1-NN instance-based learning strategy unable to compose instances. The relative performance of CIBL and decision tree induction was found to depend upon (1) the complexity of the preference predicate being acquired and (2) the dimensionality of the feature space.
| Original language | English (US) |
|---|---|
| Pages | 651-656 |
| Number of pages | 6 |
| State | Published - Dec 1 1994 |
| Event | Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) - Seattle, WA, USA Duration: Jul 31 1994 → Aug 4 1994 |
Other
| Other | Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) |
|---|---|
| City | Seattle, WA, USA |
| Period | 7/31/94 → 8/4/94 |
All Science Journal Classification (ASJC) codes
- Software
- Artificial Intelligence