一种基于谱聚类分析的粒子群聚类算法

本文研究了谱聚类中NJW算法的样本最优划分问题.利用粒子群算法在聚类问题上搜索到的全局最优,获得了NJW算法对聚类样本的最优划分.推广了谱聚类算法在样本划分时的普适性和稳定性.实验对比验证该算法是有效的.     

基于扩散矩阵的半监督回归学习

半监督学习算法用到标记和未标记的样本.大量的实验表明,利用无标记样本可以改进学习算法的逼近性能.然而,当样本数增加时,逼近性能的定量分析几乎没有.本文构造基于扩散矩阵的一种半监督学习算法,建立逼近阶.结果还量化地说明,未标记样本的使用可以减少逼近误差.     

鲁棒半监督ν-支持向量分类机

支持向量机在近十年成为机器学习的主要学习技术,而且已经成功应用到有监督学习问题中。Fung和Mangasarian利用支持向量机对于既有已标类别样本又有未知类别样本的训练集进行训练,方法主要是利用少量已标明类别的样本进行训练得到一个分类器的同时对于未标明类别的样本进行分类,使得间隔最大化。此优化问题中假定样本是精确的,而在现实生活中,样本通常带有统计误差。因此,考虑样本带有扰动信息的半监督两类分类问题,给出鲁棒半监督v-支持向量分类算法。该算法的参数v易于选择,而数值试验也表明该算法具有良好的稳定性和较好的分类结果。     

用LDA Boosting算法进行客户流失预测

本文提出一种LDA boost(Linear Discriminant Analysis boost)分类方法,该算法能有效利用样本的所有特征,并且能够从高维特征空间里提取并组合优化出最具有判别能力的低维特征,使得样本类间离散度和类内离散度的比值最大,从而不会产生过度学习,大大提高算法效率。该算法有效性在某商业银行的客户流失预测过程的真实数据集中得到了验证。与其他同类算法,如人工神经网络、决策树、支持向量机等运算结果相比,该方法可以显著提高运算精度。同时,LDAboosting与其他boosting算法相比,也具有显著的优越性。     

An Electrocardiogram Signal Classification Algorithm Based on Improved Deep Residual Shrinkage Networks北大核心CSCD

心电信号分类是医疗保健领域的重要研究内容.针对大多数方法不能很好地降低样本数量少的类别漏诊率,以及降低预处理操作的复杂性问题,提出了一种基于改进深度残差收缩网络(IDRSN)的心电信号分类算法(即DRSL算法).首先,使用合成少数类过采样技术(SMOTE)扩充数量少的类别样本,从而解决了类不平衡问题;其次,利用改进深度残差收缩网络提取空间特征,其残差模块可以避免网络层加深造成的过拟合,压缩激励和软阈值化子网络可以提取重要局部特征并自动去除噪声;然后,通过长短期记忆网络(LSTM)提取时间特征;最后,利用全连接网络输出分类结果.在MIT-BIH心律失常数据集上的实验结果表明,该算法的分类性能优于IDRSN、DRSN、GAN+2DCNN、CNN+LSTM_ATTENTION、SE-CNN-LSTM分类算法.     

一种新的基于K-means改进SMOTE算法在不平衡数据集分类中的应用

在实际应用中,经常遇到数据分类集合中某一类的样本数量明显少于其他类的样本数量的数据不平衡问题.在二分类数据集中,一般称样本数目多的一类数据集合为正类,样本数目少的一类数据集合为负类.为了提高算法在不平衡数据集下的分类性能,提出了首先利用K-means找出负类中心点,再根据SMOTE基本原理,得出新的数据集.通过对比新数据集和原不平衡数据集在不同算法中的分类应用,结果表明本文改进算法的分类效果得到明显提升,最后用两两配对T检验验证算法的有效性.     

子空间聚类的重建模型及其快速算法

有限样本的子空间数据聚类建模及其大规模计算是子空间学习面临的主要问题.现有的大多数模型都不适合大规模计算.本文提出了一个新的优化模型,结合谱投影反馈和辅助信息优化.在提升模型的学习能力的同时,采用高效的分片符号更新算法,可以适合大规模计算.我们用较大规模的模拟例子和实际例子,分析检验了新的优化模型及其快速算法的优于现有其他模型与算法的有效性.     

基于覆盖度的银行客户分类模型

投资收入是银行的主要收入来源之一。近年来,客户的投资意向显著降低,银行的投资收入减少。因此,银行希望将营销工作重点放在订阅概率更高的客户上。然而,繁多的客户样本以及客户信息导致银行的客户筛选工作低效。面对庞大的客户信息数据,粗糙集理论可以在不影响决策分类结果的前提下,通过属性约简删除属性集中的冗余属性,并导出问题的决策规则,提高效率。但在传统的属性约简过程中,没有针对进入正域的噪声样本进行控制,导致噪声特征被加入约简集。本文基于高效的相关族定义覆盖度,限制进入正域的样本。实验结果表明,覆盖度算法能够提高分类算法准确度及稳定性。最后,本文并将算法运用于银行客户分类实际问题中,剔除无用信息,筛选出关键属性,提高了分类准确度和稳定性,构建简洁高效的银行客户分类模型。     

基于门限接受算法的正交最小一乘回归新算法

正交最小一乘方法由于其稳健性而在工程中有广泛的应用,然而求解线性模型正交最小一乘参数估计算法往往过于复杂或者只对样本和变量个数较少的问题适用.把正交最小一乘参数估计问题转化为组合优化问题,再使用门限接受算法求解,通过计算机仿真说明了本文算法的正确性和有效性.     

高斯核正则化学习算法的泛化误差

对广义凸损失函数和变高斯核情形下正则化学习算法的泛化性能展开研究.其目标是给出学习算法泛化误差的一个较为满意上界.泛化误差可以利用正则误差和样本误差来测定.基于高斯核的特性,通过构构建一个径向基函数(简记为RBF)神经网络,给出了正则误差的上界估计,通过投影算子和再生高斯核希尔伯特空间的覆盖数给出样本误差的上界估计.所获结果表明,通过适当选取参数σ和λ,可以提高学习算法的泛化性能.     

An adaptive simulated annealing algorithm

In this paper, inspired by the idea of Metropolis algorithm, a new sample adaptive simulated annealing algorithm is constructed on finite state space. This new algorithm can be considered as a substitute of the annealing of iterative stochastic schemes. The convergence of the algorithm is shown.     

Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation

Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.     

Applying an edit distance to the matching of tree ring sequences in dendrochronology

In dendrochronology wood samples are dated according to the tree rings they contain. The dating process consists of comparing the sequence of tree ring widths in the sample to a dated master sequence. Assuming that a tree forms exactly one ring per year a simple sliding algorithm solves this matching task.

But sometimes a tree produces no ring or even two rings in a year. If a sample sequence contains this kind of inconsistencies it cannot be dated correctly by the simple sliding algorithm. We therefore introduce a algorithm for dating such a sample sequence against an error-free master sequence, where n and m are the lengths of the sequences. Our algorithm takes into account that the sample might contain up to missing or double rings and suggests possible positions for these kind of inconsistencies. This is done by employing an edit distance as the distance measure.     

A particle swarm algorithm for inspection optimization in serial multi-stage processes

Implementing efficient inspection policies is much important for the organizations to reduce quality related costs. In this paper, a particle swarm optimization (PSO) algorithm is proposed to determine the optimal inspection policy in serial multi-stage processes. The policy consists of three decision parameters to be optimized; i.e. the stages in which inspection occurs, tolerance of inspection, and size of sample to inspect. Total inspection cost is adopted as the performance measure of the algorithm. A numerical example is investigated in two phases, i.e. fixed sample size and sample size as a decision parameter, to ensure the practicality and validity of the proposed PSO algorithm. It is shown that PSO gives better results in comparison with two other algorithms proposed by earlier works.     

Lasso变量选择的分布式算法

Lasso是机器学习中比较常用的一种变量选择方法,适用于具有稀疏性的回归问题.当样本量巨大或者海量的数据存储在不同的机器上时,分布式计算是减少计算时间提高效率的重要方式之一.本文在给出Lasso模型等价优化模型的基础上,将ADMM算法应用到此优化变量可分离的模型中,构造了一种适用于Lasso变量选择的分布式算法,证明了...     

新组合模型在光电功率预测中的应用

为提高光伏预测要求的精准性,文章提出一种新算法将神经网络和ARMA算法改进组合,构成NEW ARMA-BP模型算法.以某30兆瓦的光伏电站采集的输出功率为输入样本,基于ARMA和BP神经网络算法在Matlab环境下依次搭建了相应的预测模型,预估光伏短期输出量.采用"误差正态检验图"判断基于两种不同算法的误差水平,依据两种单模型预测误差,运用所提出的新方法计算权值并获得新的预测值.基于Matlab的仿真结论验证了组合预测在光伏输出预测领域的适用性.     

快速均值漂移图像分割算法研究

Mean shift算法是一种搜索与样本点分布最接近模式的非参数统计方法.但它是一种迭代统计方法,要保证较高的数值计算精度需要较多的迭代次数,耗费较长的计算时间.为克服这一缺点,提出快速均值漂移图像分割算法.该算法在每次迭代时以前一次的聚类中心集合T动态地更新样本集S,并通过使用直方图缩小样本点的搜索范围进一步加快算法的收敛速度.实验结果表明该方法在保证图像分割质量的同时具有较快的收敛速度.     

多元地学信息挖掘中分层动量增项自适应BP算法应用研究

地球化学元素分布规律的研究是揭示元素矿化富集及空间变化规律的重要途径之一,采用人工神经网络方法对东天山地区地球化学信息进行了研究,为矿区靶区预测提供支持.对传统BP算法进行了改进,采用分层动量增项自适应BP算法设计,并完成了样本区数据的预测分析,效果较好.     

An analytically derived cooling schedule for simulated annealing

We present an analytically derived cooling schedule for a simulated annealing algorithm applicable to both continuous and discrete global optimization problems. An adaptive search algorithm is used to model an idealized version of simulated annealing which is viewed as consisting of a series of Boltzmann distributed sample points. Our choice of cooling schedule ensures linearity in the expected number of sample points needed to become arbitrarily close to a global optimum.     

Subset simulation for multi-objective optimization

Subset simulation is an efficient Monte Carlo technique originally developed for structural reliability problems, and further modified to solve single-objective optimization problems based on the idea that an extreme event (optimization problem) can be considered as a rare event (reliability problem). In this paper subset simulation is extended to solve multi-objective optimization problems by taking advantages of Markov Chain Monte Carlo and a simple evolutionary strategy. In the optimization process, a non-dominated sorting algorithm is introduced to judge the priority of each sample and handle the constraints. To improve the diversification of samples, a reordering strategy is proposed. A Pareto set can be generated after limited iterations by combining the two sorting algorithms together. Eight numerical multi-objective optimization benchmark problems are solved to demonstrate the efficiency and robustness of the proposed algorithm. A parametric study on the sample size in a simulation level and the proportion of seed samples is performed to investigate the performance of the proposed algorithm. Comparisons are made with three existing algorithms. Finally, the proposed algorithm is applied to the conceptual design optimization of a civil jet.