... embeds KPCA-derived hidden nodes computed via a divide-and-conquer approximation strategy. This approach drastically reduces time complexity from O(n³) to approximately O(n log n), enabling applicability to large-scale datasets. Findings Experiments on 10 big data benchmarks demonstrate...