The automatic model selection and variable kernel width for RBF neural networks

The Orthogonal Least Squares (OLS) algorithm has been extensively used in basis selection for RBF networks, but it is unable to perform model selection automatically because the tolerance ρ must be specified manually. This introduces noise and it is difficult to implement in the parametric complexity of real-time system. Therefore, a generic criterion that detects the optimum number of its basis functions is proposed. In this paper, not only the Bayesian Information Criterion (BIC) method, used for fitness calculation, is incorporated into the basis function selection process of the OLS algorithm for assigning its appropriate number, but also a new method is developed to optimize the widths of the Gaussian functions in order to improve the generalization performance. The augmented algorithm is employed to the Radial Basis Function Neural Networks (RBFNN) for known and unknown noise nonlinear dynamic systems and its performance is compared with the standard OLS; experimental results show that both the efficacy of BIC for fitness calculation and the importance of proper choice of basis function widths are significant.     

Gaussian kernel optimization: Complex problem and a simple solution

The Gaussian kernel function implicitly defines the feature space of an algorithm and plays an essential role in the application of kernel methods. The parameter of Gaussian kernel function is a scalar that has significant influences on final results. However, until now, it is still unclear how to choose an optimal kernel parameter. In this paper, we propose a novel data-driven method to optimize the Gaussian kernel parameter, which only depends on the original dataset distribution and yields a simple solution to this complex problem. The proposed method is task irrelevant and can be used in any Gaussian kernel-based approach, including supervised and unsupervised machine learning. Simulation experiments demonstrate the efficacy of the obtained results. A user-friendly online calculator is implemented at: www.csbio.sjtu.edu.cn/bioinf/kernel/ for public use.     

Fault tolerant machine learning for nanoscale cognitive radio

We introduce a machine learning-based classifier that identifies free radio channels for cognitive radio. The architecture is designed for nanoscale implementation, under nanoscale implementation constraints; we do not describe all physical details but believe future physical implementation to be feasible. The system uses analog computation and consists of cyclostationary feature extraction and a radial basis function network for classification. We describe a model for nanoscale faults in the system, and simulate experimental performance and fault tolerance in recognizing WLAN signals, under different levels of noise and computational errors. The system performs well under expected non-ideal manufacturing and operating conditions.     

An improved differential evolution algorithm for the task assignment problem

An improved differential evolution algorithm (IDE) is proposed to solve task assignment problem. The IDE is an improved version of differential evolution algorithm (DE), and it modifies two important parameters of DE algorithm: scale factor and crossover rate. Specially, scale factor is adaptively adjusted According to the objective function values of all candidate solutions, and crossover rate is dynamically adjusted with the increasement of iterations. The adaptive scale factor and dynamical crossover rate are combined to increase the diversity of candidate solutions, and to enhance the exploration capacity of solution space of the proposed algorithm. In addition, a usual penalty function method is adopted to trade-off the objective and the constraints. Experimental results demonstrate that the optimal solutions obtained by the IDE algorithm are all better than those obtained by the other two DE algorithms on solving some task assignment problems.     

基于区间直觉模糊集的C均值聚类算法

针对区间直觉模糊集(IVIFS)的聚类问题,提出了基于IVIFS的C均值聚类算法.算法首先应用IVIFS的欧氏距离,构造了聚类的目标函数;然后根据拉格朗日乘数法推导出聚类的迭代公式,得到IVIFS聚类算法;此外,还提出一种IVIFS聚类的有效性函数,并将此函数和聚类结合,给出可以确定最佳聚类类别数的聚类流程;最后通过实...     

P2P环境下电子商务信任评估机制研究

为了解决P2P环境下电子商务安全问题,在深入研究P2P环境下电子商务信任模型的基础上,针对传统信任模型不足的问题,提出了一种利用哈希函数将加入群的节点随机地分配到各个群的方法,降低了节点共谋攻击的危险。考虑到当一个节点偶尔提供一次恶意服务时,并不能证明是恶意节点,只需要给节点警告。引入了交易时间和交易规模、交易次数等因素来进行信任值的计算,利用惩罚项来限制交易节点提供恶意服务。节点的信任值很大程度上依靠同群节点和有外连接的群的节点来进行评估,仿真实验结果表明,该方法可以更加准确地评估节点的信任值,保证了网络的性能。     

支持向量机的进化多核设计

为提高支持向量机分类精度,提出一种基于遗传程序设计的进化多核算法.算法中每个个体表示一个多核函数,并采用树形结构进行编码,增强了多核函数的非线性;初始种群由生长法产生,经过遗传操作后得到适合具体问题的进化多核函数.遗传程序设计的全局搜索性能使得算法设计不需要先验知识.与单核函数及其他多核函数的对比实验结果表明,进化多核...     

未知时变时滞非线性参数化系统自适应迭代学习控制

针对含有未知时变参数和时变时滞的非线性参数化系统,提出了一种新的自适应迭代学习控制方法.该方法将参数分离技术与信号置换思想相结合,可以处理含有时变参数和时滞相关不确定性的非线性系统.设计了一种自适应控制策略,使跟踪误差的平方在一个有限区间上的积分渐近收敛于零.通过构造Lyapunov-Krasovskii型复合能量函数,给出了闭环系统收敛的一个充分条件.给出两个仿真例子验证了控制方法的有效性.     

基于改进“当前”统计模型的非线性机动目标跟踪算法

＂当前＂统计模型算法对目标加速度极限值及机动频率的依赖性这一缺点,导致该算法在跟踪弱机动目标及高机动目标时,跟踪性能会明显恶化.本文在当前统计（CS）模型的基础上,通过加权一个以残差方差的迹为参数的活化函数,对加速度方差和机动频率进行自适应处理,实现了对＂当前＂统计模型的改进;同时,采用UKF（unscented Kalman filter）对非线性目标进行跟踪滤波,构造出基于改进＂当前＂统计模型的非线性机动目标跟踪算法,仿真结果表明,改进的＂当前＂统计模型不仅保留了＂当前＂统计模型跟踪算法对一般机动目标跟踪精度高的特点,而且对弱机动目标跟踪也具有更优越的性能,大大扩大了机动跟踪范围.     

基于联合滤波算法的复杂时变系统在线自适应逆控制

针对一类结构和参数均具备时变特性的复杂时变系统,提出一种新的基于联合滤波算法的在线自适应逆控制方法.该方法在处理参数时变问题的同时可兼顾系统的结构时变特性,实现复杂动态系统的在线跟踪控制.同时提出新的联合Volterra核函数滤波算法,该算法克服了原Volterra滤波器计算复杂运算速度慢的缺点,实现了动态非线性系统的在线跟踪控制.通过仿真分析可以得出,对于此类线性、非线性复杂时变系统,基于新的联合滤波器的自适应逆控制方法可以快速有效的实现动态对象在线建模与控制.