Incremental Decision Tree based on order statistics - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Incremental Decision Tree based on order statistics

(1, 2) , (1)
Vincent Lemaire
  • Function : Author
  • PersonId : 933281


New application domains generate data which are not persistent anymore but volatile: network management, web profile modeling... These data arrive quickly, massively and are visible just once. Thus they necessarily have to be learnt according to their arrival orders. For classification problems online decision trees are known to perform well and are widely used on streaming data. In this paper, we propose a new decision tree method based on order statistics. The construction of an online tree usually needs summaries in the leaves. Our solution uses bounded error quantiles summaries. A robust and performing discretization or grouping method uses these summaries to provide, at the same time, a criterion to find the best split and better density estimations. This estimation is then used to build a na¨ıve Bayes classifier in the leaves to improve the prediction in the early learning stage.
Fichier principal
Vignette du fichier
AIL_V1.4_submitted-23-07-2012.pdf (258.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00758003 , version 1 (27-11-2012)


  • HAL Id : hal-00758003 , version 1


Christophe Salperwyck, Vincent Lemaire. Incremental Decision Tree based on order statistics. Workshop on Active and Incremental Learning (without proceedings), Vincent Lemaire, Pascal Cuxac and Jean-Charles Lamirel, 2012, Montpellier, France. ⟨hal-00758003⟩
188 View
329 Download


Gmail Facebook Twitter LinkedIn More