In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
Therehasbeensurprisinglylittle researchso far that systematicallyinvestigatedthe possibilityof constructinghybrid learningalgorithmsbysimplelocal modificationsto decision tree lea...
Alexander K. Seewald, Johann Petrak, Gerhard Widme...
The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...