The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
A new boosting algorithm ADABOOST-R for regression problems is presented and upper bound on the error is obtained. Experimental results to compare ADABOOST-R and other learning alg...
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...