Machine Learning and Artificial Intelligence

Figure : Sports sciences through data sciences (Louvain-la-Neuve Running Heatmap)

ICTEAM research activities in this field are conducted by seven primary investigators and about fourty researchers. There are two main domains of activity : Machine Learning and Constraint Programming.

Principal Investigators :

Pierre-Antoine Absil, Jean-Charles Delvenne, Yves Deville, Pierre Dupont, John Lee, Siegfried Nijssen, Marco Saerens, Pierre Schaus, Michel Verleysen, Vincent Wertz

Research Labs :

Machine Learning Group, Constraint Group

Research areas :

The research carried out by the UCL Machine Learning Group (MLG) covers both fundamental and applied aspects of machine learning.

Machine learning aims at mining large collection of data and at building models to predict future data. This multidisciplinary field has links to statistics, signal processing, information theory and optimization. It also covers a wide range of applications such as biomedical data analysis, image and video analysis, time series prediction, graph mining, natural language processing, ...

The group specifically addresses the following topics:

  • High-dimensional, functional and non-linear data analysis
  • Feature and model selection
  • Data visualization and manifold learning
  • Bayesian learning
  • Biomedical signal processing and analysis, including ECG, EEG, and respiratory signal analysis, and medical image filtering
  • High-throughput biological data analysis, including microarray data analysis and next-generation sequencing
  • Temporal series prediction, including electrical workload prediction, financial time-series forecasting, networking measurement prediction
  • Automata and Grammar induction with application to software system modeling
  • Structured data analysis, graph mining and collaborative filtering

The UCL Machine Learning Group is organizing, on a yearly basis since 1993, the European Symposium on Artificial Neural Networks - Advances in Computational Intelligence and Learning

Constraint Programming (CP) is a powerful paradigm for modelling and solving complex combinatorial (optimization) problems. It integrates techniques from artificial intelligence, computer science, operational research and optimization. CP separates the modelling of the problem from the search for solutions. It offers high level modelling languages based on constraints. CP proposes two complementary search mechanisms. Standard CP is based on systematic tree search coupled with pruning techniques to remove infeasable solutions. Constraint-Based Local Search (CBLS) allows heuristic search based on the exploration of neighborhoods. The Constraint Group is mainly interested in consistency techniques, integration of CP and CBLS, graph matching, routing problems, applications in networking, ...

Most recent publications

Below are listed the 10 most recent journal articles and conference papers produced in this research area. You also can access all publications by following this link : see all publications.

Journal Articles

1. Kesiman, Made Windu Antara; Valy, Dona; Burie, Jean-christophe; Paulus, Erick; Sunarya, I. Made Gede; Hadi, Setiawan; Sok, Kim Heng; Ogier, Jean-Marc. Southeast Asian palm leaf manuscript images - a review of handwritten text line segmentation methods and new challenges. In: Journal of Electronic Imaging, Vol. 26, no.1, p. 1-15 (2017). doi:10.1117/1.JEI.26.1.011011.

2. Cambier, Léopold; Absil, Pierre-Antoine. Robust low-rank matrix completion by Riemannian optimization. In: SIAM Journal on Scientific Computing, Vol. 38, no. 5, p. S440-S460 (2016). doi:10.1137/15M1025153.

3. Keim, Daniel A.; Munzner, Tamara; Rossi, Fabrice; Verleysen, Michel. Bridging Information Visualization with Machine Learning. In: Dagstuhl Reports, Vol. 5, no. 3, p. 1-27 (2015). doi:10.4230/DagRep.5.3.1.

4. Frénay, Benoît; Verleysen, Michel. Reinforced Extreme Learning Machines for Fast Robust Regression in the Presence of Outliers. In: IEEE Transactions on Cybernetics, no. 99, p. 13 (17/12/2015). doi:10.1109/TCYB.2015.2504404.

5. De Visscher, Ruben; Delouille, Véronique; Dupont, Pierre; Deledalle, Charles-Alban. Supervised classification of solar features using prior information. In: Journal of Space Weather and Space Climate, Vol. 5, no.A34, p. 1-12 (2015). doi:10.1051/swsc/2015033.

6. Paul, Jérôme; D'Ambrosio, Roberto; Dupont, Pierre. Kernel methods for heterogeneous feature selection. In: Neurocomputing, Vol. 169, p. 187-195 (2015). doi:10.1016/j.neucom.2014.12.098 (Accepté/Sous presse).

7. Boumal, Nicolas; Absil, Pierre-Antoine. Low-rank matrix completion via preconditioned optimization on the Grassmann manifold. In: Linear Algebra and Its Applications, Vol. 475, p. 200-239 (June 2015). doi:10.1016/j.laa.2015.02.027.

8. Paul, Jérôme; Dupont, Pierre. Inferring statistically significant features from random forests. In: Neurocomputing, Vol. 150, no.part B, p. 471–480 (20 February 2015). doi:10.1016/j.neucom.2014.07.067.

9. Frénay, Benoît; Verleysen, Michel. Classification in the Presence of Label Noise: a Survey. In: IEEE Transactions on Neural Networks and Learning Systems, Vol. 25, no. 5, p. 845-869 (10/04/2015). doi:10.1109/TNNLS.2013.2292894.

10. Peluffo Ordoñez, Diego Hernan; Lee, John Aldo; Verleysen, Michel. Short review of dimensionality reduction methods based on stochastic neighbour embedding. In: Advances in Self-Organizing Maps and Learning Vector Quantization, Vol. 295, no.part I, p. 65-74 (2014). doi:10.1007/978-3-319-07695-9_6.

Conference Papers

1. Valy, Dona; Verleysen, Michel; Chhun, Sophea; Burie, Jean-Christophe. A New Khmer Palm Leaf Manuscript Dataset for Document Analysis and Recognition - SleukRith Set.

2. Valy, Dona; Verleysen, Michel; SOK, Kimheng. Line Segmentation for Grayscale Text Images of Khmer Palm Leaf Manuscripts.

3. Dong, Shuyu; Thanou, Dorina; Absil, Pierre-Antoine; Frossard, Pascal. Learning sparse models of diffusive graph signals. In: Computational Intelligence and Machine learning, 2017, 978-287587039-1, p. 251-256.

4. Branders, Vincent; Schaus, Pierre; Dupont, Pierre. Mining a sub-matrix of maximal sum. In: Proceedings of the 6th International Workshop on New Frontiers in Mining Complex Patterns in conjunction with ECML-PKDD 2017.

5. Renard, Emilie; Absil, Pierre-Antoine. Comparison of location-scale and matrix factorization batch effect removal methods on gene expression datasets. In: 2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 2017, 978-1-5090-3050-7, p. 1511-1518.

6. Gousenbourger, Pierre-Yves; Jacques, Laurent; Absil, Pierre-Antoine. Fast Method to Fit a C1 Piecewise-Bézier Function to Manifold-Valued Data Points: How Suboptimal is the Curve Obtained on the Sphere S2?. In: Geometric Science of Information. GSI 2017. Lecture Notes in Computer Science, Springer International, 2017, 978-3-319-68445-1. doi:10.1007/978-3-319-68445-1_69.

7. Gousenbourger, Pierre-Yves; Massart, Estelle; Musolas, Antoni; Absil, Pierre-Antoine; Hendrickx, Julien; Jacques, Laurent; Marzouk, Youssef. Piecewise-Bezier C1 smoothing on manifolds with application to wind field estimation. In: 25th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN 2017), 2017, 978-287587039-1, 305-3010.

8. Valy, Dona; Verleysen, Michel; Sok, Kimheng. Line Segmentation Approach for Ancient Palm Leaf Manuscripts using Competitive Learning Algorithm.

9. Billiet, Lieven; Hunyadi, Borbala; Matic, Vladimir; Van Huffel, Sabine; Verleysen, Michel. Single trial classification in Mobile BCI - A multiway Kernel approach. In: Proceedings of BIOSIGNALS 2015, SciTePress, 2015, 978-989-758-069-7, 5-11. doi:10.5220/0005163000050011; 10.5220/0005163000050011.

10. Degeest, Alexandra; Verleysen, Michel; Frénay, Benoît. Feature Ranking in Changing Environments where New Features are Introduced. In: Proceedings of IJCNN 2015, IEEE, 2015, 978-1-4799-1959-8/15, 1-8. doi:10.1109/IJCNN.2015.7280533; 10.1109/IJCNN.2015.7280533.