This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
teaching:mfe:ia [2019/02/18 12:15] bersini |
teaching:mfe:ia [2019/05/07 11:56] bersini |
||
---|---|---|---|
Line 51: | Line 51: | ||
* Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
+ | |||
===== Développer un programme informatique permettant une analyse statistique en vue de l'évaluation d'un module psychothérapeutique. ===== | ===== Développer un programme informatique permettant une analyse statistique en vue de l'évaluation d'un module psychothérapeutique. ===== | ||
Line 57: | Line 58: | ||
* Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
+ | |||
===== Développer des solutions de text mining pour la société Procter & Gamble ===== | ===== Développer des solutions de text mining pour la société Procter & Gamble ===== | ||
Line 63: | Line 65: | ||
* Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
+ | |||
+ | ===== Le data mining en tant qu’outil d’aide à la gestion active d’actifs cotés ===== | ||
+ | |||
+ | L’idée de ce mémoire serait d’avoir un travail en plusieurs parties dont notamment : | ||
+ | • une partie théorique qui reprendrait les fondamentaux du data mining, | ||
+ | • un screening, une présentation et comparaison des outils existants utilisés dans le cadre de la gestion d’actifs cotés, | ||
+ | • une partie pratique destinée à construire un data set et à le modéliser. | ||
+ | |||
+ | |||
+ | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
+ | |||
+ | |||
+ | ===== Speed-up Techniques for Shortest Path Problems ===== | ||
+ | |||
+ | |||
+ | The shortest path problem is one of the most important in combinatorial optimization and has multiple real-world applications. | ||
+ | The well-known Dijkstra algorithm solves the shortest path problem in any weighted graph with non-negative weights. However, with the recent increase of the amount of data, we feel the need to drastically increase the execution time of the algorithm. | ||
+ | In the latest years, we observe the emergence of a lot of new speed-up techniques; among them there are: heuristic search, bidirectional search, landmarks, reaches, short-cuts and contractions. The efficiency of these techniques heavily depends on the topology of the graph. Moreover, graphs with more complex structures (as user-adapted graphs) do not support some of these techniques, at least as they are currently presented. | ||
+ | From these observations, several questions arise, among them we propose: | ||
+ | Which optimization methods are the most efficient depending on the graph topology? | ||
+ | How can we adapt these techniques to more complex graph structures? | ||
+ | Other research questions in this topic can be proposed and discussed. | ||
+ | These questions can be studied from both theoretical and empirical approach. | ||
+ | |||
+ | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
+ | |||
+ | ===== Développer des solutions de data mining pour la société BMW Group Belux ===== | ||
+ | |||
+ | Ce mémoire se fera en collaboration avec des responsables marketing et techniques de cette société. | ||
+ | Les sujets pourraient couvrir tout ce qui concerne les data, tant les data dites de campagne, communication, que celles liées à la production ou aux véhicules connectés. | ||
+ | * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]] | ||
+ | |||
===== Transposition en logique floue des réseaux de neurones récurrents de type GRU ===== | ===== Transposition en logique floue des réseaux de neurones récurrents de type GRU ===== |