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

Daniel Hui Loong Ng

dblp:421/0508 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Information extraction and text analysis · 40% Representation and self-supervised learning · 40% Graph learning · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
Contrastive Learning with Simplicial Convolutional Networks for Short-Text Classification · ICML 2025
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.912025
Contrastive Learning with Simplicial Convolutional Networks for Short-Text Classification · ICML 2025
Machine learning › Graph learning
graph neural network
0.912025
Contrastive Learning with Simplicial Convolutional Networks for Short-Text Classification · ICML 2025
Natural language and speech › Information extraction and text analysis › text classification
short text classification
0.912025
Contrastive Learning with Simplicial Convolutional Networks for Short-Text Classification · ICML 2025
Natural language and speech › Information extraction and text analysis
text classification
0.912025
Contrastive Learning with Simplicial Convolutional Networks for Short-Text Classification · ICML 2025

Methods — techniques the papers use, named apart from their topics

transformer · 0.9simplicial complex · 0.9message passing · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2025 Contrastive Learning with Simplicial Convolutional Networks for Short-Text Classification
abstract
Text classification is a fundamental task in Natural Language Processing (NLP). Short text classification has recently captured much attention due to its increased amount from various sources with limited labels and its inherent challenges for its sparsity in words and semantics. Recent studies have adopted self-supervised contrastive learning across different representations to improve performance. However, most of the current models face several challenges. Firstly, the augmentation step might not be able to generate positive and negative samples that are semantically similar and dissimilar to the anchor respectively. Secondly, the text data could be enhanced with external auxiliary information that might introduce noise to the sparse text data. In addition, they are limited in capturing higher-order information such as group-wise interactions. In this work, we propose a novel document simplicial complex construction based on text data for a higher-order message-passing mechanism. We enhance the short text classification performance by contrasting the structural representation with the sequential representation generated by the transformer mechanism for improved outcomes and mitigated issues. The proposed framework, Contrastive Learning with Simplicial Convolutional Networks (C-SCN), leverages the expressive power of graph neural networks, models higher-order information beyond pair-wise relations and enriches features through contrastive learning. Experimental results on four benchmark datasets demonstrate the capability of C-SCN to outperform existing models in analysing sequential and complex short-text data.
Huang Liang, Benedict Lee, Daniel Hui Loong Ng, Kelin Xia
ICML3