Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Fast Boosting based Incremental Genetic Algorithm for Mining Classification Rules in Large Datasets


Affiliations
1 Department of CSE, Park College of Engineering and Technology, Coimbatore, India
2 Department of CSE, Kalaignar Karunanidhi Institute of Technology, Coimbatore, India
     

   Subscribe/Renew Journal


Genetic algorithm is a search technique purely based on natural evolution process.  It is widely used by the data mining community for classification rule discovery in complex domains. During the learning process it makes several passes over the data set for determining the accuracy of the potential rules. Due to this characteristic it becomes an extremely I/O intensive slow process. It is particularly difficult to apply GA when the training data set becomes too large and not fully available. An   incremental Genetic algorithm based on boosting phenomenon is proposed in this paper which constructs a weak ensemble of classifiers in a fast incremental manner and thus tries to reduce the learning cost considerably.

Keywords

Classification, Incremental Learning, Genetic Algorithm (Ga), Scalability, Boosting.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 368

PDF Views: 2




  • A Fast Boosting based Incremental Genetic Algorithm for Mining Classification Rules in Large Datasets

Abstract Views: 368  |  PDF Views: 2

Authors

P. Vivekanandan
Department of CSE, Park College of Engineering and Technology, Coimbatore, India
R. Nedunchezhian
Department of CSE, Kalaignar Karunanidhi Institute of Technology, Coimbatore, India

Abstract


Genetic algorithm is a search technique purely based on natural evolution process.  It is widely used by the data mining community for classification rule discovery in complex domains. During the learning process it makes several passes over the data set for determining the accuracy of the potential rules. Due to this characteristic it becomes an extremely I/O intensive slow process. It is particularly difficult to apply GA when the training data set becomes too large and not fully available. An   incremental Genetic algorithm based on boosting phenomenon is proposed in this paper which constructs a weak ensemble of classifiers in a fast incremental manner and thus tries to reduce the learning cost considerably.

Keywords


Classification, Incremental Learning, Genetic Algorithm (Ga), Scalability, Boosting.