Performance Comparison of Dimensional Reduction using Principal Component Analysis with Alternating Least Squares in Modified Fuzzy Possibilistic C-Means and Fuzzy Possibilistic C-Means

Edi Satriyanto (1), Ni Wayan Surya Wardhani (2), Syaiful Anam (3), Wayan Firdaus Mahmudy (4)
(1) Faculty of Mathematics and Natural Science, Universitas Brawijaya, Malang, Indonesia
(2) Faculty of Mathematics and Natural Science, Universitas Brawijaya, Malang, Indonesia
(3) Faculty of Mathematics and Natural Science, Universitas Brawijaya, Malang, Indonesia
(4) Faculty of Computer Science, Universitas Brawijaya, Malang, Indonesia
Fulltext View | Download
How to cite (IJASEIT) :
Satriyanto, Edi, et al. “Performance Comparison of Dimensional Reduction Using Principal Component Analysis With Alternating Least Squares in Modified Fuzzy Possibilistic C-Means and Fuzzy Possibilistic C-Means”. International Journal on Advanced Science, Engineering and Information Technology, vol. 14, no. 2, Apr. 2024, pp. 483-91, doi:10.18517/ijaseit.14.2.19911.
The clustering method is said to be good if it has resistance to outlier data. One cluster method resistant to outlier data is Fuzzy Possibilistic C-Means (FPCM). FPCM performance on outlier data still has the potential for overlap between cluster members in different clusters, resulting in decreased cluster quality. The Modified Fuzzy Possibilistic C-Means (MFPCM) method is used to modify FPCM in its objective function by inserting updated weight values to increase FPCM performance. In this research, improving the quality of FPCM and MFPCM clusters was carried out by reducing data dimensions through Principal Component Analysis using Alternating Least Squares (PRINCALS) so that members of each cluster do not overlap in the right cluster. The PRINCALS results of the FPCM method have better performance with silhouette values and BSS/TSS ratios of 0.4108 and 60% compared to values without PRINCALS of 0.355 and 43%. The MFPCM method with PRINCALS also performs better, namely 0.4299 and 61%, compared to 0.368 and 42% without PRINCALS. In this study, the performance of MFPCM with PRINCALS or without PRINCALS was better than that of the FPCM method. Overall, PRINCALS can improve the performance of the MFPCM and FPCM methods, resulting in better clusters. PRINCALS in this cluster produce an average silhouette value greater than 0.3 and an average BSS/TSS ratio greater than 50% so that each cluster member is in the right cluster and does not overlap.

A. Kumar and S. S. Sodhi, “Comparative analysis of fuzzy C-Means and K-Means clustering in the case of image segmentation,” Proc. 2021 8th Int. Conf. Comput. Sustain. Glob. Dev. INDIACom 2021, pp. 194–200, 2021, doi: 10.1109/INDIACom51348. 2021.00035.

D. Mansoor Hussain, M. Anuroopa, A. Dharshini, and G. Durganandini, “Efficient Bone Tumor Detection and Classification using Fuzzy C Means Clustering Algorithm,” Proc. 5th Int. Conf. Trends Electron. Informatics, ICOEI 2021, pp. 1422–1428, 2021, doi:10.1109/ICOEI51242.2021.9452876.

D. Czerwinski, M. Czerwinska, P. Karczmarek, and A. Kiersztyn, “Influence of the Fuzzy Robust Gamma Rank Correlation, Fuzzy C-Means, and Fuzzy Cognitive Maps to Predict the Z Generation’s Acceptance Attitudes towards Internet Health Information,” IEEE Int. Conf. Fuzzy Syst., vol. 2021-July, 2021, doi:10.1109/FUZZ45933.2021.9494596.

D. G. Savakar and A. K. Talawar, “Fuzzy C-Means clustering based identification of indian common non-leafy vegetables,” Proc. 2021 8th Int. Conf. Comput. Sustain. Glob. Dev. INDIACom 2021, vol. 591156, no. c, pp. 858–863, 2021, doi: 10.1109/INDIACom51348.2021.00154.

L. Ge, S. Member, and K. K. Parhi, “Robust Clustering using Hyperdimensional Computing,” IEEE Open J. Circuits Syst., vol. PP, no. Xx, p. 1, 2024, doi: 10.1109/OJCAS.2024.3381508.

Z. Li and Y. Li, “COCL: Cluster Combined with Outlier Contrast Learning for Unsupervised Person Re-Identification,” Proc. - 2023 IEEE SmartWorld, Ubiquitous Intell. Comput. Auton. Trust. Veh. Scalable Comput. Commun. Digit. Twin, Priv. Comput. Data Secur. Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PCDS/Metaverse 2023, pp. 1–8, 2023, doi: 10.1109/SWC57546.2023.10449321.

C. Wu and X. Guo, “A Novel Single Fuzzifier Interval Type-2 Fuzzy C-Means Clustering with Local Information for Land-Cover Segmentation,” IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens., vol. 14, pp. 5903–5917, 2021, doi:10.1109/JSTARS.2021.3085606.

H. Yadav, J. Singh, and A. Gosain, “Experimental Analysis of Fuzzy Clustering Techniques for Outlier Detection,” Procedia Comput. Sci., vol. 218, pp. 959–968, 2022, doi: 10.1016/j.procs.2023.01.076.

M. H. F. Zarandi, S. Sotudian, and O. Castillo, “A new validity index for fuzzy-possibilistic c-means clustering,” Sci. Iran., vol. 28, no. 4, pp. 2277–2293, 2021, doi: 10.24200/SCI.2021.50287.1614.

A. Saha and S. Das, “On the unification of possibilistic fuzzy clustering: Axiomatic development and convergence analysis,” Fuzzy Sets Syst., vol. 340, pp. 73–90, 2018, doi:10.1016/j.fss.2017.07.005.

T. Xiao, Y. Wan, J. Chen, W. Shi, J. Qin, and D. Li, “Multiresolution-Based Rough Fuzzy Possibilistic,” vol. 16, pp. 570–580, 2023.

R. Devi, “Unsupervised Kernel-Induced Fuzzy Possibilistic C-Means Technique in Investigating Real-World Data,” J. Phys. Conf. Ser., vol. 2199, no. 1, 2022, doi: 10.1088/1742-6596/2199/1/012033.

Z. Rustam, J. Pandelaki, D. A. Utami, R. Hidayat, and A. A. Ramli, “Comparison support vector machine and fuzzy possibilistic C-Means based on the kernel for knee osteoarthritis data classification,” Int. J. Adv. Sci. Eng. Inf. Technol., vol. 9, no. 6, pp. 2142–2146, 2019, doi:10.18517/ijaseit.9.6.9243.

T. Thilagaraj and N. Sengottaiyan, “Implementation of fuzzy C-means and fuzzy possibilistic C-means algorithms to find the low performers using R-tool,” Int. J. Sci. Technol. Res., vol. 8, no. 8, pp. 1697–1701, 2019.

S. Kushwaha and K. S. Jadon, “Improved performance using fuzzy possibilistic C-Means clustering algorithm in wireless sensor network,” Proc. - 2020 IEEE 9th Int. Conf. Commun. Syst. Netw. Technol. CSNT 2020, pp. 134–139, 2020, doi: 10.1109/CSNT48778.2020.9115740.

H. A. Gangadwala and R. M. Gulati, “Analysis of Web Usage Mining Using Various Fuzzy Techniques and Cluster Validity Index,” 2022 1st Int. Conf. Electr. Electron. Inf. Commun. Technol. ICEEICT 2022, pp. 1–7, 2022, doi:10.1109/ICEEICT53079.2022.9768580.

T. Thilagaraj and N. Sengottaiyan, “Implementation of fuzzy possibilistic product partition C-means and modified fuzzy possibilistic C-means clustering to pick the low performers using R-tool,” Int. J. Recent Technol. Eng., vol. 8, no. 2, pp. 5942–5946, 2019, doi:10.35940/ijrte.B3580.078219.

N. Tressa, “Customer-Based Market Segmentation using Clustering in Data mining,” 2024 2nd Int. Conf. Intell. Data Commun. Technol. Internet Things, pp. 687–691, 2024, doi:10.1109/IDCIoT59759.2024.10467258.

S. Tokat, K. Karagul, Y. Sahin, and E. Aydemir, “Fuzzy c-means clustering-based key performance indicator design for warehouse loading operations,” J. King Saud Univ.- Comput. Inf. Sci.,vol.34, no.8, pp. 6377–6384,2022, doi:10.1016/j.jksuci.2021.08.003.

A. Wu, C. Deng, S. Member, and W. Liu, “Unsupervised Out-of-Distribution Object Detection via PCA-Driven Dynamic Prototype Enhancement,” IEEE Trans. Image Process., vol. PP, p. 1, 2024, doi:10.1109/TIP.2024.3378464.

A. Hussein and A. Monfared, “Assessing Classical and Evolutionary Preprocessing Approaches for Breast Cancer Diagnosis,” 2024 20th CSI Int. Symp. Artif. Intell. Signal Process., pp. 1–8, 2024, doi:10.1109/AISP61396.2024.10475310.

H. Lee, Y. Jo, and J. Jeong, “Multivariate PCA-based Composite Criteria Evaluation Method for Anomaly Detection in Manufacturing Data,” 2024 26th Int. Conf. Adv. Commun. Technol., pp. 1–9, doi:10.23919/ICACT60172.2024.10471960.

A. K. Singh, S. Mitra, D. Chaudhuri, B. B. Chaudhuri, and M. P. Singh, “Optimization of Multi-Class Non-Linear SVM Image Classifier Using A Sobel Operator Based Feature Map and PCA,” 3rd Int. Conf. Range Technol. ICORT 2023, pp. 1–6, 2023, doi:10.1109/ICORT56052.2023.10249196.

P. R. V. Terlapu et al., “Optimizing Chronic Kidney Disease Diagnosis in Uddanam: A Smart Fusion of GA-MLP Hybrid and PCA Dimensionality Reduction,” Procedia Comput. Sci., vol. 230, no. 2023, pp. 522–531, 2023, doi:10.1016/j.procs.2023.12.108.

P. Gupta, A. Varshney, and K. Suneetha, “Exploring Non-linear Dimensionality Reduction Methodology for Enhanced Target Identification from Hyper Spectral Data,” 2024 Int. Conf. Optim. Comput. Wirel. Commun., pp. 1–6, 2024, doi:10.1109/ICOCWC60930.2024.10470745.

D. Ö. Şahin, O. E. Kural, S. Akleylek, and E. Kılıç, “Permission-based Android malware analysis by using dimension reduction with PCA and LDA,” J. Inf. Secur. Appl., vol. 63, no. October, p. 102995, 2021, doi:10.1016/j.jisa.2021.102995.

C. Liu et al., “Partial least squares regression and principal component analysis: Similarity and differences between two popular variable reduction approaches,” Gen. Psychiatry, vol. 35, no. 1, pp. 1–5, 2022, doi: 10.1136/gpsych-2021-100662.

L. Yu and C. Zhou, “Determining the Best Clustering Number of K-Means Based on Bootstrap Sampling,” Proc. - 2nd Int. Conf. Data Sci. Bus. Anal. ICDSBA 2018, pp. 78–83, 2018, doi:10.1109/ICDSBA.2018.00022.

F. Nie, X. Dong, Z. Hu, R. Wang, and X. Li, “Discriminative Projected Clustering via Unsupervised LDA,” IEEE Trans. Neural Networks Learn. Syst., vol. 34, no. 11, pp. 9466–9480, 2023, doi:10.1109/TNNLS.2022.3202719.

A. Bosisio et al., “Performance assessment of load profiles clustering methods based on silhouette analysis,” 21st IEEE Int. Conf. Environ. Electr. Eng. 2021 5th IEEE Ind. Commer. Power Syst. Eur. EEEIC /I CPS Eur. 2021 - Proc., pp. 1–6, 2021, doi:10.1109/EEEIC/ICPSEurope51590.2021.9584629.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).