无限概念族的精确学习
Exact learning for infinite families of concepts
摘要:
在本文中,基于精确学习,测试理论和粗糙集理论的结果,我们研究任意的无限族的概念,其中每个概念由一个无限的元素集和这个集合的子集称为概念的无限集。我们考虑一个由有限个元素描述的概念族上的问题的概念:对于一个给定的概念,我们应该认识到所考虑的元素中哪些属于这个概念。作为解决问题的算法,我们考虑五种类型的决策树:(i)使用成员资格查询,(ii)使用等价查询,(iii)使用成员资格和等价查询,(iv)使用适当的等价查询,以及(v)使用成员资格和适当的等价查询。作为时间复杂度,我们研究了决策树的深度。在最坏的情况下,随着问题描述中的元素数量的增长,第一类型的决策树的最小深度或者作为对数或者线性地增长,并且其他类型中的每一种的决策树的最小深度或者从上由常数限定或者作为对数或者线性地增长。所得到的结果使我们能够区分七个复杂性类的无限家庭的概念。
英文摘要:
In this paper, based on results of exact learning, test theory, and rough set theory, we study arbitrary infinite families of concepts each of which consists of an infinite set of elements and an infinite set of subsets of this set called concepts. We consider the notion of a problem over a family of concepts that is described by a finite number of elements: for a given concept, we should recognize which of the elements under consideration belong to this concept. As algorithms for problem solving, we consider decision trees of five types: (i) using membership queries, (ii) using equivalence queries, (iii) using both membership and equivalence queries, (iv) using proper equivalence queries, and (v) using both membership and proper equivalence queries. As time complexity, we study the depth of decision trees. In the worst case, with the growth of the number of elements in the problem description, the minimum depth of decision trees of the first type either grows as a logarithm or linearly, and the minimum depth of decision trees of each of the other types either is bounded from above by a constant or grows as a logarithm, or linearly. The obtained results allow us to distinguish seven complexity classes of infinite families of concepts.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。