Nouveaux algorithmes d'apprentissage pour classificateurs de type SCM

Authors: Choquette, Philippe
Advisor: Marchand, MarioLaviolette, François
Abstract: In the supervised machine learning field, one of the available tools for binary classification is the Set Covering Machine (SCM). Quickly built and generally having high performance, it's however not proven that they always give optimal results. There is still, to date, a margin for improvement. This study presents two new ways of building SCM. Theses algorithms are described, explained and their performance is analyzed. The first way is to minimize an approximated bound on the risk with a branch-and-bound. The second is using bagging. The new classifiers had the same test-set performance than the original SCM. We discovered that the latter are either already optimal according to the branch-and-bound criterion or having the same performance as the optimal SCM.
Document Type: Mémoire de maîtrise
Issue Date: 2007
Open Access Date: 13 April 2018
Grantor: Université Laval
Collection:Thèses et mémoires

Files in this item:
Description SizeFormat 
24840.pdfTexte920.22 kBAdobe PDFThumbnail
All documents in CorpusUL are protected by Copyright Act of Canada.