Phichsinee Khongja
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Phichsinee Khongja has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Amit Saxena
Department of Computer Science and Information Technology, Guru Ghasidas Vishwavidyalaya, Bilaspur, India
2 shared publications - Damodar Patel
Department of Computer Science and Information Technology, Guru Ghasidas Vishwavidyalaya, Bilaspur, India
2 shared publications - Phumin Sumalai
Department of Mathematics, Faculty of Science and Technology, Muban Chombueng Rajabhat University, Ratchaburi, Thailand
2 shared publications
Latest Publications
- 17 April 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (6) , 358
Fuzzy feature selection using fuzzy C-means clustering and recursive feature elimination (FCM-RFE)
- 17 April 2026
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 82 (6) , 358
Fuzzy feature selection using fuzzy C-means clustering and recursive feature elimination (FCM-RFE)
- Open Access
- 13 November 2025
- Published by Springer Nature in Research Square
Fuzzy Feature Selection Using Fuzzy C-Means Clustering and Recursive Feature Elimination (FCM-RFE)
In machine learning, feature selection is crucial for reducing computing costs, increasing generalization, reducing dimensionality, and improving model interpretability. Due to multicollinearity and redundancy, traditional approaches often encounter difficulties when dealing with high-dimensional data. We propose a hybrid framework called Fuzzy Feature Selection using Fuzzy C-Means Clustering and Recursive Feature Elimination (FCM-RFE), which combines fuzzy logic, filter, and wrapper approaches, to address these problems. In order to capture complex relationships, fuzzy C-Means clustering first partitions related features into soft clusters. Then, within each cluster, less significant features are repeatedly eliminated using Recursive Feature Elimination with Random Forest (RFE-RF). For more precise selection, features are ranked according to the strength of their cluster link using a fuzzy membership-based scoring system. Experiments on 18 benchmark datasets using KNN and SVM classifiers evaluated metrics including accuracy, precision, recall, F1-score, specificity, and AUC-ROC. The proposed approach maintained or enhanced performance while significantly decreasing dimensionality, selecting, on average, only 4.1% of the original features. The maximum accuracy was 92.75% for SVM with FCM-RFE and 89% for KNN. The proposed method demonstrated effectiveness and scalability for high-dimensional data analysis, outperforming eight state-of-the-art techniques and demonstrating computing efficiency. This framework is suitable for high-dimensional data analysis in various disciplines because it not only increases classification performance but also improves interpretability and scalability.
- 13 November 2025
- Published by Springer Nature in Research Square
Open AccessFuzzy Feature Selection Using Fuzzy C-Means Clustering and Recursive Feature Elimination (FCM-RFE)
In machine learning, feature selection is crucial for reducing computing costs, increasing generalization, reducing dimensionality, and improving model interpretability. Due to multicollinearity and redundancy, traditional approaches often encounter difficulties when dealing with high-dimensional data. We propose a hybrid framework called Fuzzy Feature Selection using Fuzzy C-Means Clustering and Recursive Feature Elimination (FCM-RFE), which combines fuzzy logic, filter, and wrapper approaches, to address these problems. In order to capture complex relationships, fuzzy C-Means clustering first partitions related features into soft clusters. Then, within each cluster, less significant features are repeatedly eliminated using Recursive Feature Elimination with Random Forest (RFE-RF). For more precise selection, features are ranked according to the strength of their cluster link using a fuzzy membership-based scoring system. Experiments on 18 benchmark datasets using KNN and SVM classifiers evaluated metrics including accuracy, precision, recall, F1-score, specificity, and AUC-ROC. The proposed approach maintained or enhanced performance while significantly decreasing dimensionality, selecting, on average, only 4.1% of the original features. The maximum accuracy was 92.75% for SVM with FCM-RFE and 89% for KNN. The proposed method demonstrated effectiveness and scalability for high-dimensional data analysis, outperforming eight state-of-the-art techniques and demonstrating computing efficiency. This framework is suitable for high-dimensional data analysis in various disciplines because it not only increases classification performance but also improves interpretability and scalability.