We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourceforge.net), a freely available source code, and therefore can be reproduced. The goal is an independent comparison of learning methods in the framework of SDP. 1 What is stochastic dynamic programming (SDP) ? We here very roughl...

The main goal of this paper is to describe a new pruning method for solving decision trees and game trees. The pruning method for decision trees suggests a slight variant of decision trees that we call scenario trees. In scenario trees, we do not need a conditional probability for each edge emanating from a chance node. Instead, we require a joint probability for each path from the root node to...

In this paper, we study arbitrary infinite binary information systems each of which consists an set elements and two-valued non-constant functions (attributes) defined on the elements. We consider notion a problem over system, is described by finite number attributes: for given element, should determine values these attributes. As algorithms solving, decision trees that use attributes from cons...

Rough se theory(RST) has two formats, abstract and table formats. In this article, abstract format is hardly touched. The table format, by definition, is a theory of extensional relational databases. However, their fundamental goals are very different. RST has focused on data analysis and mining, while database has focused on data processing. In RST, a relation, which is also known as informati...