首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
信用分类是信用风险管理中一个重要环节,其主要目的是根据信用申请客户提供的资料从申请客户中区分出可信客户和违约客户,以便为信用决策者提供决策依据.为了正确区分不同的信用客户,特别是违约客户,结合核主元分析和支持向量机算法构造基于核主元分析的带可变惩罚因子最小二乘模糊支持向量机模型对信用数据进行了分类处理.在基于核主元分析的带可变惩罚因子最小二乘模糊支持向量机模型中,首先对样本数据进行预处理,然后利用核主元分析以非线性方式降低数据的维数,最后利用带可变惩罚因子最小二乘模糊支持向量机模型对降维后数据进行分类分析.为了验证,选择两个公开的信用数据集来进行实证分析.实证结果表明:基于核主元分析的带可变惩罚因子最小二乘模糊支持向量机模型取得了较好的分类结果,可为信用决策者提供重要的决策参考依据.  相似文献   

2.
利用粒子群优化算法对支持向量机参数进行优化,主成分分析法对众多的降水因子进行特征提取,将取得的主成分作为优化支持向量机的特征向量建立优化支持向量机降水预测模型,并对广西降水进行预测.仿真结果表明,粒子群优化支持向量机的预测结果与降水实际值有很好的一致性,通过与其他模型进行比较,表明了模型拟合和泛化能力方面的优越性.  相似文献   

3.
利用传统支持向量机(SVM)对不平衡数据进行分类时,由于真实的少数类支持向量样本过少且难以被识别,造成了分类时效果不是很理想.针对这一问题,提出了一种基于支持向量机混合采样的不平衡数据分类方法(BSMS).该方法首先对经过支持向量机分类的原始不平衡数据按照所处位置的不同划分为支持向量区(SV),多数类非支持向量区(MNSV)以及少数类非支持向量区(FNSV)三个区域,并对MNSV区和FNSV区的样本做去噪处理;然后对SV区分类错误和部分分类正确且靠近决策边界的少数类样本重复进行过采样处理,直到找到测试结果最优的训练数据集;最后有选择的随机删除MNSV区的部分样本.实验结果表明:方法优于其他采样方法.  相似文献   

4.
将主成分分析和支持向量机回归相结合,以广西5、6月区域平均日降水量作为预报对象,进行区域日降水量预测研究.首先,整理分析大量的T213数值预报产品信息数据进行主成分分析,得到主成分数据序列;其次,根据主成分数据序列建立训练集训练支持向量机,并利用遗传算法优化参数;最后,输入支持向量机所需数据,得到主成分预测结果,建立广西日降水预报模型.实例计算结果表明,支持向量机回归模型比逐步回归模型有更好的预测能力.  相似文献   

5.
讨论了线性v-支持向量回归机中参数v的意义,并给出了严格的理论证明。利用v-支持向量回归机中ε-不敏感损失函数及参数v的意义,提出一种回归数据中的异常值检测方法。采用线性模型使得该方法不仅速度快而且能处理大规模数据。数值实验证明其具有可行性和有效性。  相似文献   

6.
提出一种树叶分类方法.在数据方面,所获得数据既包含树叶的图形信息数据,也包含树叶的纹理信息.在前期数据预处理阶段,采用主成分分析方法对原始数据进行降维处理,从16个特征中提取出3个主成分,且累计主成分贡献率达到85%以上.在后期数据分析处理阶段,用支持向量机对树叶数据进行分类预测,并用粒子群算法对支持向量机参数进行寻优处理,提高分类精度.实验结果表明,相对于遗传算法和网格搜索法寻到的最优参数相比,粒子群算法优化支持向量机具有最高的准确率,高达94.1%,高于其他两种分类方法.  相似文献   

7.
采用基于主成分分析的支持向量机方法对上海房价进行预测.首先利用主成分分析法对原始数据进行降维处理,然后利用具有高水平的小样本学习能力的支持向量机进行预测模型的建立,对上海房价进行预测.实证显示,经过主成分分析的支持向量机模型能够较好地处理复杂的房地产数据,具有较高的预测能力,为上海房地产业的发展提供参考.特别地,该模型可以普遍应用于影响因素众多,时效性较强的短期小样本数据问题的预测,具有较高的泛化能力和很好的预测精度.  相似文献   

8.
支持向量回归机是解决回归问题的一个重要方法.在实际问题中由于测量及计算误差的存在,我们得到的数据往往只是真值的某种近似,带有一定的舍入误差,因此有必要研究支持向量回归机的数据扰动问题.考虑到线性回归问题在实际生活中有广泛的应用价值,把线性ε-支持向量回归机作为研究对象.由于最终关心的是它的原始问题的解,所以我们研究给定的训练集中输入数据发生微小地扰动后,原始问题的解的变化情况.在一定的条件下给出了解对扰动数据偏导数的表达式,建立了线性ε-支持向量回归机的原始问题的灵敏度分析定理.文中还进一步分析了建立该灵敏度分析定理所需要的条件,给出了条件减弱后的结果.文章最后还通过一些简单的数值试验验证了定理的准确性.  相似文献   

9.
基于非平衡数据集的支持向量域分类模型,提出了一种银行客户个人信用预测方法.首先分析了信用预测的主要方法及其不足,然后研究了支持向量域分类模型及其参数的非负二次规划乘性更新算法,进而提出基于支持向量域分类模型的银行客户个人信用预测方法,最后使用人工数据和实际数据对提出方法与支持向量机预测方法进行对比实验.实验结果表明对于银行客户个人信用预测的非平衡数据分析问题,基于支持向量域模型的分类预测方法更有效.  相似文献   

10.
电网项目融资租赁信用评价混合模型的新研究   总被引:1,自引:0,他引:1  
电网建设工程通过项目融资租赁进行快速融资的同时,给租赁公司带来巨大的信用风险.通过事前对承租人进行信用评价,能够有效降低信用风险损失.针对电网企业信用评价的多属性非线性特征,提出了基于独立分量分析技术-支持向量机的信用评价混合模型.首先,采用独立分量分析技术对信用属性数据进行属性重构,实现属性数据的去噪.然后,将重构后的新信用属性数据用于支持向量机的训练建模.最后,通过实例模拟对比分析了独立分量分析技术对支持向量机分类的有效性.结果表明,独立分量分析技术能够改善信用属性数据特征,并且在多属性分类问题中,独立分量分析技术有助于提高支持向量机分类的准确率.  相似文献   

11.
The kernel‐based statistical semantic topic model is introduced for comprehending three species of internationally important Ramsar wetland documents describing the Lashi Lake wetland in the Yunnan Province, the Yancheng wetland in the Jiangsu Province, and the Zoige wetland in the Sichuan Province of China. Latent Dirichlet allocation (LDA) features are used to represent the semantic components of wetland documents. Kernel principal component analysis (KPCA) maps the topic components to the kernel space to attain the low dimensional principal components. Support vector machines (SVMs) are used to comprehend the semantic distribution of distinct wetland documents in the kernel space. The LDA+KPCA+SVM algorithm reaches 77.0% training and 75.9% test accuracy and 0.902 training and 0.840 test mean average precision scores in the application of comprehending the wetland documents, respectively. The performance of the proposed kernel‐based model is superior to the traditional models of LDA+SVM and LDA+PCA+SVM.  相似文献   

12.
Kernel principal component analysis (KPCA) extends linear PCA from a real vector space to any high dimensional kernel feature space. The sensitivity of linear PCA to outliers is well-known and various robust alternatives have been proposed in the literature. For KPCA such robust versions received considerably less attention. In this article we present kernel versions of three robust PCA algorithms: spherical PCA, projection pursuit and ROBPCA. These robust KPCA algorithms are analyzed in a classification context applying discriminant analysis on the KPCA scores. The performances of the different robust KPCA algorithms are studied in a simulation study comparing misclassification percentages, both on clean and contaminated data. An outlier map is constructed to visualize outliers in such classification problems. A real life example from protein classification illustrates the usefulness of robust KPCA and its corresponding outlier map.  相似文献   

13.
《Applied Mathematical Modelling》2014,38(11-12):2800-2818
Electrical discharge machining (EDM) is inherently a stochastic process. Predicting the output of such a process with reasonable accuracy is rather difficult. Modern learning based methodologies, being capable of reading the underlying unseen effect of control factors on responses, appear to be effective in this regard. In the present work, support vector machine (SVM), one of the supervised learning methods, is applied for developing the model of EDM process. Gaussian radial basis function and ε-insensitive loss function are used as kernel function and loss function respectively. Separate models of material removal rate (MRR) and average surface roughness parameter (Ra) are developed by minimizing the mean absolute percentage error (MAPE) of training data obtained for different set of SVM parameter combinations. Particle swarm optimization (PSO) is employed for the purpose of optimizing SVM parameter combinations. Models thus developed are then tested with disjoint testing data sets. Optimum parameter settings for maximum MRR and minimum Ra are further investigated applying PSO on the developed models.  相似文献   

14.
提出了一种基于人脸重要特征的人脸识别方法,首先选取人脸的重要特征并将其具体化,对得到的重要特征进行主成分分析,然后用支持向量机(Support Vector Machine,SVM)设计重要特征分类器来确定测试人脸图像中重要特征,同时设计支持向量机(SVM)人脸分类器,确定人脸图像的所属类别.对ORL人脸图像数据库进行仿真实验,结果表明,该方法要优于一般的基于整体特征的人脸识别方法并有较强的鲁棒性.  相似文献   

15.
In this paper, we propose a novel method for image feature extraction, namely the two-dimensional local graph embedding, which is based on maximum margin criterion and thus not necessary to convert the image matrix into high-dimensional image vector and directly avoid computing the inverse matrix in the discriminant criterion. This method directly learns the optimal projective vectors from 2D image matrices by simultaneously considering local graph embedding and maximum margin criterion. The proposed method avoids huge feature matrix problem in Eigenfaces, Fisherfaces, Laplacianfaces, maximum margin criterion (MMC) and inverse matrix in 2D Fisherfaces, 2D Laplacianfaces and 2D Local Graph Embedding Discriminant Analysis (2DLGEDA) so that computational time would be saved for feature extraction. Experimental results on the Yale and the USPS databases show the effectiveness of the proposed method under various experimental conditions.  相似文献   

16.
Discretely defined surfaces that exhibit vertical displacements across unknown fault lines can be difficult to approximate accurately unless a representation of the faults is known. Accurate representations of these faults enable the construction of constrained approximation models that can successfully overcome common problems such as over-smoothing. In this paper we review an existing method for detecting fault lines and present a new detection approach based on data triangulations and discrete Gaussian curvature (DGC). Furthermore, we show that if the fault line can be described non-parametrically, then accurate support vector machine (SVM) models can be constructed that are independent of the type of triangulation used in the detection algorithms. We shall also see that SVM models are particularly effective when the data produced by the detection algorithms are noisy. We compare the performances of the various new and established models.  相似文献   

17.
We consider linear programming approaches for support vector machines (SVM). The linear programming problems are introduced as an approximation of the quadratic programming problems commonly used in SVM. When we consider the kernel based nonlinear discriminators, the approximation can be viewed as kernel principle component analysis which generates an important subspace from the feature space characterized the kernel function. We show that any data points nonlinearly, and implicitly, projected into the feature space by kernel functions can be approximately expressed as points lying a low dimensional Euclidean space explicitly, which enables us to develop linear programming formulations for nonlinear discriminators. We also introduce linear programming formulations for multicategory classification problems. We show that the same maximal margin principle exploited in SVM can be involved into the linear programming formulations. Moreover, considering the low dimensional feature subspace extraction, we can generate nonlinear multicategory discriminators by solving linear programming problems.Numerical experiments on real world datasets are presented. We show that the fairly low dimensional feature subspace can achieve a reasonable accuracy, and that the linear programming formulations calculate discriminators efficiently. We also discuss a sampling strategy which might be crucial for huge datasets.  相似文献   

18.
为快速、准确地对胎膜早破进行预测,首次应用了一种新型的数据挖掘技术-支持向量机预测模型.该模型针对所获取的胎膜早破及正常破膜数据集100个病例进行建模,并与神经网络、Logistic回归建模的性能进行了比较.结果表明,支持向量机具有可调参数少、学习速度快等优点,计算所得到的结果无论从准确率,还是所获取知识的可理解性等方面,都优于常用的神经网络等方法.用支持向量机方法建立的胎膜早破预测模型合理可行.  相似文献   

19.
在支持向量机预测建模中,核函数用来将低维特征空间中的非线性问题映射为高维特征空间中的线性问题.核函数的特征对于支持向量机的学习和预测都有很重要的影响.考虑到两种典型核函数—全局核(多项式核函数)和局部核(RBF核函数)在拟合与泛化方面的特性,采用了一种基于混合核函数的支持向量机方法用于预测建模.为了评价不同核函数的建模效果、得到更好的预测性能,采用遗传算法自适应进化支持向量机模型的各项参数,并将其应用于装备费用预测的实际问题中.实际计算表明采用混合核函数的支持向量机较单一核函数时有更好的预测性能,可以作为一种有效的预测建模方法在装备管理中推广应用.  相似文献   

20.
The existing support vector machines (SVMs) are all assumed that all the features of training samples have equal contributions to construct the optimal separating hyperplane. However, for a certain real-world data set, some features of it may possess more relevances to the classification information, while others may have less relevances. In this paper, the linear feature-weighted support vector machine (LFWSVM) is proposed to deal with the problem. Two phases are employed to construct the proposed model. First, the mutual information (MI) based approach is used to assign appropriate weights for each feature of the whole given data set. Second, the proposed model is trained by the samples with their features weighted by the obtained feature weight vector. Meanwhile, the feature weights are embedded in the quadratic programming through detailed theoretical deduction to obtain the dual solution to the original optimization problem. Although the calculation of feature weights may add an extra computational cost, the proposed model generally exhibits better generalization performance over the traditional support vector machine (SVM) with linear kernel function. Experimental results upon one synthetic data set and several benchmark data sets confirm the benefits in using the proposed method. Moreover, it is also shown in experiments that the proposed MI based approach to determining feature weights is superior to the other two mostly used methods.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号