Demo Data from VLDB 2026 / reviewers in the wild / expert
Ngoc Dang Nguyen
dblp:333/0601
· DBLP profile ↗
7ranked-venue papers
3as first author
7since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 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.
| Artificial intelligence
4 papers |
Information extraction and text analysis · 55% Efficient and distributed learning · 16% Optimization for machine learning · 14% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
named entity recognition |
1.9 | 3 | 2023 | Low-Resource Named Entity Recognition: Can One-vs-All AUC Maximization Help? · ICDM 2023 AUC Maximization for Low-Resource Named Entity Recognition · AAAI 2023 Hardness-guided domain adaptation to recognise biomedical named entities under low-resource scenarios · EMNLP 2022 |
Machine learning › Optimization for machine learning › optimization › metric optimization
AUC maximization |
1.3 | 2 | 2023 | Low-Resource Named Entity Recognition: Can One-vs-All AUC Maximization Help? · ICDM 2023 AUC Maximization for Low-Resource Named Entity Recognition · AAAI 2023 |
Natural language and speech › Information extraction and text analysis › named entity recognition
low-resource named entity recognition |
1.3 | 2 | 2023 | Low-Resource Named Entity Recognition: Can One-vs-All AUC Maximization Help? · ICDM 2023 AUC Maximization for Low-Resource Named Entity Recognition · AAAI 2023 |
Machine learning › Efficient and distributed learning
active learning |
0.8 | 1 | 2024 | Harnessing the Power of Beta Scoring in Deep Active Learning for Multi-Label Text Classification · AAAI 2024 |
Machine learning › Efficient and distributed learning › active learning
deep active learning |
0.8 | 1 | 2024 | Harnessing the Power of Beta Scoring in Deep Active Learning for Multi-Label Text Classification · AAAI 2024 |
Natural language and speech › Information extraction and text analysis › text classification
multi-label text classification |
0.8 | 1 | 2024 | Harnessing the Power of Beta Scoring in Deep Active Learning for Multi-Label Text Classification · AAAI 2024 |
Natural language and speech › Information extraction and text analysis
text classification |
0.8 | 1 | 2024 | Harnessing the Power of Beta Scoring in Deep Active Learning for Multi-Label Text Classification · AAAI 2024 |
Machine learning › Learning paradigms
class imbalance |
0.7 | 1 | 2023 | AUC Maximization for Low-Resource Named Entity Recognition · AAAI 2023 |
Natural language and speech › Information extraction and text analysis › named entity recognition
biomedical named entity recognition |
0.6 | 1 | 2022 | Hardness-guided domain adaptation to recognise biomedical named entities under low-resource scenarios · EMNLP 2022 |
Machine learning › Transfer learning and domain adaptation
domain adaptation |
0.6 | 1 | 2022 | Hardness-guided domain adaptation to recognise biomedical named entities under low-resource scenarios · EMNLP 2022 |
Machine learning › Deep learning architectures and training › sequence modeling
neural sequence labeling |
0.2 | 1 | 2023 | AUC Maximization for Low-Resource Named Entity Recognition · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
AUC maximization · 1.3expected loss reduction · 0.8beta scoring rules · 0.8one-vs-all learning · 0.7meta-learning · 0.7cross-entropy · 0.7conditional random field · 0.7token-level classification · 0.6hardness-guided domain adaptation · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Harnessing the Power of Beta Scoring in Deep Active Learning for Multi-Label Text ClassificationabstractWithin the scope of natural language processing, the domain of multi-label text classification is uniquely challenging due to its expansive and uneven label distribution. The complexity deepens due to the demand for an extensive set of annotated data for training an advanced deep learning model, especially in specialized fields where the labeling task can be labor-intensive and often requires domain-specific knowledge. Addressing these challenges, our study introduces a novel deep active learning strategy, capitalizing on the Beta family of proper scoring rules within the Expected Loss Reduction framework. It computes the expected increase in scores using the Beta Scoring Rules, which are then transformed into sample vector representations. These vector representations guide the diverse selection of informative sample, directly linking this process to the model's expected proper score. Comprehensive evaluations across both synthetic and real datasets reveal our method's capability to often outperform established acquisition techniques in multi-label text classification, presenting encouraging outcomes across various architectural and dataset scenarios. Ngoc Dang Nguyen, Lan Du 0002, Wray L. Buntine |
AAAI | 2 |
| 2024 | How Can I Improve? Using GPT to Highlight the Desired and Undesired Parts of Open-ended Responses
Jionghao Lin, Eason Chen, Zifei FeiFei Han, Ashish Gurung, Danielle R. Thomas, Ngoc Dang Nguyen, Kenneth R. Koedinger |
EDM | 7 |
| 2024 | VN-SLU: A Vietnamese Spoken Language Understanding Dataset
Tuyen Tran, Khanh Le, Ngoc Dang Nguyen, Huyen Ngo, Woomyoung Park, Thi Thu Trang Nguyen |
INTERSPEECH | 3 |
| 2023 | AUC Maximization for Low-Resource Named Entity RecognitionabstractCurrent work in named entity recognition (NER) uses either cross entropy (CE) or conditional random fields (CRF) as the objective/loss functions to optimize the underlying NER model. Both of these traditional objective functions for the NER problem generally produce adequate performance when the data distribution is balanced and there are sufficient annotated training examples. But since NER is inherently an imbalanced tagging problem, the model performance under the low-resource settings could suffer using these standard objective functions. Based on recent advances in area under the ROC curve (AUC) maximization, we propose to optimize the NER model by maximizing the AUC score. We give evidence that by simply combining two binary-classifiers that maximize the AUC score, significant performance improvement over traditional loss functions is achieved under low-resource NER settings. We also conduct extensive experiments to demonstrate the advantages of our method under the low-resource and highly-imbalanced data distribution settings. To the best of our knowledge, this is the first work that brings AUC maximization to the NER setting. Furthermore, we show that our method is agnostic to different types of NER embeddings, models and domains. The code of this work is available at https://github.com/dngu0061/NER-AUC-2T. Ngoc Dang Nguyen, Lan Du 0002, Wray L. Buntine, Richard Beare, Changyou Chen |
AAAI | 1 |
| 2023 | Robust Educational Dialogue Act Classifiers with Low-Resource and Imbalanced Datasets
Jionghao Lin, Ngoc Dang Nguyen, David Lang, Lan Du 0002, Wray L. Buntine, Richard Beare, Guanliang Chen, Dragan Gasevic |
AIED | 3 |
| 2023 | Low-Resource Named Entity Recognition: Can One-vs-All AUC Maximization Help?abstractNamed entity recognition (NER), a task that identifies and categorizes named entities such as persons or organizations from text, is traditionally framed as a multi-class classification problem. However, this approach often overlooks the issues of imbalanced label distributions, particularly in low-resource settings, which is common in certain NER contexts, like biomedical NER (bioNER). To address these issues, we propose an innovative reformulation of the multi-class problem as a one-vs-all (OVA) learning problem and introduce a loss function based on the area under the receiver operating characteristic curve (AUC). To enhance the efficiency of our OVA-based approach, we propose two training strategies: one groups labels with similar linguistic characteristics, and another employs meta-learning. The superiority of our approach is confirmed by its performance, which surpasses traditional NER learning in varying NER settings. Ngoc Dang Nguyen, Lan Du 0002, Wray L. Buntine, Richard Beare, Changyou Chen |
ICDM | 1 |
| 2022 | Hardness-guided domain adaptation to recognise biomedical named entities under low-resource scenariosabstractDomain adaptation is an effective solution to data scarcity in low-resource scenarios.However, when applied to token-level tasks such as bioNER, domain adaptation methods often suffer from the challenging linguistic characteristics that clinical narratives possess, which leads to unsatsifactory performance.In this paper, we present a simple yet effective hardnessguided domain adaptation (HGDA) framework for bioNER tasks that can effectively leverage the domain hardness information to improve the adaptability of the learnt model in the low-resource scenarios.Experimental results on biomedical datasets show that our model can achieve significant performance improvement over the recently published state-of-theart (SOTA) MetaNER model. Ngoc Dang Nguyen, Lan Du 0002, Wray L. Buntine, Changyou Chen, Richard Beare |
EMNLP | 1 |