Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
In the demonstration, we will present the concepts and an implementation of an inductive database ? as proposed by Imielinski and Mannila ? in the relational model. The goal is to...
Abstract. In content-based image retrieval (CBIR) and image screening, it is often desirable to locate the regions of interest (ROI) in the images automatically. This can be accomp...
Yu-Feng Li, James T. Kwok, Ivor W. Tsang, Zhi-Hua ...
Abstract. Dialectometry produces aggregate distance matrices in which a distance is specified for each pair of sites. By projecting groups obtained by clustering onto geography on...
John Nerbonne, Peter Kleiweg, Wilbert Heeringa, Fr...
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...