DocumentCode :
3106468
Title :
Constructing Ensembles for Better Ranking
Author :
Huang, Jin ; Ling, Charles X.
Author_Institution :
Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON
fYear :
2006
fDate :
18-22 Dec. 2006
Firstpage :
902
Lastpage :
906
Abstract :
We propose a novel algorithm, RankDE, to build an ensemble using an extra artificial dataset. RankDE aims at improving the overall ranking performance, which is crucial in many machine learning applications. This algorithm constructs artificial datasets that are diverse with the current training dataset in terms of ranking. We conduct experiments with real-world data sets to compare RankDE with some traditional and state-of-the-art ensembling algorithms of Bagging, Adaboost, DECORATE and Rankboost in terms of ranking. The experiments show that RankDE outperforms Bagging, DECORATE, Adaboost, and Rankboost when limited data is available. When enough training data is available, it is competitive with DECORATE and Adaboost.
Keywords :
learning (artificial intelligence); pattern classification; RankDE; artificial dataset; ensembles construction; machine learning; ranking performance; Application software; Bagging; Boosting; Computer science; Data engineering; Data mining; Information technology; Machine learning; Machine learning algorithms; Training data;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining, 2006. ICDM '06. Sixth International Conference on
Conference_Location :
Hong Kong
ISSN :
1550-4786
Print_ISBN :
0-7695-2701-7
Type :
conf
DOI :
10.1109/ICDM.2006.42
Filename :
4053124
Link To Document :
بازگشت