To improve the network performance of radial basis function (RBF) and back-propagation (BP) networks on complex nonlinear problems, an integrated neural network model with pre-RBF kernels is proposed. The proposed method is based on the framework of a single optimized BP network and an RBF network. By integrating and connecting the RBF kernel mapping layer and BP neural network, the local features of a sample set can be effectively extracted to improve separability; subsequently, the connected BP network can be used to perform learning and classification in the kernel space. Experiments on an artificial dataset and three benchmark datasets show that the proposed model combines the advantages of RBF and BP networks, as well as improves the performances of the two networks. Finally, the effectiveness of the proposed method is verified.

This study discusses the global asymptotical synchronization of fractional-order multi-delay coupled neural networks (FMCNNs) via hybrid control schemes. In addition to internal delays and different coupling delays, more importantly, multi-link complicated structures are introduced into our model. Unlike most existing works, the synchronization target is not the special solution of an isolated node, and a more universally accepted synchronization goal involving the average neuron states is introduced. A generalized multi-delay impulsive comparison principle with fractional order is given to solve the difficulties resulting from different delays and multi-link structures. To reduce control costs, a pinned node strategy based on the principle of statistical sorting is provided, and then a new hybrid impulsive pinning control method is established. Based on fractional-order impulsive inequalities, Laplace transforms, and fractional order stability theory, novel synchronization criteria are derived to guarantee the asymptotical synchronization of the considered FMCNN. The derived theoretical results can effectively extend the existing achievements for fractional-order neural networks with a multi-link nature.

The global $\mu$-synchronization problem for nonlinear multi-weighted complex dynamical networks with uncertain parameter perturbation and mixed time-varying delays is investigated in this paper. Unlike other existing works, all delays, including sampling and internal and coupling delays, are assumed to be unbounded, making the considered model more general and practical. Based on the generalized impulsive comparison principles, a time-varying impulsive controller with sampling delays is designed, and some new sufficient conditions are obtained to make drive–response multi-weighted networks reach $\mu$-synchronization. In addition, the external coupling matrices do not need to meet the requirement of zero-row sum, and the limitation of time delay on pulse interval is weakened. The results obtained in this article can be seen as extensions of previous related research.

Evolutionary algorithms have been widely used for tackling multi-objective optimization problems, while feature selection in classification can also be seen as a discrete bi-objective optimization problem that pursues minimizing both the classification error and the number of selected features. However, traditional multi-objective evolutionary algorithms (MOEAs) can encounter setbacks when the dimensionality of features explodes to a large scale, i.e., the curse of dimensionality. Thus, in this paper, we focus on designing an adaptive MOEA framework for solving bi-objective feature selection, especially on large-scale datasets, by adopting hybrid initialization and effective reproduction (called HIER). The former attempts to improve the starting state of evolution by composing a hybrid initial population, while the latter tries to generate more effective offspring by modifying the whole reproduction process. Moreover, the statistical experiment results suggest that HIER generally performs the best on most of the 20 test datasets, compared with six state-of-the-art MOEAs, in terms of multiple metrics covering both optimization and classification performances. Then, the component contribution of HIER is also studied, suggesting that each of its essential components has a positive effect. Finally, the computational time complexity of HIER is also analyzed, suggesting that HIER is not time-consuming at all and shows promising computational efficiency.