Incremental Decision Tree based on order statistics

Christophe Salperwyck 1, 2 Vincent Lemaire 1
2 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00758003
Contributor : Christophe Salperwyck <>
Submitted on : Tuesday, November 27, 2012 - 6:59:05 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Thursday, February 28, 2013 - 3:46:21 AM

File

AIL_V1.4_submitted-23-07-2012....
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00758003, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

398

Files downloads

379