We describe a novel class of distributions, called Mondrian processes, which can be interpreted as probability distributions over kd-tree data structures. Mondrian processes are m...
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
An estimation of the generalization performance of classifier is one of most important problems in pattern clasification and neural network training theory. In this paper we estima...
Abstract. Subsystem based generalizations of rough set approximations are investigated. Instead of using an equivalence relation, an arbitrary binary relation is used to construct ...