An interference matching technique for inducing abstractions
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Learning Structural Descriptions From Examples
Learning Structural Descriptions From Examples
| Hi-index | 0.00 |
The problem of learning categories from a sequence of examples is considered in terms of maintaining a minimum-cost representation for the set of categories. Categories here are subsets of a set of natural numbers. Computational aspects of the following problems are addressed: (1) how are the category representations updated as an incremental change is made to one category, (2) how can a minimum cost representation for a new category be obtained in terms of existing ones, and (3) how does the enlargement of the known universe of objects affect representations of known categories. We then discuss extensions of our methodology to domains which include structure in the categorical descriptions.