Quoc Viet Hung Nguyen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Quoc Viet Hung Nguyen has a total of 361 co-authors. Here are the top co-authors by number of shared publications:
- Hongzhi Yin
The University of Queensland
79 shared publications - Tong Chen
School of Electrical Engineering and Computer Science, The University of Queensland, Brisbane, Australia
41 shared publications - Phi Le Nguyen
Hanoi University of Science and Technology
28 shared publications - Thanh Tam Nguyen
Griffith University, Gold Coast, Australia
21 shared publications Karl Aberer
19 shared publications- Thanh Trung Huynh
Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
16 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6574-6585
QA-Merging: Query-Adaptive Reasoning via Layer Selective Model Merging
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6574-6585
Open AccessQA-Merging: Query-Adaptive Reasoning via Layer Selective Model Merging
- Open Access
- 29 October 2026
- Published by Elsevier in Neural Networks
- Vol. 206
FedRSFL: Federated recommender systems with feature-level user data sharing
- 29 October 2026
- Published by Elsevier in Neural Networks
- Vol. 206
Open AccessFedRSFL: Federated recommender systems with feature-level user data sharing
- 1 September 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
A survey of social network simulation in the LLM era: From classical models to Generative Agents
- 1 September 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 352
A survey of social network simulation in the LLM era: From classical models to Generative Agents
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 3978-3987
Learning to Evaluate: Cost-Effective Model Evaluation on Unlabeled Data with Meta-Learning
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 3978-3987
Open AccessLearning to Evaluate: Cost-Effective Model Evaluation on Unlabeled Data with Meta-Learning
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 5398-5401
LLM-UP: SIGIR 2026 Workshop on LLM-powered User Profiling for Search and Recommendation
The rapid advancement of large language models (LLMs) has opened new possibilities for understanding users in search and recommendation. While traditional behavior-based or feature-driven user models rely primarily on explicit interactions or handcrafted representations, LLMs introduce a fundamentally different paradigm: LLM-powered user profiling, where user preferences, intents, and contextual attributes can be extracted, summarized, or reasoned about directly through natural language. This shift unlocks powerful new paths to achieve personalization but also raises pressing questions related to modeling fidelity, temporal dynamics, evaluation methodology, privacy, and responsible deployment. The LLM-UP workshop aims to bring together researchers and practitioners to systematize emerging progress in LLM-powered user profiling, identify open challenges, and explore opportunities for integrating such techniques into search and recommendation pipelines. The LLM-UP workshop adopts an interactive structure featuring lightning talks, panel discussions, and paper presentations to foster active engagement, cross-disciplinary dialogue, and community-driven agenda setting for this rapidly evolving field.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 5398-5401
Open AccessLLM-UP: SIGIR 2026 Workshop on LLM-powered User Profiling for Search and Recommendation
The rapid advancement of large language models (LLMs) has opened new possibilities for understanding users in search and recommendation. While traditional behavior-based or feature-driven user models rely primarily on explicit interactions or handcrafted representations, LLMs introduce a fundamentally different paradigm: LLM-powered user profiling, where user preferences, intents, and contextual attributes can be extracted, summarized, or reasoned about directly through natural language. This shift unlocks powerful new paths to achieve personalization but also raises pressing questions related to modeling fidelity, temporal dynamics, evaluation methodology, privacy, and responsible deployment. The LLM-UP workshop aims to bring together researchers and practitioners to systematize emerging progress in LLM-powered user profiling, identify open challenges, and explore opportunities for integrating such techniques into search and recommendation pipelines. The LLM-UP workshop adopts an interactive structure featuring lightning talks, panel discussions, and paper presentations to foster active engagement, cross-disciplinary dialogue, and community-driven agenda setting for this rapidly evolving field.
- Open Access
- 14 May 2026
- Published by MDPI AG in Preprints.org
Mamba for Time Series Analysis: A Contemporary Survey
Time series analysis (TSA)–forecasting, anomaly detection, imputation, classification, and unified multi-task analytics– has become a battleground for sequence-modeling backbones, where Transformers, MLPs, convolutions, and state-space models compete on long context benchmarks. Since the 2023 release of Mamba, its linear time recurrence and input-dependent selectivity have triggered a surge of Mamba-based time-series models that report strong numbers yet resist like-for-like comparison. This survey provides the first focused treatment of Mamba for time series analysis, organized around four orthogonal perspectives: Model, Task, Data, and Application. The Model perspective formalizes a five-axis design space– tokenization, channel strategy, directional scan, hybridization, and decomposition– together with a three-pattern architectural toolbox of pure, bidirectional, and hybrid designs. The Task perspective re-indexes the corpus across the five canonical TSA tasks. The Data perspective re-tags it by data shape, spanning univariate, multivariate, spatio-temporal graph, and irregular series. The Application perspective then surveys deployments in healthcare, energy, traffic, climate, finance, activity recognition, and foundation-scale settings. Building on these views, we distill practical guidelines for variant selection, training recipes, and Mamba-specific pitfalls. We also catalog public implementations, datasets, and metrics, and we map out open frontiers in gain attribution, modeling regimes, and cross-task unification. An online repository is maintained at https://github.com/tamlhp/awesome-mamba-ts.
- 14 May 2026
- Published by MDPI AG in Preprints.org
Open AccessMamba for Time Series Analysis: A Contemporary Survey
Time series analysis (TSA)–forecasting, anomaly detection, imputation, classification, and unified multi-task analytics– has become a battleground for sequence-modeling backbones, where Transformers, MLPs, convolutions, and state-space models compete on long context benchmarks. Since the 2023 release of Mamba, its linear time recurrence and input-dependent selectivity have triggered a surge of Mamba-based time-series models that report strong numbers yet resist like-for-like comparison. This survey provides the first focused treatment of Mamba for time series analysis, organized around four orthogonal perspectives: Model, Task, Data, and Application. The Model perspective formalizes a five-axis design space– tokenization, channel strategy, directional scan, hybridization, and decomposition– together with a three-pattern architectural toolbox of pure, bidirectional, and hybrid designs. The Task perspective re-indexes the corpus across the five canonical TSA tasks. The Data perspective re-tags it by data shape, spanning univariate, multivariate, spatio-temporal graph, and irregular series. The Application perspective then surveys deployments in healthcare, energy, traffic, climate, finance, activity recognition, and foundation-scale settings. Building on these views, we distill practical guidelines for variant selection, training recipes, and Mamba-specific pitfalls. We also catalog public implementations, datasets, and metrics, and we map out open frontiers in gain attribution, modeling regimes, and cross-task unification. An online repository is maintained at https://github.com/tamlhp/awesome-mamba-ts.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1333-1344
OFA-MAS: One-for-All Multi-Agent System Topology Design based on Mixture-of-Experts Graph Generative Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1333-1344
Open AccessOFA-MAS: One-for-All Multi-Agent System Topology Design based on Mixture-of-Experts Graph Generative Models
- Open Access
Evolutionary Router Feature Generation for Zero-Shot Graph Anomaly Detection with Mixture-of-Experts
Zero-shot graph anomaly detection (GAD) has attracted increasing attention recent years, yet the heterogeneity of graph structures, features, and anomaly patterns across graphs make existing single GNN methods insufficiently expressive to model diverse anomaly mechanisms. In this regard, Mixture-of-experts (MoE) architectures provide a promising paradigm by integrating diverse GNN experts with complementary inductive biases, yet their effectiveness in zero-shot GAD is severely constrained by distribution shifts, leading to two key routing challenges. First, nodes often carry vastly different semantics across graphs, and straightforwardly performing routing based on their features is prone to generating biased or suboptimal expert assignments. Second, as anomalous graphs often exhibit pronounced distributional discrepancies, existing router designs fall short in capturing domain-invariant routing principles that generalize beyond the training graphs. To address these challenges, we propose a novel MoE framework with evolutionary router feature generation (EvoFG) for zero-shot GAD. To enhance MoE routing, we propose an evolutionary feature generation scheme that iteratively constructs and selects informative structural features via an LLM-based generator and Shapley-guided evaluation. Moreover, a memory-enhanced router with an invariant learning objective is designed to capture transferable routing patterns under distribution shifts. Extensive experiments on six benchmarks show that EvoFG consistently outperforms state-of-the-art baselines, achieving strong and stable zero-shot GAD performance.
Open AccessEvolutionary Router Feature Generation for Zero-Shot Graph Anomaly Detection with Mixture-of-Experts
Zero-shot graph anomaly detection (GAD) has attracted increasing attention recent years, yet the heterogeneity of graph structures, features, and anomaly patterns across graphs make existing single GNN methods insufficiently expressive to model diverse anomaly mechanisms. In this regard, Mixture-of-experts (MoE) architectures provide a promising paradigm by integrating diverse GNN experts with complementary inductive biases, yet their effectiveness in zero-shot GAD is severely constrained by distribution shifts, leading to two key routing challenges. First, nodes often carry vastly different semantics across graphs, and straightforwardly performing routing based on their features is prone to generating biased or suboptimal expert assignments. Second, as anomalous graphs often exhibit pronounced distributional discrepancies, existing router designs fall short in capturing domain-invariant routing principles that generalize beyond the training graphs. To address these challenges, we propose a novel MoE framework with evolutionary router feature generation (EvoFG) for zero-shot GAD. To enhance MoE routing, we propose an evolutionary feature generation scheme that iteratively constructs and selects informative structural features via an LLM-based generator and Shapley-guided evaluation. Moreover, a memory-enhanced router with an invariant learning objective is designed to capture transferable routing patterns under distribution shifts. Extensive experiments on six benchmarks show that EvoFG consistently outperforms state-of-the-art baselines, achieving strong and stable zero-shot GAD performance.
- Open Access
- 12 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 338
Handling data sparsity and model poisoning attacks in federated sequential recommender systems
- 12 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 338
Open AccessHandling data sparsity and model poisoning attacks in federated sequential recommender systems
- 20 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (3) , 1575-1588
DeepCGC: Unveiling the Deep Clustering Mechanism of Fast Graph Condensation
Graph condensation (GC) improves the efficiency of GNN training by condensing a large-scale graph into a compact synthetic graph. However, existing GC methods suffer from time-consuming optimization processes, and the underlying mechanisms driving their effectiveness remain unexplored. In this paper, we provide novel insights into the optimization strategies of GC, demonstrating that various methods ultimately converge to the class-level feature matching between the original and condensed graphs. Building on this understanding, we further refine the unified class-to-class matching paradigm into a fine-grained class-to-node paradigm, unveiling that the core mechanism of GC is a class-wise clustering problem in the latent space. Accordingly, we propose Deep Clustering-based Graph Condensation (DeepCGC), an efficient GC framework that integrates a clustering-based optimization objective with an invertible relay model. Extensive experiments show that DeepCGC achieves state-of-the-art efficiency and accuracy. Notably, it condenses the million-scale Ogbn-products graph in around 40 seconds—a$10^{2} \times$ to$10^{4} \times$ speedup over existing methods—while boosting accuracy by up to 4.6% .- 20 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (3) , 1575-1588
DeepCGC: Unveiling the Deep Clustering Mechanism of Fast Graph Condensation
Graph condensation (GC) improves the efficiency of GNN training by condensing a large-scale graph into a compact synthetic graph. However, existing GC methods suffer from time-consuming optimization processes, and the underlying mechanisms driving their effectiveness remain unexplored. In this paper, we provide novel insights into the optimization strategies of GC, demonstrating that various methods ultimately converge to the class-level feature matching between the original and condensed graphs. Building on this understanding, we further refine the unified class-to-class matching paradigm into a fine-grained class-to-node paradigm, unveiling that the core mechanism of GC is a class-wise clustering problem in the latent space. Accordingly, we propose Deep Clustering-based Graph Condensation (DeepCGC), an efficient GC framework that integrates a clustering-based optimization objective with an invertible relay model. Extensive experiments show that DeepCGC achieves state-of-the-art efficiency and accuracy. Notably, it condenses the million-scale Ogbn-products graph in around 40 seconds—a$10^{2} \times$ to$10^{4} \times$ speedup over existing methods—while boosting accuracy by up to 4.6% .