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

Periasamy Vivekanandan and Raju Nedunchezhian
Additional contact information
Periasamy Vivekanandan: Park College of Engineering and Technology, India
Raju Nedunchezhian: Kalaignar Karunanidhi Institute of Technology, India

International Journal of Applied Evolutionary Computation (IJAEC), 2011, vol. 2, issue 1, 49-58

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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jaec.2011010104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jaec00:v:2:y:2011:i:1:p:49-58

Access Statistics for this article

International Journal of Applied Evolutionary Computation (IJAEC) is currently edited by Sukhpal Singh Gill

More articles in International Journal of Applied Evolutionary Computation (IJAEC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().