Cultural algorithm based principal component analysis (CA-PCA) approach for handling high dimensional data
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2024.15.spl.11Keywords:
Dimensionality reduction, Principal component analysis, Cultural algorithm, Healthcare domain.Dimensions Badge
Issue
Section
License
Copyright (c) 2024 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
The exponential growth of high-dimensional data in various domains, such as healthcare, finance, and image processing, presents significant challenges for efficient analysis and predictive modeling. Dimensionality reduction is a key technique to address these challenges, mitigating the curse of dimensionality while preserving the most relevant information. This paper proposes an optimization-based dimensionality reduction approach that integrates principal component analysis (PCA) with cultural algorithm (CA) optimization to enhance the handling of high-dimensional datasets. PCA is employed to transform the data by extracting principal components that capture the maximum variance. However, the selection of an optimal subset of components remains crucial for maintaining model accuracy and computational efficiency. To this end, the cultural algorithm is leveraged to optimize the selection of the most informative principal components by mimicking the evolutionary process of knowledge acquisition in a cultural framework. The proposed approach is validated through experiments on various high-dimensional datasets, demonstrating its superiority in reducing data dimensionality while maintaining high classification accuracy and reducing computational costs. The results highlight the effectiveness of combining PCA with cultural algorithm optimization for dimensionality reduction, paving the way for its application in large-scale real-world problems.Abstract
How to Cite
Downloads
Similar Articles
- P. Ananthi, A. Chandrabose, The socio-technical opportunities and threats of crowdsensing , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- S Selvakumari, M Durairaj, Performance Analysis of Deep Learning Optimizers for Arrhythmia Classification using PTB-XL ECG Dataset: Emphasis on Adam Optimizer , The Scientific Temper: Vol. 16 No. 11 (2025): The Scientific Temper
- UMASHANKAR SHUKLA, ANIL K. UPADHYAY, MATHEMATICAL MODEL FOR INFECTION AND REMOVAL IN POPULATION , The Scientific Temper: Vol. 10 No. 1&2 (2019): The Scientific Temper
- Neha Saini, Rashmi Verma, Rabia Basri Aziz, Ashmita Bhatt, Hem Chandra Pant, Naveen Gaurav, Effect of Growth Regulators on Direct Clonal Propagation and Analysis of Total Phenolic Content of Wild and Propagated Mucuna pruriens , The Scientific Temper: Vol. 13 No. 02 (2022): The Scientific Temper
- Sowmiya M, Banu Rekha B, Malar E, Assessment of transfer learning models for grading of diabetic retinopathy , The Scientific Temper: Vol. 14 No. 02 (2023): The Scientific Temper
- Akanksha Singh, Nand Kumar, Analysis of renewable energy and economic growth of Germany , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
- Kamna Kandpal, Piyashi Dutta, P.Sasikala Ravichandran, Examining the relationship between motivation and incentives in the context of maternal health awareness: A study of Asha workers in Uttarakhand , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Shane Desai, Bhaskar K. Pandya, Analyzing the Novels of T. S. Pillai and Perumal Murugan from Indian socio-political perspective , The Scientific Temper: Vol. 15 No. spl-2 (2024): The Scientific Temper
- Priya Nandhagopal, Jayasimman Lawrence, ECE cipher: Enhanced convergent encryption for securing and deduplicating public cloud data , The Scientific Temper: Vol. 16 No. 02 (2025): The Scientific Temper
- Veena Grace Carmel, Correlative Analysis of Cryptocurrencies and Stocks from Asset and Investment Perspective , The Scientific Temper: Vol. 16 No. 09 (2025): The Scientific Temper
<< < 30 31 32 33 34 35 36 37 38 39 > >>
You may also start an advanced similarity search for this article.

