Thi Phuong Quyen Nguyen

Thi Phuong Quyen Nguyen

Auto-generated profile, based on publicly available information

Thi Phuong Quyen Nguyen

Faculty of Project Management, The University of Danang, University of Science and Technology, Danang, Vietnam

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
26 September 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
TNThi Phuong Quyen Nguyen
Thi Phuong Quyen Nguyen
KNKy Phuc Phan Nguyen
Ky Phuc Phan Nguyen
CYChao-Lung Yang
Chao-Lung Yang
HSHendri Sutrisno
Hendri Sutrisno
BLBao-Han Luong
Bao-Han Luong
TNThanh Tung Nguyen
Thanh Tung Nguyen

11 May 2016 in Soft Computing
Verified
Journal Article
Closed access
PDF file
NQNguyen Thi Phuong Quyen
Nguyen Thi Phuong Quyen
JCJames C. Chen
James C. Chen
CYChao-Lung Yang
Chao-Lung Yang

17 May 2023 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
RKR. J. Kuo
R. J. Kuo
PSP. F. Song
P. F. Song
TNThi Phuong Quyen Nguyen
Thi Phuong Quyen Nguyen
TYT. J. Yang
T. J. Yang

1 November 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
RKR.J. Kuo
R.J. Kuo
PAPatipharn Amornnikun
Patipharn Amornnikun
TNThi Phuong Quyen Nguyen
Thi Phuong Quyen Nguyen

9 July 2019 in IEEE Access
Verified
Journal Article
Open access
TNThi Phuong Quyen Nguyen
Thi Phuong Quyen Nguyen
RKR. J. Kuo
R. J. Kuo
Categorical data clustering has been attracted a lot of attention recently due to its necessary in the real-world applications. Many clustering methods have been proposed for categorical data. However, most of the existing algorithms require the predefined number of clusters which is usually unavailable in real-world problems. Only a few works focused on automatic clustering, but mainly handled for numerical data. This study develops a novel automatic fuzzy clustering using non-dominated sorting particle swarm optimization (AFC-NSPSO) algorithm for categorical data. The proposed AFC-NSPSO algorithm can automatically identify the optimal number of clusters and exploit the clustering result with the corresponding selected number of clusters. In addition, a new technique is investigated to identify the maximum number of clusters in a dataset based on the local density. To select a final solution in the first Pareto front, some internal validation indices are used. The performance of the proposed AFC-NSPSO on the real-world datasets collected from the UCI machine learning repository exhibits effectiveness compared with some other existing automatic categorical clustering algorithms. Besides, this study also applies the proposed algorithm to analyze a real-world case study with an unknown number of clusters.