We develop a theory for learning scenarios where multiple learners co-exist but there are mutual compatibility constraints on their outcomes. This is natural in cognitive learning...
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
The growing use of information visualization tools and data mining algorithms stems from two separate lines of research. Information visualization researchers believe in the impor...
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
The present work is dedicated to the study of modes of data-presentation in the range between text and informant within the framework of inductive inference. In this study, the le...
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
While there has been a significant amount of theoretical and empirical research on the multiple-instance learning model, most of this research is for concept learning. However, f...