Demo Data from EDBT 2026 / reviewers in the wild / expert
Minh-Huong Le Nguyen
dblp:224/6827
· DBLP profile ↗
5ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0002-5333-6785ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Data mining · 75% Data integration and cleaning · 11% Information retrieval · 11% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
clustering |
0.6 | 1 | 2022 | Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022 |
Data mining › clustering
clustering evaluation |
0.6 | 1 | 2022 | Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022 |
Data mining › clustering › online clustering
data stream clustering |
0.6 | 1 | 2022 | Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022 |
Data mining › clustering
online clustering |
0.6 | 1 | 2022 | Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022 |
Data integration and cleaning
heterogeneous data integration |
0.3 | 1 | 2018 | ConnectionLens: Finding Connections Across Heterogeneous Data Sources · Proc. VLDB Endow. 2018 |
Methods — techniques the papers use, named apart from their topics
keyword search · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Exploring the potentials of online machine learning for predictive maintenance: a case study in the railway industry
Minh-Huong Le Nguyen, Fabien Turgis, Pierre-Emmanuel Fayemi, Albert Bifet |
Appl. Intell. | 1 |
| 2022 | Continuous Health Monitoring of Machinery using Online Clustering on Unlabeled Data StreamsabstractMaintenance is an important support function to ensure the reliability, safety, and availability in the railway. Lately, machine learning has become a major player and allows practitioners to build intricate learning models for machinery maintenance. Commonly, a model is trained on static data and is retrained on new data that exhibit novelties unknown to the model. On the contrary, online machine learning is a learning paradigm that adapts the models to new data, thus enabling adaptive, lifelong learning. Our goal is to leverage online learning on unlabeled data streams to enhance railway machinery maintenance. We propose Continuous Health Monitoring using Online Clustering (CheMoc) as an unsupervised method that learns the health profiles of the systems incrementally, assesses their working condition continuously via an adaptive health score, and works efficiently on streaming data. We evaluate CheMoc on a real-world data set from a national railway company. The results show that CheMoc discovered relevant health clusters, as confirmed by a domain expert, and processed the data of an entire year under two hours using only 600 MB of memory. Minh-Huong Le Nguyen, Fabien Turgis, Pierre-Emmanuel Fayemi, Albert Bifet |
IEEE Big Data | 1 |
| 2022 | Online Clustering: Algorithms, Evaluation, Metrics, Applications and BenchmarkingabstractOnline clustering algorithms play a critical role in data science, especially with the advantages regarding time, memory usage and complexity, while maintaining a high performance compared to traditional clustering methods. This tutorial serves, first, as a survey on online machine learning and, in particular, data stream clustering methods. During this tutorial, state-of-the-art algorithms and the associated core research threads will be presented by identifying different categories based on distance, density grids and hidden statistical models. Clustering validity indices, an important part of the clustering process which are usually neglected or replaced with classification metrics, resulting in misleading interpretation of final results, will also be deeply investigated. Jacob Montiel, Hoang-Anh Ngo, Minh-Huong Le Nguyen, Albert Bifet |
KDD | 3 |
| 2019 | Semi-supervised Learning over Streaming Data using MOAabstractMachine learning algorithms for data streams usually suppose that all data examples available for learning are strictly labeled. Unfortunately, in real-world scenarios, data examples are not always labeled. Semi-supervised learning is a challenging task to learn using labeled and unlabeled data at the same time. It is especially relevant in the context of data streams, where the data is generated in real-time, and the labels may be missing due to various factors (e.g., network delay, errors during the communication between sensors, expensive labeling process, and others). In this paper, we present two novel approaches to handle missing labels for classification learning in data streams, namely cluster-and-label and self-training. We discuss the strengths and weaknesses of each solution to establish a baseline to evaluate semi-supervised learning techniques in data streams. These methods are implemented inside the MOA (Massive Online Analysis) open-source software as an internal benchmark component, to help researchers to run experimental comparisons on semi-supervised learning on data streams easily. Minh-Huong Le Nguyen, Heitor Murilo Gomes, Albert Bifet |
IEEE BigData | 1 |
| 2018 | ConnectionLens: Finding Connections Across Heterogeneous Data SourcesabstractNowadays, journalism is facilitated by the existence of large amounts of publicly available digital data sources. In particular, journalists can do investigative work, which typically consists on keyword-based searches over many heterogeneous, independently produced and dynamic data sources, to obtain useful, interconnecting and traceable information. We propose to demonstrate C onnection L ens , a system based on a novel algorithm for keyword search across heterogeneous data sources. Our demonstration scenarios are based on use cases suggested by journalists from the french journal Le Monde, with whom we collaborate. Camille Chanial, Rédouane Dziri, Helena Galhardas, Julien Leblay, Minh-Huong Le Nguyen, Ioana Manolescu |
Proc. VLDB Endow. | 5 |