Possibilistic Very Fast Decision Tree for Uncertain Data Streams

Author(s):  
Mohamed Hamroun ◽  
Mohamed Salah Gouider
2014 ◽  
Vol 46 (16) ◽  
pp. 3032-3050 ◽  
Author(s):  
Chunquan Liang ◽  
Yang Zhang ◽  
Peng Shi ◽  
Zhengguo Hu

Author(s):  
Eva García-Martín ◽  
Niklas Lavesson ◽  
Håkan Grahn ◽  
Emiliano Casalicchio ◽  
Veselka Boeva

AbstractRecently machine learning researchers are designing algorithms that can run in embedded and mobile devices, which introduces additional constraints compared to traditional algorithm design approaches. One of these constraints is energy consumption, which directly translates to battery capacity for these devices. Streaming algorithms, such as the Very Fast Decision Tree (VFDT), are designed to run in such devices due to their high velocity and low memory requirements. However, they have not been designed with an energy efficiency focus. This paper addresses this challenge by presenting the nmin adaptation method, which reduces the energy consumption of the VFDT algorithm with only minor effects on accuracy. nmin adaptation allows the algorithm to grow faster in those branches where there is more confidence to create a split, and delays the split on the less confident branches. This removes unnecessary computations related to checking for splits but maintains similar levels of accuracy. We have conducted extensive experiments on 29 public datasets, showing that the VFDT with nmin adaptation consumes up to 31% less energy than the original VFDT, and up to 96% less energy than the CVFDT (VFDT adapted for concept drift scenarios), trading off up to 1.7 percent of accuracy.


2012 ◽  
Vol 184 (1) ◽  
pp. 196-214 ◽  
Author(s):  
Xiaofeng Ding ◽  
Xiang Lian ◽  
Lei Chen ◽  
Hai Jin

2013 ◽  
Vol 25 (8) ◽  
pp. 1814-1829 ◽  
Author(s):  
Tao Chen ◽  
Lei Chen ◽  
M.Tamer Ozsu ◽  
Nong Xiao

Sign in / Sign up

Export Citation Format

Share Document