DocumentCode
3124328
Title
Heuristic Updatable Weighted Random Subspaces for Non-stationary Environments
Author
Hoens, T. Ryan ; Chawla, Nitesh V. ; Polikar, Robi
Author_Institution
Dept. of Comput. Sci. & Eng., Univ. of Notre Dame, Notre Dame, IN, USA
fYear
2011
fDate
11-14 Dec. 2011
Firstpage
241
Lastpage
250
Abstract
Learning in non-stationary environments is an increasingly important problem in a wide variety of real-world applications. In non-stationary environments data arrives incrementally, however the underlying generating function may change over time. While there is a variety of research into such environments, the research mainly consists of detecting concept drift (and then relearning the model), or developing classifiers which adapt to drift incrementally. We introduce Heuristic Up datable Weighted Random Subspaces (HUWRS), a new technique based on the Random Subspace Method that detects drift in individual features via the use of Hellinger distance, a distributional divergence metric. Through the use of subspaces, HUWRS allows for a more fine-grained approach to dealing with concept drift which is robust to feature drift even without class labels. We then compare our approach to two state of the art algorithms, concluding that for a wide range of datasets and window sizes HUWRS outperforms the other methods.
Keywords
data mining; learning (artificial intelligence); random processes; Hellinger distance; distributional divergence matrix; fine-grained approach; heuristic updatable weighted random subspaces; nonstationary learning environments; Accuracy; Classification algorithms; Context; Data mining; Feature extraction; Testing; Training; Concept Drift; Hellinger Distance; Non-stationary learning; Random Subspaces;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining (ICDM), 2011 IEEE 11th International Conference on
Conference_Location
Vancouver,BC
ISSN
1550-4786
Print_ISBN
978-1-4577-2075-8
Type
conf
DOI
10.1109/ICDM.2011.75
Filename
6137228
Link To Document