论文信息 - Restricted Linear Information Systems

Restricted Linear Information Systems

In the paper a class of infinite information systems is described. For decision tables over each such information system there exist low upper bounds on minimal complexity of decision trees and polynomial algorithms of decision tree optimization for various complexity measures.

Mikhail Ju. Moshkov

[1] Igor Chikalov. On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes , 2000, Rough Sets and Current Trends in Computing.

[2] Andrzej Skowron,et al. Rough-Fuzzy Hybridization: A New Trend in Decision Making , 1999 .

[3] Igor Chikalov,et al. On Algorithm for Constructing of Decision Trees with Minimal Depth , 2000, Fundam. Informaticae.

[4] Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[5] Igor Chikalov,et al. Bounds on Average Weighted Depth of Decision Trees , 1997, Fundam. Informaticae.

[6] Sinh Hoa Nguyen,et al. On Finding Optimal Discretizations for Two Attributes , 1998, Rough Sets and Current Trends in Computing.

[7] Andrzej Skowron,et al. Proceedings of the First International Conference on Rough Sets and Current Trends in Computing , 1998 .

[8] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.