Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hoang-Anh Ngo

dblp:326/4399 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-7583-753XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 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
1 paper
Data mining · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.612022
Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022
Data mining › clustering
clustering evaluation
0.612022
Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022
Data mining › clustering › online clustering
data stream clustering
0.612022
Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022
Data mining › clustering
online clustering
0.612022
Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking · KDD 2022
YearPublicationVenuePosition
2022 Online Clustering: Algorithms, Evaluation, Metrics, Applications and Benchmarking
abstract
Online 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
KDD2