DocumentCode
3310416
Title
Using parallel partitioning strategy to create diversity for ensemble learning
Author
Wen, Yi-Min ; Wang, Yao-Nan ; Liu, Wen-Hua
Author_Institution
Coll. of Electr. & Inf. Eng., Hunan Univ., Changsha, China
fYear
2009
fDate
8-11 Aug. 2009
Firstpage
585
Lastpage
589
Abstract
Divide-and-conquer principle is a fashionable strategy to handle large-scale classification problems. However, many works have revealed that generalization ability is decreased by partitioning training set in most cases, because partitioning training set can lead to losing classification information. Aiming to handle this problem, an ensemble learning algorithm was proposed. It used many sets of parallel hyperplanes to partition training set on which each base classifier was trained by the SVM modular network algorithm and all these base classifiers were combined by majority voting strategy when testing. The experimental results on 4 classification problems illustrate that ensemble learning can effectively reduce the descent of generalization ability for the reason of increasing classifier´s diversity.
Keywords
divide and conquer methods; learning (artificial intelligence); parallel algorithms; pattern classification; support vector machines; divide-and-conquer principle; ensemble learning; large-scale classification problem; modular network algorithm; parallel hyperplane; parallel partitioning strategy; support vector machine; Clustering algorithms; Industrial training; Large-scale systems; Machine learning; Machine learning algorithms; Partitioning algorithms; Support vector machine classification; Support vector machines; Testing; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-4519-6
Electronic_ISBN
978-1-4244-4520-2
Type
conf
DOI
10.1109/ICCSIT.2009.5234490
Filename
5234490
Link To Document