Concepts Seeds Gathering and Dataset Updating Algorithm for Handling Concept Drift

Concepts Seeds Gathering and Dataset Updating Algorithm for Handling Concept Drift

Nabil M. Hewahi (Computer Science Department, University of Bahrain, Zallaq, Bahrain) and Ibrahim M. Elbouhissi (Computer Science Department, Islamic University of Gaza Palestine, Gaza City, Israel)
Copyright: © 2015 |Pages: 29
DOI: 10.4018/IJDSST.2015040103


In data mining, the phenomenon of change in data distribution over time is known as concept drift. In this research, the authors introduce a new approach called Concepts Seeds Gathering and Dataset Updating algorithm (CSG-DU) that gives the traditional classification models the ability to adapt and cope with concept drift as time passes. CSG-DU is concerned with discovering new concepts in data stream and aims to increase the classification accuracy using any classification model when changes occur in the underlying concepts. The proposed approach has been tested using synthetic and real datasets. The experiments conducted show that after applying the authors' approach, the classification accuracy increased from low values to high and acceptable ones. Finally, a comparison study between CSG-DU and Set Formation for Delayed Labeling algorithm (SFDL) has been conducted; SFDL is an approach that handles sudden and gradual concept drift. CSG-DU results outperforms SFDL in terms of classification accuracy.
Article Preview

Žliobaitė [45] conducted a survey of concept drift problem. She introduced a taxonomy for adaptive supervised techniques. This taxonomy describes in details the main contributions on adaptive supervised learning techniques. In Žliobaitė's taxonomy, there are two types of contributions introduced:

  • 1.

    Learners with Triggers: Determine how the models or sampling should be changed at a given time.

  • 2.

    Evolving Learners: Find ways to keep the base learner updated with every change happen.

Complete Article List

Search this Journal:
Open Access Articles
Volume 11: 4 Issues (2019): 1 Released, 3 Forthcoming
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing