Tu Minh Phuong
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
Tu Minh Phuong has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Ngo Xuan Bach
Department of Computer Science, Posts and Telecommunications Institute of Technology, Hanoi, Vietnam
9 shared publications - Kang-Hyun Jo
University of Ulsan
3 shared publications Ngo Xuan Bach
Posts & Telecommunications Institute of Technology
3 shared publications- Van-Thanh Hoang
Quang Binh University,Faculty of Information Technology,Quang Binh,Vietnam
3 shared publications - Ha-Thanh Nguyen
National Institute of Informatics
2 shared publications Hoang Thi Thu Uyen
Department of Computer Science, Posts and Telecommunications Institute of Technology, Hanoi, Vietnam
2 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1419-1427
SeCo-SBIR: Semantically Consistent Prompt Learning for Zero-Shot Sketch-Based Image Retrieval
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1419-1427
Open AccessSeCo-SBIR: Semantically Consistent Prompt Learning for Zero-Shot Sketch-Based Image Retrieval
- 13 June 2026
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 64 (5) , 1-25
RETSRec: A review-enhanced transformer-based model for sequential recommendation
- 13 June 2026
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 64 (5) , 1-25
RETSRec: A review-enhanced transformer-based model for sequential recommendation
- 21 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Efficient Object Detection Model Based on NanoDet
Object detection is a fundamental task in computer vision, involving the prediction of bounding boxes and class labels for Regions of Interest (ROI) within images. Traditionally, anchor-based detectors have dominated this field, leveraging predefined anchor boxes for object localization and classification. However, anchor-free detectors have emerged as a compelling alternative due to their reduced computational complexity and efficient detection capabilities. Among these innovations, Nan-oDet has garnered significant attention in the AI community for its speed and lightweight design as an anchor-free object detection model. This study introduces an enhanced variant of NanoDet, leveraging the EfficientNetB0-compact model as its backbone. By replacing the original ShuffleNetV2 backbone, this integration aims to improve detection performance without compromising speed, thereby enhancing suitability for mobile devices. Experimental results demonstrate the effectiveness of this modification in achieving superior performance metrics, highlighting the potential of advanced network architectures in optimizing object detection tasks for mobile and edge computing environments.
- 21 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
An Efficient Object Detection Model Based on NanoDet
Object detection is a fundamental task in computer vision, involving the prediction of bounding boxes and class labels for Regions of Interest (ROI) within images. Traditionally, anchor-based detectors have dominated this field, leveraging predefined anchor boxes for object localization and classification. However, anchor-free detectors have emerged as a compelling alternative due to their reduced computational complexity and efficient detection capabilities. Among these innovations, Nan-oDet has garnered significant attention in the AI community for its speed and lightweight design as an anchor-free object detection model. This study introduces an enhanced variant of NanoDet, leveraging the EfficientNetB0-compact model as its backbone. By replacing the original ShuffleNetV2 backbone, this integration aims to improve detection performance without compromising speed, thereby enhancing suitability for mobile devices. Experimental results demonstrate the effectiveness of this modification in achieving superior performance metrics, highlighting the potential of advanced network architectures in optimizing object detection tasks for mobile and edge computing environments.
- 16 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Enhanced Breast Cancer Detection: A Transfer Learning Framework with Auxiliary Classification for Mammographic Image Analysis
Breast cancer remains one of the most prevalent malignancies affecting women worldwide, with over 2.3 million new cases diagnosed annually. While conventional diagnostic methods like mammography have reduced mortality rates, artificial intelligence offers opportunities to further enhance detection accuracy. In this paper, we present a comprehensive framework for breast cancer identification using deep learning techniques applied to mammographic images. Our approach leverages transfer learning from ImageNet pretrained models and incorporates an auxiliary classification mechanism to improve diagnostic performance. We evaluated multiple state-of-the-art convolutional neural network architectures, including MobileNetV3, ResNet50, ConvNeXtV2-nano, ResNeXt50, MobileViT-small, and EfficientNet-B3, trained on four publicly available datasets (BMCD, CDD-CESM, CMMD, and MiniDDSM). Performance was assessed on separate external test datasets (VinDr and RSNA) to simulate real-world clinical deployment scenarios. Our experimental results demonstrate that EfficientNet-B3 with auxiliary classification achieved superior performance across most metrics, with an accuracy of 86.14%, F1-score of 85.80%, and AUC of 90.39% on validation data. We further introduce the Probabilistic F1-score as a clinically relevant evaluation metric that accounts for prediction confidence rather than binary decisions alone. The proposed framework, available as an open-source implementation, offers a promising approach for enhancing breast cancer detection while providing insights into the challenges of deploying AI systems in diverse clinical environments. We released our codebase at: https://github.com/thanhhnvnqb/mmbreast
- 16 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Enhanced Breast Cancer Detection: A Transfer Learning Framework with Auxiliary Classification for Mammographic Image Analysis
Breast cancer remains one of the most prevalent malignancies affecting women worldwide, with over 2.3 million new cases diagnosed annually. While conventional diagnostic methods like mammography have reduced mortality rates, artificial intelligence offers opportunities to further enhance detection accuracy. In this paper, we present a comprehensive framework for breast cancer identification using deep learning techniques applied to mammographic images. Our approach leverages transfer learning from ImageNet pretrained models and incorporates an auxiliary classification mechanism to improve diagnostic performance. We evaluated multiple state-of-the-art convolutional neural network architectures, including MobileNetV3, ResNet50, ConvNeXtV2-nano, ResNeXt50, MobileViT-small, and EfficientNet-B3, trained on four publicly available datasets (BMCD, CDD-CESM, CMMD, and MiniDDSM). Performance was assessed on separate external test datasets (VinDr and RSNA) to simulate real-world clinical deployment scenarios. Our experimental results demonstrate that EfficientNet-B3 with auxiliary classification achieved superior performance across most metrics, with an accuracy of 86.14%, F1-score of 85.80%, and AUC of 90.39% on validation data. We further introduce the Probabilistic F1-score as a clinically relevant evaluation metric that accounts for prediction confidence rather than binary decisions alone. The proposed framework, available as an open-source implementation, offers a promising approach for enhancing breast cancer detection while providing insights into the challenges of deploying AI systems in diverse clinical environments. We released our codebase at: https://github.com/thanhhnvnqb/mmbreast
- Open Access
- 28 September 2023
- Published by IOS Press
- p. 2370-2377
Joint Multiple Intent Detection and Slot Filling with Supervised Contrastive Learning and Self-Distillation
Multiple intent detection and slot filling are two fundamental and crucial tasks in spoken language understanding. Motivated by the fact that the two tasks are closely related, joint models that can detect intents and extract slots simultaneously are preferred to individual models that perform each task independently. The accuracy of a joint model depends heavily on the ability of the model to transfer information between the two tasks so that the result of one task can correct the result of the other. In addition, since a joint model has multiple outputs, how to train the model effectively is also challenging. In this paper, we present a method for multiple intent detection and slot filling by addressing these challenges. First, we propose a bidirectional joint model that explicitly employs intent information to recognize slots and slot features to detect intents. Second, we introduce a novel method for training the proposed joint model using supervised contrastive learning and self-distillation. Experimental results on two benchmark datasets MixATIS and MixSNIPS show that our method outperforms state-of-the-art models in both tasks. The results also demonstrate the contributions of both bidirectional design and the training method to the accuracy improvement. Our source code is available at https://github.com/anhtunguyen98/BiSLU.
- 28 September 2023
- Published by IOS Press
- p. 2370-2377
Open AccessJoint Multiple Intent Detection and Slot Filling with Supervised Contrastive Learning and Self-Distillation
Multiple intent detection and slot filling are two fundamental and crucial tasks in spoken language understanding. Motivated by the fact that the two tasks are closely related, joint models that can detect intents and extract slots simultaneously are preferred to individual models that perform each task independently. The accuracy of a joint model depends heavily on the ability of the model to transfer information between the two tasks so that the result of one task can correct the result of the other. In addition, since a joint model has multiple outputs, how to train the model effectively is also challenging. In this paper, we present a method for multiple intent detection and slot filling by addressing these challenges. First, we propose a bidirectional joint model that explicitly employs intent information to recognize slots and slot features to detect intents. Second, we introduce a novel method for training the proposed joint model using supervised contrastive learning and self-distillation. Experimental results on two benchmark datasets MixATIS and MixSNIPS show that our method outperforms state-of-the-art models in both tasks. The results also demonstrate the contributions of both bidirectional design and the training method to the accuracy improvement. Our source code is available at https://github.com/anhtunguyen98/BiSLU.
- Open Access
- 1 June 2023
- Published by Walter de Gruyter GmbH in Cybernetics and Information Technologies
- Vol. 23 (2) , 72-86
Joint Reference and Relation Extraction from Legal Documents with Enhanced Decoder Input
This paper deals with an important task in legal text processing, namely reference and relation extraction from legal documents, which includes two subtasks: 1) reference extraction; 2) relation determination. Motivated by the fact that two subtasks are related and share common information, we propose a joint learning model that solves simultaneously both subtasks. Our model employs a Transformer-based encoder-decoder architecture with non-autoregressive decoding that allows relaxing the sequentiality of traditional seq2seq models and extracting references and relations in one inference step. We also propose a method to enrich the decoder input with learnable meaningful information and therefore, improve the model accuracy. Experimental results on a dataset consisting of 5031 legal documents in Vietnamese with 61,446 references show that our proposed model performs better results than several strong baselines and achieves an F 1 score of 99.4% for the joint reference and relation extraction task.
- 1 June 2023
- Published by Walter de Gruyter GmbH in Cybernetics and Information Technologies
- Vol. 23 (2) , 72-86
Open AccessJoint Reference and Relation Extraction from Legal Documents with Enhanced Decoder Input
This paper deals with an important task in legal text processing, namely reference and relation extraction from legal documents, which includes two subtasks: 1) reference extraction; 2) relation determination. Motivated by the fact that two subtasks are related and share common information, we propose a joint learning model that solves simultaneously both subtasks. Our model employs a Transformer-based encoder-decoder architecture with non-autoregressive decoding that allows relaxing the sequentiality of traditional seq2seq models and extracting references and relations in one inference step. We also propose a method to enrich the decoder input with learnable meaningful information and therefore, improve the model accuracy. Experimental results on a dataset consisting of 5031 legal documents in Vietnamese with 61,446 references show that our proposed model performs better results than several strong baselines and achieves an F 1 score of 99.4% for the joint reference and relation extraction task.
- Open Access
Analyzing Vietnamese Legal Questions Using Deep Neural Networks with Biaffine Classifiers
In this paper, we propose using deep neural networks to extract important information from Vietnamese legal questions, a fundamental task towards building a question answering system in the legal domain. Given a legal question in natural language, the goal is to extract all the segments that contain the needed information to answer the question. We introduce a deep model that solves the task in three stages. First, our model leverages recent advanced autoencoding language models to produce contextual word embeddings, which are then combined with character-level and POS-tag information to form word representations. Next, bidirectional long short-term memory networks are employed to capture the relations among words and generate sentence-level representations. At the third stage, borrowing ideas from graph-based dependency parsing methods which provide a global view on the input sentence, we use biaffine classifiers to estimate the probability of each pair of start-end words to be an important segment. Experimental results on a public Vietnamese legal dataset show that our model outperforms the previous work by a large margin, achieving 94.79% in the F1 score. The results also prove the effectiveness of using contextual features extracted from pre-trained language models combined with other types of features such as character-level and POS-tag features when training on a limited dataset.
Open AccessAnalyzing Vietnamese Legal Questions Using Deep Neural Networks with Biaffine Classifiers
In this paper, we propose using deep neural networks to extract important information from Vietnamese legal questions, a fundamental task towards building a question answering system in the legal domain. Given a legal question in natural language, the goal is to extract all the segments that contain the needed information to answer the question. We introduce a deep model that solves the task in three stages. First, our model leverages recent advanced autoencoding language models to produce contextual word embeddings, which are then combined with character-level and POS-tag information to form word representations. Next, bidirectional long short-term memory networks are employed to capture the relations among words and generate sentence-level representations. At the third stage, borrowing ideas from graph-based dependency parsing methods which provide a global view on the input sentence, we use biaffine classifiers to estimate the probability of each pair of start-end words to be an important segment. Experimental results on a public Vietnamese legal dataset show that our model outperforms the previous work by a large margin, achieving 94.79% in the F1 score. The results also prove the effectiveness of using contextual features extracted from pre-trained language models combined with other types of features such as character-level and POS-tag features when training on a limited dataset.
- 27 December 2022
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 32 (1) , 57-86
Attentive deep neural networks for legal document retrieval
- 27 December 2022
- Published by Springer Nature in Artificial Intelligence and Law
- Vol. 32 (1) , 57-86
Attentive deep neural networks for legal document retrieval
- Open Access
Attentive Deep Neural Networks for Legal Document Retrieval
Legal text retrieval serves as a key component in a wide range of legal text processing tasks such as legal question answering, legal case entailment, and statute law retrieval. The performance of legal text retrieval depends, to a large extent, on the representation of text, both query and legal documents. Based on good representations, a legal text retrieval model can effectively match the query to its relevant documents. Because legal documents often contain long articles and only some parts are relevant to queries, it is quite a challenge for existing models to represent such documents. In this paper, we study the use of attentive neural network-based text representation for statute law document retrieval. We propose a general approach using deep neural networks with attention mechanisms. Based on it, we develop two hierarchical architectures with sparse attention to represent long sentences and articles, and we name them Attentive CNN and Paraformer. The methods are evaluated on datasets of different sizes and characteristics in English, Japanese, and Vietnamese. Experimental results show that: i) Attentive neural methods substantially outperform non-neural methods in terms of retrieval performance across datasets and languages; ii) Pretrained transformer-based models achieve better accuracy on small datasets at the cost of high computational complexity while lighter weight Attentive CNN achieves better accuracy on large datasets; and iii) Our proposed Paraformer outperforms state-of-the-art methods on COLIEE dataset, achieving the highest recall and F2 scores in the top-N retrieval task.
Open AccessAttentive Deep Neural Networks for Legal Document Retrieval
Legal text retrieval serves as a key component in a wide range of legal text processing tasks such as legal question answering, legal case entailment, and statute law retrieval. The performance of legal text retrieval depends, to a large extent, on the representation of text, both query and legal documents. Based on good representations, a legal text retrieval model can effectively match the query to its relevant documents. Because legal documents often contain long articles and only some parts are relevant to queries, it is quite a challenge for existing models to represent such documents. In this paper, we study the use of attentive neural network-based text representation for statute law document retrieval. We propose a general approach using deep neural networks with attention mechanisms. Based on it, we develop two hierarchical architectures with sparse attention to represent long sentences and articles, and we name them Attentive CNN and Paraformer. The methods are evaluated on datasets of different sizes and characteristics in English, Japanese, and Vietnamese. Experimental results show that: i) Attentive neural methods substantially outperform non-neural methods in terms of retrieval performance across datasets and languages; ii) Pretrained transformer-based models achieve better accuracy on small datasets at the cost of high computational complexity while lighter weight Attentive CNN achieves better accuracy on large datasets; and iii) Our proposed Paraformer outperforms state-of-the-art methods on COLIEE dataset, achieving the highest recall and F2 scores in the top-N retrieval task.