students:phd_mlws
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
students:phd_mlws [2017/05/20 21:00] – [Objectives] blay | students:phd_mlws [2017/05/28 17:37] – [Bibliographie] blay | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Machine Learning Workflow System ====== | ====== Machine Learning Workflow System ====== | ||
- | This subject is proposed as part of the [[http:// | + | This subject is proposed as part of the [[http:// |
===== Context ===== | ===== Context ===== | ||
For many years, Machine Learning research has been focusing on designing new algorithms for solving similar kinds of problem instances (Kotthoff, 2016). However, Researchers have long ago recognized that a single algorithm will not give the best performance across all problem instances, e.g. the No-Free-Lunch-Theorem (Wolpert, 1996) states that the best classifier will not be the same on every dataset. Consequently, | For many years, Machine Learning research has been focusing on designing new algorithms for solving similar kinds of problem instances (Kotthoff, 2016). However, Researchers have long ago recognized that a single algorithm will not give the best performance across all problem instances, e.g. the No-Free-Lunch-Theorem (Wolpert, 1996) states that the best classifier will not be the same on every dataset. Consequently, | ||
Line 26: | Line 26: | ||
To meet these challenges, attention should be paid to the following aspects: | To meet these challenges, attention should be paid to the following aspects: | ||
* //Handling Variabilities: | * //Handling Variabilities: | ||
- | *// Architecture of the portfolio : // (1) automatically manage | + | *// Architecture of the portfolio : // automatically manage |
- | * //Handling Scalability of Portfolio: | + | * //Handling Scalability of the Portfolio: //Selecting |
- | * //Ensuring global consistency// | + | * //Ensuring global consistency// |
- | We have a two-year experience on this subject which has enabled us to (I) eliminate some approaches (e.g. modeling knowledge as a system of constraints because it generates on our current basis more than 6 billion constraints), | + | We have a two-year experience on this subject which has enabled us to (I) eliminate some approaches (e.g. modeling knowledge as a system of constraints because it generates on our current basis more than 6 billion constraints), |
The thesis must investigate the research around the selection of algorithms, considering the automatic composition of workflows and supporting dynamic evolutions. It is therefore a thesis in software engineering research but to address one of the current most central problems in machine learning. | The thesis must investigate the research around the selection of algorithms, considering the automatic composition of workflows and supporting dynamic evolutions. It is therefore a thesis in software engineering research but to address one of the current most central problems in machine learning. | ||
Line 66: | Line 66: | ||
Rice JR (1976) The Algorithm Selection Problem. Adv Comput 15: | Rice JR (1976) The Algorithm Selection Problem. Adv Comput 15: | ||
+ | |||
+ | Martin Salvador M, Budka M, Gabrys B (2016) Towards automatic composition of multicomponent predictive systems. Lect Notes Comput Sci (including Subser Lect Notes Artif Intell Lect Notes Bioinformatics). doi: 10.1007/ | ||
Wolpert D (1996) The lack of a priori distinctions between learning algorithms. Neural Computation 8(7): | Wolpert D (1996) The lack of a priori distinctions between learning algorithms. Neural Computation 8(7): | ||
students/phd_mlws.txt · Last modified: 2017/05/28 18:03 by blay