A unified and scalable machine learning framework for feature fusion in object classification using weighted PCA with adaptive concatenation and dynamic scaling
Bibliographic record
Abstract
Feature fusion is essential for enhancing the performance of machine learning classifiers, particularly when managing heterogeneous, high-dimensional, and multimodal datasets. In this work, we propose Weighted PCA with Adaptive Concatenation and Dynamic Scaling (WPCA-ACDS) , a novel feature fusion technique designed to address challenges such as overfitting, high dimensionality, and noise sensitivity. WPCA-ACDS integrates three key components: Weighted Principal Component Analysis (Weighted PCA) for efficient dimensionality reduction, Adaptive Concatenation for optimal feature selection based on data-driven strategies, and Dynamic Scaling to balance feature contributions and mitigate the impact of outliers or irrelevant features. Through extensive empirical evaluation on five benchmark datasets—CIFAR-10, Caltech-101, Scene-15, MNIST, and Oxford Pets—utilizing five classifiers (SVM, Random Forest, KNN, Logistic Regression, and Decision Trees), we demonstrate that WPCA-ACDS outperforms several state-of-the-art fusion techniques, including Simple Concatenation , PCA-based Concatenation , Average Fusion , Weighted Average Fusion , Product-based Fusion , cv-weight , Multiple Kernel Learning (MKL) , Collaborative Boosting and Dominant Set Fusion . WPCA-ACDS excels in terms of classification accuracy , robustness to noise and high-dimensional data , and computational scalability . Additionally, sensitivity and trade-off analyses emphasize WPCA-ACDS's versatility, solidifying its position as a robust and scalable solution for modern machine learning tasks. Ablation studies further reveal the critical role of each component, demonstrating that the full WPCA-ACDS framework consistently outperforms all ablated variants in classification performance. This establishes WPCA-ACDS as an effective and comprehensive feature fusion technique for a wide range of machine learning tasks.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".