Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC)

The use of a team of weak learners to learn a dataset has been shown better than the use of one single strong learner. In fact, the idea is so successful that boosting, an algorithm combining several weak learners for supervised learning, has been considered to be one of the best off-the-shelf class...

Full description

Saved in:
Bibliographic Details
Main Authors: RAMANATHAN, Kiruthika, GUAN, Sheng Uei
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2008
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/7394
https://ink.library.smu.edu.sg/context/sis_research/article/8397/viewcontent/978_3_540_75396_4.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-8397
record_format dspace
spelling sg-smu-ink.sis_research-83972022-10-13T07:19:00Z Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC) RAMANATHAN, Kiruthika GUAN, Sheng Uei The use of a team of weak learners to learn a dataset has been shown better than the use of one single strong learner. In fact, the idea is so successful that boosting, an algorithm combining several weak learners for supervised learning, has been considered to be one of the best off-the-shelf classifiers. However, some problems still remain, including determining the optimal number of weak learners and the overfitting of data. In an earlier work, we developed the RPHP algorithm which solves both these problems by using a combination of genetic algorithm, weak learner and pattern distributor. In this paper, we revise the global search component by replacing it with a cluster-based combinatorial optimization. Patterns are clustered according to the output space of the problem, i.e., natural clusters are formed based on patterns belonging to each class. A combinatorial optimization problem is therefore formed, which is solved using evolutionary algorithms. The evolutionary algorithms identify the “easy” and the “difficult” clusters in the system. The removal of the easy patterns then gives way to the focused learning of the more complicated patterns. The problem therefore becomes recursively simpler. Overfitting is overcome by using a set of validation patterns along with a pattern distributor. An algorithm is also proposed to use the pattern distributor to determine the optimal number of recursions and hence the optimal number of weak learners for the problem. Empirical studies show generally good performance when compared to other state-of-the-art methods. 2008-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7394 info:doi/10.1007/978-3-540-75396-4_6 https://ink.library.smu.edu.sg/context/sis_research/article/8397/viewcontent/978_3_540_75396_4.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Artificial Intelligence and Robotics Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Artificial Intelligence and Robotics
Databases and Information Systems
spellingShingle Artificial Intelligence and Robotics
Databases and Information Systems
RAMANATHAN, Kiruthika
GUAN, Sheng Uei
Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC)
description The use of a team of weak learners to learn a dataset has been shown better than the use of one single strong learner. In fact, the idea is so successful that boosting, an algorithm combining several weak learners for supervised learning, has been considered to be one of the best off-the-shelf classifiers. However, some problems still remain, including determining the optimal number of weak learners and the overfitting of data. In an earlier work, we developed the RPHP algorithm which solves both these problems by using a combination of genetic algorithm, weak learner and pattern distributor. In this paper, we revise the global search component by replacing it with a cluster-based combinatorial optimization. Patterns are clustered according to the output space of the problem, i.e., natural clusters are formed based on patterns belonging to each class. A combinatorial optimization problem is therefore formed, which is solved using evolutionary algorithms. The evolutionary algorithms identify the “easy” and the “difficult” clusters in the system. The removal of the easy patterns then gives way to the focused learning of the more complicated patterns. The problem therefore becomes recursively simpler. Overfitting is overcome by using a set of validation patterns along with a pattern distributor. An algorithm is also proposed to use the pattern distributor to determine the optimal number of recursions and hence the optimal number of weak learners for the problem. Empirical studies show generally good performance when compared to other state-of-the-art methods.
format text
author RAMANATHAN, Kiruthika
GUAN, Sheng Uei
author_facet RAMANATHAN, Kiruthika
GUAN, Sheng Uei
author_sort RAMANATHAN, Kiruthika
title Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC)
title_short Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC)
title_full Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC)
title_fullStr Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC)
title_full_unstemmed Enhancing recursive supervised learning using clustering and combinatorial optimization (RSL-CC)
title_sort enhancing recursive supervised learning using clustering and combinatorial optimization (rsl-cc)
publisher Institutional Knowledge at Singapore Management University
publishDate 2008
url https://ink.library.smu.edu.sg/sis_research/7394
https://ink.library.smu.edu.sg/context/sis_research/article/8397/viewcontent/978_3_540_75396_4.pdf
_version_ 1770576330605199360