Differences

This shows you the differences between two versions of the page.

--- students:phd_mlws [2017/05/20 21:08] – [Objectives] blay
+++ students:phd_mlws [2017/05/23 20:21] – [Machine Learning Workflow System] blay
@@ Line 1: / Line 1: @@
 ====== Machine Learning Workflow System ======
-This subject is proposed as part of the [[http://rockflows.i3s.unice.fr/|ROCKFlows]] project involving the following researchers: [[http://mireilleblayfornarino.i3s.unice.fr|Mireille Blay-Fornarino]], [[http://www.i3s.unice.fr/~mosser/start|Sébastien Mosser]] and [[http://www.i3s.unice.fr/~precioso/|Frédéric Precioso]].
+This subject is proposed as part of the [[http://rockflows.i3s.unice.fr/|ROCKFlows]] project.
 ===== 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, the “winner-take-all” approach should not lead to neglect some algorithms that, while uncompetitive on average, may offer excellent performances on particular problem instances. In 1976, Rice characterized this as the "algorithm selection problem" (Rice, 1976).