用混合算法优化概率神经网络,提升分类准确率与泛化能力。
Constrained Hybrid Metaheuristic Algorithm for Probabilistic Neural Networks Learning
- 融合多种启发式算法,分探查与精调两阶段优化网络参数。
- 在16个数据集上实现更快收敛与更优分类性能。
- 适合处理高维、不确定环境下的复杂分类任务。
本研究探索了混合启发式算法在增强概率神经网络(PNN)训练中的潜力,通过结合多种优化策略的互补优势来应对传统梯度方法在高维和不确定环境中的局限性。针对单一启发式算法难以充分探索解空间的问题,提出约束型混合启发式(cHM)算法,将蝙蝠算法(BAT)、模拟退火、花粉授粉算法、细菌觅食优化和粒子群优化等作为内部优化器集成于统一框架中。该方法分为两个阶段:初始探查阶段评估多个元启发式算法的表现并选择最优者,随后在拟合阶段由选定算法精细调整PNN以获得最佳平滑参数。实验在16个具有不同特征的数据集上进行,涵盖二分类与多分类任务、平衡与不平衡类别分布及多样特征维度。结果表明,cHM能有效整合各算法优势,实现更快收敛与更强鲁棒性,显著提升PNN在多样化数据集上的分类性能,验证了其应用灵活性与效率。
原文摘要 · Abstract (English)
This study investigates the potential of hybrid metaheuristic algorithms to enhance the training of Probabilistic Neural Networks (PNNs) by leveraging the complementary strengths of multiple optimisation strategies. Traditional learning methods, such as gradient-based approaches, often struggle to optimise high-dimensional and uncertain environments, while single-method metaheuristics may fail to exploit the solution space fully. To address these challenges, we propose the constrained Hybrid Metaheuristic (cHM) algorithm, a novel approach that combines multiple population-based optimisation techniques into a unified framework. The proposed procedure operates in two phases: an initial probing phase evaluates multiple metaheuristics to identify the best-performing one based on the error rate, followed by a fitting phase where the selected metaheuristic refines the PNN to achieve optimal smoothing parameters. This iterative process ensures efficient exploration and convergence, enhancing the network's generalisation and classification accuracy. cHM integrates several popular metaheuristics, such as BAT, Simulated Annealing, Flower Pollination Algorithm, Bacterial Foraging Optimization, and Particle Swarm Optimisation as internal optimisers. To evaluate cHM performance, experiments were conducted on 16 datasets with varying characteristics, including binary and multiclass classification tasks, balanced and imbalanced class distributions, and diverse feature dimensions. The results demonstrate that cHM effectively combines the strengths of individual metaheuristics, leading to faster convergence and more robust learning. By optimising the smoothing parameters of PNNs, the proposed method enhances classification performance across diverse datasets, proving its application flexibility and efficiency.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。