基于Fuzzy理论的数据挖掘算法研究(Ⅰ)

“数据挖掘”是数据处理的一个新领域.支持向量机是数据挖掘的一种新方法,该技术在很多领域得到了成功的应用.但是,支持向量机目前还存在许多局限,当支持向量机的训练集中含有模糊信息时,支持向量机将无能为力.为解决一般情况下支持向量机中含有模糊信息(模糊参数)问题,研究了模糊机会约束规划、模糊分类中的模糊特征及其表示方法,建立了模糊支持向量分类机理论,给出了模糊线性可分的模糊支持向量分类机算法.     

应用模糊支持向量机进行英文情感分类

针对英文情感分类问题,对不同样本采用不同权重,通过引入模糊隶属度函数,通过计算样本模糊隶属度确定样本隶属某一类程度的模糊支持向量机分类算法,通过对比选取不同核函数和不同惩罚系数的结果.仿真实验结果表明应用模糊支持向量机进行英文情感分类具有较好的分类能力和较高的识别能力.     

基于核主元分析的带可变惩罚因子最小二乘模糊支持向量机模型及其在信用分类中的应用

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

基于灰色关联分析的模糊支持向量机中隶属度的确定

本文用灰色关联分析来替代模糊隶属度的求解,提出了一种新的有效地刻画样本不确定性的隶属度计算方法,理论上表明它是解决模糊支持向量机方法中一般使用特征空间中样本与类中心之间的距离关系构建隶属度函数的不足的方法之一,在一些特定条件下分类性能要强一些.     

用模糊集合描述模糊信息的无效性

用模糊集合描述模糊信息无效的原因是,把原本是论域与状态空间上二元函数的模糊隶属函数看成是论域上的一元函数,用模糊集合描述的模糊信息,不能支持模糊集合转换;使得通过模糊集合转换处理模糊信息的模糊数学,不得不借用不是数学计算、无缘数学模型的"取大取小"实现模糊集合转换;结果是背离数学计算的模糊数学,不能为处理模糊信息提供算法支持,导致大量需要处理的模糊信息滞留至今.还原模糊信息是高维状态空间上分类数据的真实面目,把处理模糊信息明确为由指标隶属度确定目标隶属度的隶属度转换,是模糊数学回归数学的唯一正确途径.     

基于支持向量机的区间模糊数时间序列预测

研究了区间模糊数时间序列的预测方法.首先将区间模糊数序列转换为等量信息的精确数序列,然后对精确数序列建立支持向量机回归模型,通过还原公式,得到区间模糊数序列的拟合值和预测值.最后给出了数值实验,实验结果表明方法有效可行,且比ARMA回归模型以及灰色模型的预测精度更高.     

基于模糊积分支持向量机集成的商业银行信用风险评估模型研究

信用风险管理一直是银行和其他金融机构最关心的问题之一.随着我国经济体制的改革深入、市场机制的建立与完善以及资本市场、银行业的迅速发展,现行的信用评估体制与方法赶不上经济改革发展的需要.本文建立了基于模糊积分的支持向量机集成方法,该方法综合考虑了子支持向量机的输出重要性.用此方法对商业银行的信用风险进行评估,并与单个支持向量机和最多投票原则的支持向量机集成进行比较,实证结果表明,本文提出的方法具有更高的分类精度,证实了该方法的可行性和有效性,为银行建立一套更加可靠的评估系统提供了理论依据.     

基于支持向量机混合采样的不平衡数据分类方法

利用传统支持向量机(SVM)对不平衡数据进行分类时,由于真实的少数类支持向量样本过少且难以被识别,造成了分类时效果不是很理想.针对这一问题,提出了一种基于支持向量机混合采样的不平衡数据分类方法(BSMS).该方法首先对经过支持向量机分类的原始不平衡数据按照所处位置的不同划分为支持向量区(SV),多数类非支持向量区(MN...     

支撑模糊集合转换的模糊逻辑是伪逻辑

模糊逻辑系统用模糊集合描述模糊信息、用模糊集合转换处理模糊信息.阐述支撑模糊集合转换的模糊逻辑为什么是伪逻辑的原因.指出定义在论域一个空间上的模糊集合,因为破坏了集合中元素的"不可分割性",所以模糊集合描述的模糊信息不能用数学计算通过模糊集合转换处理.实际应用中的模糊信息定义在论域与状态空间两个空间上,其正确表达方式是满足"归一化"条件的隶属度向量;处理的正确途径是,研究基于状态转移矩阵的隶属度转换;支撑隶属度转换的是近似推理逻辑,目的是使构建的隶属度转换模型是当前条件下人们可能构建的"最优"近似模型.     

基于支持向量回归机的水文混沌时间序列预测

支持向量机在系统辨识和分类研究方面比较成熟,目前尚没有提出有效的支持向量回归理论来解决非线性、时变、干扰的复杂问题.支持向量回归机主要用于因果关系点对的回归预测,把支持向量回归机应用于水文混沌时间序列的预测研究是一个有意义的工作.在支持向量机一般理论基础上,提出了水文混沌时间序列支持向量回归机模型,并就模型进行仿真计算,讨论了模型参数对支持向量回归机预测精度的影响,为模型参数寻优提供一般指导原则.直门达水文站径流量混沌时间序列支持向量回归机预测实验表明,水文混沌时间序列支持向量回归机模型是有效的.     

Minimum Class Variance SVM+ for data classification

In this paper, a new Support Vector Machine Plus (SVM+) type model called Minimum Class Variance SVM+ (MCVSVM+) is presented. Similar to SVM+, the proposed model utilizes the group information in the training data. We show that MCVSVM+ has both the advantages of SVM+ and Minimum Class Variance Support Vector Machine (MCVSVM). That is, MCVSVM+ not only considers class distribution characteristics in its optimization problem but also utilizes the additional information (i.e. group information) hidden in the data, in contrast to SVM+ that takes into consideration only the samples that are in the class boundaries. The experimental results demonstrate the validity and advantage of the new model compared with the standard SVM, SVM+ and MCVSVM.     

Un résultat de consistance pour des SVM fonctionnels par interpolation spline

This Note proposes a new methodology for function classification with Support Vector Machine (SVM). Rather than relying on projection on a truncated Hilbert basis as in our previous work, we use an implicit spline interpolation that allows us to compute SVM on the derivatives of the studied functions. To that end, we propose a kernel defined directly on the discretizations of the observed functions. We show that this method is universally consistent. To cite this article: N. Villa, F. Rossi, C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

支持向量机在胎膜早破预测中的应用

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

Nonlinear optimization and support vector machines

Support Vector Machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields. Nonlinear optimization plays a crucial role in SVM methodology, both in defining the machine learning models and in designing convergent and efficient algorithms for large-scale training problems. In this paper we present the convex programming problems underlying SVM focusing on supervised binary classification. We analyze the most important and used optimization methods for SVM training problems, and we discuss how the properties of these problems can be incorporated in designing useful algorithms.     

基于支持向量机委员会机器的个人信用评估模型

为了充分利用SVM在个人信用评估方面的优点、克服其不足,提出了基于支持向量机委员会机器的个人信用评估模型.将模型与基于属性效用函数估计构造新学习样本方法结合起来进行个人信用评估;经实证分析及与SVM方法对比发现,模型具有更好、更快、更多适应性的预测分类能力.     

Adapting support vector machine methods for horserace odds prediction

The methodology of Support Vector Machine Methods is adapted in a straightforward manner to enable the analysis of stratified outcomes such as horseracing results. As the strength of the Support Vector Machine approach lies in its apparent ability to produce generalisable models when the dimensionality of the inputs is large relative to the the number of observations, such a methodology would appear to be particularly appropriate in the horseracing context, where often the number of input variables deemed as being potentially relevant can be difficult to reconcile with the scarcity of relevant race results. The methods are applied to a relatively small (200 races in-sample) sample of Australian racing data and tested on 100 races out-of-sample with promising results, especially considering the relatively large number (12) of input variables used.     

MOP/GP models for machine learning

Techniques for machine learning have been extensively studied in recent years as effective tools in data mining. Although there have been several approaches to machine learning, we focus on the mathematical programming (in particular, multi-objective and goal programming; MOP/GP) approaches in this paper. Among them, Support Vector Machine (SVM) is gaining much popularity recently. In pattern classification problems with two class sets, its idea is to find a maximal margin separating hyperplane which gives the greatest separation between the classes in a high dimensional feature space. This task is performed by solving a quadratic programming problem in a traditional formulation, and can be reduced to solving a linear programming in another formulation. However, the idea of maximal margin separation is not quite new: in the 1960s the multi-surface method (MSM) was suggested by Mangasarian. In the 1980s, linear classifiers using goal programming were developed extensively.This paper presents an overview on how effectively MOP/GP techniques can be applied to machine learning such as SVM, and discusses their problems.     

装备费用预测中的混合核函数支持向量机

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

Multicategory Classification by Support Vector Machines

We examine the problem of how to discriminate between objects of three or more classes. Specifically, we investigate how two-class discrimination methods can be extended to the multiclass case. We show how the linear programming (LP) approaches based on the work of Mangasarian and quadratic programming (QP) approaches based on Vapnik's Support Vector Machine (SVM) can be combined to yield two new approaches to the multiclass problem. In LP multiclass discrimination, a single linear program is used to construct a piecewise-linear classification function. In our proposed multiclass SVM method, a single quadratic program is used to construct a piecewise-nonlinear classification function. Each piece of this function can take the form of a polynomial, a radial basis function, or even a neural network. For the k > 2-class problems, the SVM method as originally proposed required the construction of a two-class SVM to separate each class from the remaining classes. Similarily, k two-class linear programs can be used for the multiclass problem. We performed an empirical study of the original LP method, the proposed k LP method, the proposed single QP method and the original k QP methods. We discuss the advantages and disadvantages of each approach.