GENERALIZATION AS SEARCH
GENERALIZATION AS SEARCH
复制标题
DOI：
10.1016/0004-3702(82)90040-6
复制
发表时间：
1982-01-01
影响因子：
14.4
通讯作者：
MITCHELL, TM
中科院分区：
文献类型：
--
作者：
MITCHELL, TM
概念学习的问题，或形成一个一般的描述一类对象给定的一组例子和非例子，在这里被视为一个搜索问题。现有的程序，从例子中概括的特点是类的搜索策略，他们采用。几类搜索策略，然后分析和比较其相对能力和计算复杂性。
The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem. Existing programs that generalize from examples are characterized in terms of the classes of search strategies that they employ. Several classes of search strategies are then analyzed and compared in terms of their relative capabilities and computational complexities.