Viet Hung Vu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Viet Hung Vu has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Jun Jo
Griffith University
2 shared publications - Nguyen Duc Khang Quach
School of Information and Communication Technology, Griffith University, Gold Coast Campus, QLD, Australia
2 shared publications - Phi Le Nguyen
Hanoi University of Science and Technology
2 shared publications - Quoc Viet Hung Nguyen
Griffith University, Gold Coast, Australia
2 shared publications - Thanh Tam Nguyen
Griffith University, Gold Coast, Australia
2 shared publications - Thanh Trung Huynh
Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
2 shared publications
Latest Publications
- 1 March 2023
- Published by Springer Nature
- p. 438-450
Short-Term Traffic Speed Prediction Using Hybrid LSTM-SVR Model
- 1 March 2023
- Published by Springer Nature
- p. 438-450
Short-Term Traffic Speed Prediction Using Hybrid LSTM-SVR Model
- Open Access
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-24
Poisoning GNN-based Recommender Systems with Generative Surrogate-based Attacks
With recent advancements in graph neural networks (GNN), GNN-based recommender systems (gRS) have achieved remarkable success in the past few years. Despite this success, existing research reveals that gRSs are still vulnerable to poison attacks , in which the attackers inject fake data to manipulate recommendation results as they desire. This might be due to the fact that existing poison attacks (and countermeasures) are either model-agnostic or specifically designed for traditional recommender algorithms (e.g., neighborhood-based, matrix-factorization-based, or deep-learning-based RSs) that are not gRS. As gRSs are widely adopted in the industry, the problem of how to design poison attacks for gRSs has become a need for robust user experience. Herein, we focus on the use of poison attacks to manipulate item promotion in gRSs. Compared to standard GNNs, attacking gRSs is more challenging due to the heterogeneity of network structure and the entanglement between users and items. To overcome such challenges, we propose GSPAttack —a generative surrogate-based poison attack framework for gRSs. GSPAttack tailors a learning process to surrogate a recommendation model as well as generate fake users and user-item interactions while preserving the data correlation between users and items for recommendation accuracy. Although maintaining high accuracy for other items rather than the target item seems counterintuitive, it is equally crucial to the success of a poison attack. Extensive evaluations on four real-world datasets revealed that GSPAttack outperforms all baselines with competent recommendation performance and is resistant to various countermeasures.
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-24
Open AccessPoisoning GNN-based Recommender Systems with Generative Surrogate-based Attacks
With recent advancements in graph neural networks (GNN), GNN-based recommender systems (gRS) have achieved remarkable success in the past few years. Despite this success, existing research reveals that gRSs are still vulnerable to poison attacks , in which the attackers inject fake data to manipulate recommendation results as they desire. This might be due to the fact that existing poison attacks (and countermeasures) are either model-agnostic or specifically designed for traditional recommender algorithms (e.g., neighborhood-based, matrix-factorization-based, or deep-learning-based RSs) that are not gRS. As gRSs are widely adopted in the industry, the problem of how to design poison attacks for gRSs has become a need for robust user experience. Herein, we focus on the use of poison attacks to manipulate item promotion in gRSs. Compared to standard GNNs, attacking gRSs is more challenging due to the heterogeneity of network structure and the entanglement between users and items. To overcome such challenges, we propose GSPAttack —a generative surrogate-based poison attack framework for gRSs. GSPAttack tailors a learning process to surrogate a recommendation model as well as generate fake users and user-item interactions while preserving the data correlation between users and items for recommendation accuracy. Although maintaining high accuracy for other items rather than the target item seems counterintuitive, it is equally crucial to the success of a poison attack. Extensive evaluations on four real-world datasets revealed that GSPAttack outperforms all baselines with competent recommendation performance and is resistant to various countermeasures.
- 9 December 2022
- Published by Springer Nature
- p. 675-687
Social Multi-role Discovering with Hypergraph Embedding for Location-Based Social Networks
- 9 December 2022
- Published by Springer Nature
- p. 675-687
Social Multi-role Discovering with Hypergraph Embedding for Location-Based Social Networks
- Open Access
- 1 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 103-110
Unsupervised Air Quality Interpolation with Attentive Graph Neural Network
Rapid industrial expansion, urbanization, and traffic growth have led to a decline in air quality that significantly impacts human health and environmental sustainability, particularly in developing nations. Due to the limited number of monitoring stations, the air quality index is not gathered at numerous locations. To address the difficulty of predicting the air quality value at an arbitrary place, several studies, including statistical and machine learning approaches, have been proposed. The majority of existing research employs classic distance-based interpolation techniques. In this paper, we propose a novel attentive neural-based approach for estimating unmonitored air quality values. This method follows the encoder-decoder paradigm, with the encoder and decoder being learned independently utilizing distinct processes. In the encoder, we propose AGE, an inductive unsupervised learning methodology that integrates attention mechanisms. AGE learns a set of functions that generate spatial embeddings by aggregating features from the surrounding region. For the decoder, we utilize the Gated Recurrent Unit and a fully-connected layer to estimate the air quality index at the targeted location. We conduct extensive experiments to evaluate the performance of our proposed method and compare it to the state-of-the-art (SOTA). The experimental results show that our approach reduces the estimation error from 8.07% to 37.04% compared to the SOTA.
- 1 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 103-110
Open AccessUnsupervised Air Quality Interpolation with Attentive Graph Neural Network
Rapid industrial expansion, urbanization, and traffic growth have led to a decline in air quality that significantly impacts human health and environmental sustainability, particularly in developing nations. Due to the limited number of monitoring stations, the air quality index is not gathered at numerous locations. To address the difficulty of predicting the air quality value at an arbitrary place, several studies, including statistical and machine learning approaches, have been proposed. The majority of existing research employs classic distance-based interpolation techniques. In this paper, we propose a novel attentive neural-based approach for estimating unmonitored air quality values. This method follows the encoder-decoder paradigm, with the encoder and decoder being learned independently utilizing distinct processes. In the encoder, we propose AGE, an inductive unsupervised learning methodology that integrates attention mechanisms. AGE learns a set of functions that generate spatial embeddings by aggregating features from the surrounding region. For the decoder, we utilize the Gated Recurrent Unit and a fully-connected layer to estimate the air quality index at the targeted location. We conduct extensive experiments to evaluate the performance of our proposed method and compare it to the state-of-the-art (SOTA). The experimental results show that our approach reduces the estimation error from 8.07% to 37.04% compared to the SOTA.