Decision Trees: Old and New Results

Decision Trees for Classification: a Review and Some New Results

Controlled Flux Results in Stable Decision Trees

This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and tree oscillations between similar concepts decrease learning speed. We introduce a heuristic to tackle this problem and an algorithm that uses this heuristic, and we provide theoretical and experimental backing to justify it. ...

Simplifying Decision Trees by Pruning and Grafting: New Results (Extended Abstract)

This paper presents some empirical results on simplification methods of decision trees induced from data. We observe that those methods exploiting an independent pruning set do not perform uniformly better than the others. Furthermore, a clear defmition of bias towards overpruning and underpraning is exploited in order to interpret empirical data concerning the size of the simplified trees.

Weiszfeld's Method: Old and New Results

In 1937 the 16 years old Hungarian mathematician Endre Weiszfeld devised a method for solving the Fermat-Weber location problem – a problem whose origins can be traced back to the 17th century. This seminal paper of Weiszfeld [51] stirred up an enormous amount of research in the optimization and location communities, and is also being discussed and used till these days. In this paper we review ...

Old and New Results on theTwo - Dimensional

This paper deals with linear and non-linear hydrodynamic stability of the two-dimensional Poiseuille ow. A new numerical approach for the study of linear stability is presented. A numerical study of the transition of the ow to chaos is also presented. Using tools from dynamical system theory, we identify and characterize the di erent solutions of the Navier-Stokes equations at di erent values o...