Quan T. Ngo

Dr. Quan T. Ngo

University of Ulsan, Ulsan, Republic of Korea
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 May 2020 in Sensors
Verified
Journal Article
Open access
PDF file
QNQuan T. Ngo
Quan T. Ngo
SYSeokhoon Yoon
Seokhoon Yoon
Facial expression recognition (FER) is a challenging problem in the fields of pattern recognition and computer vision. The recent success of convolutional neural networks (CNNs) in object detection and object segmentation tasks has shown promise in building an automatic deep CNN-based FER model. However, in real-world scenarios, performance degrades dramatically owing to the great diversity of factors unrelated to facial expressions, and due to a lack of training data and an intrinsic imbalance in the existing facial emotion datasets. To tackle these problems, this paper not only applies deep transfer learning techniques, but also proposes a novel loss function called weighted-cluster loss, which is used during the fine-tuning phase. Specifically, the weighted-cluster loss function simultaneously improves the intra-class compactness and the inter-class separability by learning a class center for each emotion class. It also takes the imbalance in a facial expression dataset into account by giving each emotion class a weight based on its proportion of the total number of images. In addition, a recent, successful deep CNN architecture, pre-trained in the task of face identification with the VGGFace2 database from the Visual Geometry Group at Oxford University, is employed and fine-tuned using the proposed loss function to recognize eight basic facial emotions from the AffectNet database of facial expression, valence, and arousal computing in the wild. Experiments on an AffectNet real-world facial dataset demonstrate that our method outperforms the baseline CNN models that use either weighted-softmax loss or center loss.

Verified
Journal Article
Open access
PDF file
NHNguyen Nhat Hai
Nguyen Nhat Hai
NTNguyen Thi Thu
Nguyen Thi Thu
QNQuan T. Ngo
Quan T. Ngo
Stock price forecasting remains a persistent challenge in time series analysis due to complex inter-stock relationships and dynamic textual signals such as financial news. While Graph Neural Networks (GNNs) can model relational structures, they often struggle with capturing higher-order dependencies and are sensitive to noise. Moreover, sentiment signals are typically aggregated using fixed time windows, which may introduce temporal bias. To address these issues, we propose DASF-Net (Diffusion-Aware Sentiment Fusion Network), a multimodal framework that integrates structural and textual information for robust prediction. DASF-Net leverages diffusion processes over two complementary financial graphs—one based on industry relationships, the other on fundamental indicators—to learn richer stock representations. Simultaneously, sentiment embeddings extracted from financial news using FinBERT are aggregated over an empirically optimized window to preserve temporal relevance. These modalities are fused via a multi-head attention mechanism and passed to a temporal forecasting module. DASF-Net integrates daily stock prices and news sentiment, using a 3-day sentiment aggregation window, to forecast stock prices over daily horizons (1–3 days). Experiments on 12 large-cap S&P 500 stocks over four years demonstrate that DASF-Net outperforms competitive baselines, achieving up to 91.6% relative reduction in Mean Squared Error (MSE). Results highlight the effectiveness of combining graph diffusion and sentiment-aware features for improved financial forecasting.

20 November 2019 in Lecture Notes in Computer Science
Verified
Conference Paper
Closed access
PDF file
QNQuan T. Ngo
Quan T. Ngo
SYSeokhoon Yoon
Seokhoon Yoon

27 June 2022 in IEEE Access
Verified
Journal Article
Open access
QNQuan T. Ngo
Quan T. Ngo
LDLan Thi Doi
Lan Thi Doi
SYSeokhoon Yoon
Seokhoon Yoon
WJWoosung Jung
Woosung Jung
TYTaehyun Yoon
Taehyun Yoon
DYDaeseung Yoo
Daeseung Yoo
Location prediction plays an important role in modeling human mobility. Existing studies focused on developing a prediction model which is based solely on the past mobility of only the person of interest (POI), rather than including information on the mobility of her/his companions. In fact, people frequently move in a group, and thus, using mobility data of a person’s companions can enhance accuracy when predicting that person’s future locations. Motivated by this, we propose a two-phase framework for predicting an individual’s future locations that fully benefits from spatio-temporal contexts embedded in that person’s and his/her companions’ mobility. The framework first determines the POI’s companions, then predicts future locations based on mobility information for both the POI and selected companions. Two companion selection methods are proposed in this work. The first method uses spatial closeness (SC) to determine the companions of the POI by measuring the similarity of the individuals’ geographic distributions. The second method builds person ID embedding (PIE) vectors, and cosine similarity is used to select the POI’s companions. To mitigate the curse of dimensionality, the framework also uses a stacked autoencoder in which the encoder compresses a high-dimensional input feature (e.g., location, time, and person ID) into a low-dimensional latent vector. For the second phase of the framework, a bidirectional recurrent neural network (BRNN)-based multi-output model is proposed to predict a person’s future locations in the next several time slots. To train the BRNN model, weighted loss is used, which takes into account the importance of each future time slot to predict the POI’s locations accurately. Experiments are conducted on two large-scale Wi-Fi trace datasets, demonstrating that the proposed model can effectively predict human future locations.

24 August 2023 in IEEE Access
Verified
Journal Article
Open access
QNQuan T. Ngo
Quan T. Ngo
SYSeokhoon Yoon
Seokhoon Yoon
Opportunistic worker (OW) selection is a challenging problem in mobile crowd sensing (MCS), where tasks are assigned to individuals to be completed seamlessly during their daily routines without any deviation from their usual routes. In this paper, we propose a novel framework named context-aware worker recruitment based on a mobility prediction model (CAMP) to address the OW selection problem in MCS. Unlike previous approaches that relied on worker mobility prediction models with limited accuracy or utility-based selection methods neglecting task distribution differences across locations, CAMP introduces a two-phase strategy for OW selection. In the first phase, we leverage a recurrent neural network-based prediction model specifically designed to forecast volunteer workers’ future locations with higher precision. This enhanced mobility prediction ensures more effective task assignments in the MCS system. In the second phase, CAMP employs a weighted-utility algorithm that takes into account the varying task distribution throughout the day across different locations. The key novelty of theCAMPframework lies in its combination of an accurate multi-output RNN model for predicting worker mobility and a unique weighted-utility worker selection algorithm that considers variations in task distribution across different locations and sensing cycles. To validate the effectiveness of the CAMP framework, we extensively evaluate it using real-world GPS data, specifically the Crawdad Roma/Taxi dataset. The results demonstrate that CAMP outperforms existing approaches, delivering a higher number of completed tasks while adhering to the same budget constraints.