In this paper, we consider classes of decision tables with many-valued decisions closed under operations of removal of columns, changing of decisions, permutation of columns, and duplication of columns. We study relationships among three parameters of these tables: the complexity of a decision table (if we consider the depth of decision trees, then the complexity of a decision table is the number of columns in it), the minimum complexity of a deterministic decision tree, and the minimum complexity of a nondeterministic decision tree. We consider rough classification of functions characterizing relationships and enumerate all possible seven types of the relationships.
翻译：在本文中，我们考虑了决策表的几个有限决策类，其中决策表所包含的决策值是由列的删除，决策的更改，列的排列和列的复制所构成的。我们研究了这些表中的三个参数的关系：决策表的复杂性（如果我们考虑决策树的深度，则决策表的复杂性是其中的列数），确定性决策树的最小复杂性和非确定性决策树的最小复杂性。我们对描述关系的分类函数进行了粗略分类，并枚举了所有可能的七种关系类型。
相关内容
微信扫码咨询专知VIP会员