半监督支持向量机及其在县域可持续发展综合实力评价中的应用

给出了基于全部风险(ORM)最小化基础上的半监督支持向量机分类算法,该算法通过加入工作集进行训练,提高了标准SVM对训练集提供信息不充分的数据集的分类泛化能力,而且能有效地处理大量的无标示数据.并将凹半监督支持向量机算法应用于县域可持续发展综合实力评价中.通过邯郸15个县作实证分析,论证了该算法的可行性和有效性.     

非线性支持向量分类机解的二阶充分条件

优化问题解的二阶充分条件是研究其灵敏度分析的基础,支持向量分类机是新的数据挖掘优化问题.给出了支持向量分类机的解满足二阶充分条件成立定理;定理的假设条件是很弱的,用支持向量分类机求解实际问题,通常总假定这一条件成立;特别地,对线性可分支持向量机问题,其解满足二阶充分条件成为当然成立的事实.     

椭球不确定集下具有消费的投资组合鲁棒优化模型

针对含有不确定参数的优化问题,鲁棒优化作为一种有效的优化手段引起了人们的普遍关注。本文主要介绍了CVaR风险投资纽合模型,并在模型中加入消费,将椭球不确定集下鲁棒优化应用到该模型中,这不仅解决了该模型由于参数的不确定性所造成的缺陷,而且也比较符合实际情况。     

基于最坏情况条件鲁棒利润的发电机组最优组合

采用最坏情况条件风险价值方法刻画电价风险,并定义最坏情况条件鲁棒利润描述发电商的利润,考虑机组启停,建立了基于最坏情况条件鲁棒利润的发电机组最优组合模型.在盒式不确定集下,将所建模型转化为混合整数二阶锥规划进行求解.通过10机24时段系统的算例仿真,验证了所建模型和求解方法的有效性.     

从支持向量机到非平行支持向量机

非平行支持向量机是支持向量机的延伸,受到了广泛的关注.非平行支持向量机构造允许非平行的支撑超平面,可以描述不同类别之间的数据分布差异,从而适用于更广泛的问题.然而,对非平行支持向量机模型与支持向量机模型之间的关系研究较少,且尚未有等价于标准支持向量机模型的非平行支持向量机模型.从支持向量机出发,构造出新的非平行支持向量机模型,该模型不仅可以退化为标准支持向量机,保留了支持向量机的稀疏性和核函数可扩展性.同时,可以描述不同类别之间的数据分布差异,适用于更广泛的非平行结构数据等.最后,通过实验初步验证了所提模型的有效性.     

线性ε-支持向量回归机的数据扰动分析

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

基于线性ν-支持向量回归机的异常数据检测

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

基于鲁棒均值-下半偏差模型的供电公司购电组合策略

电力市场中,日前市场购电电价的随机波动,给供电公司的投资带来了一定的收益风险,因而供电公司需要在不同的市场中合理分配购电电量分散投资,以实现自身收益率尽可能大的同时承受的风险最小.供电公司在多市场中购电电价呈随机波动的特性,本文用均值-下半偏差作为购电风险测度,并用鲁棒优化处理电价的不确定性,建立了供电公司鲁棒均值-下半偏差(Robust Mean Semi-Deviation)购电策略优化模型.最后利用广西电网公司提供的数据进行实证分析,验证了模型的有效性和适用性,表明此模型对供电公司的投资组合决策具有一定的参考价值和指导意义.     

基于支持向量机的磨粒识别

由于神经网络的局限性,上个世纪末,支持向量机被提出和发展,它在模式识别方面有广泛的应用发展前途,并由最初的二元分类发展到现在的多元分类.本文根据支持向量机的最新发展,把最小二乘支持向量机应用在磨粒识别上,并取得了好的结果.     

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

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

Learning the optimal kernel for Fisher discriminant analysis via second order cone programming

Kernel Fisher discriminant analysis (KFDA) is a popular classification technique which requires the user to predefine an appropriate kernel. Since the performance of KFDA depends on the choice of the kernel, the problem of kernel selection becomes very important. In this paper we treat the kernel selection problem as an optimization problem over the convex set of finitely many basic kernels, and formulate it as a second order cone programming (SOCP) problem. This formulation seems to be promising because the resulting SOCP can be efficiently solved by employing interior point methods. The efficacy of the optimal kernel, selected from a given convex set of basic kernels, is demonstrated on UCI machine learning benchmark datasets.     

Pattern classification by goal programming and support vector machines

Support Vector Machines (SVMs) are now very popular as a powerful method in pattern classification problems. One of main features of SVMs is to produce a separating hyperplane which maximizes the margin in feature space induced by nonlinear mapping using kernel function. As a result, SVMs can treat not only linear separation but also nonlinear separation. While the soft margin method of SVMs considers only the distance between separating hyperplane and misclassified data, we propose in this paper multi-objective programming formulation considering surplus variables. A similar formulation was extensively researched in linear discriminant analysis mostly in 1980s by using Goal Programming(GP). This paper compares these conventional methods such as SVMs and GP with our proposed formulation through several examples.Received: September 2003, Revised: December 2003,     

基于成对约束的主动学习半监督谱聚类

半监督学习是近年来机器学习领域中的一个重要研究方向,其监督信息的质量对半监督聚类的结果影响很大,主动学习高质量的监督信息很有必要.提出一种纠错式主动学习成对约束的方法,该算法通过寻找聚类算法本身不能发现的成对约束监督信息,将其引入谱聚类算法,并利用该监督信息来调整谱聚类中点与点之间的距离矩阵.采用双向寻找的方法,将点与点间距离进行排序,使得学习器即使在接收到没有标记的数据时也能进行主动学习,实现了在较少的约束下可得到较好的聚类结果.同时,该算法降低了计算复杂度,解决了聚类过程中成对约束的奇异问题.通过在UCI基准数据集以及人工数据集的实验表明,算法的性能好于相关对比算法,并优于采用随机选取监督信息的谱聚类性能.     

Efficient Algorithms for the Smallest Enclosing Ball Problem

Consider the problem of computing the smallest enclosing ball of a set of m balls in ⁿ. Existing algorithms are known to be inefficient when n > 30. In this paper we develop two algorithms that are particularly suitable for problems where n is large. The first algorithm is based on log-exponential aggregation of the maximum function and reduces the problem into an unconstrained convex program. The second algorithm is based on a second-order cone programming formulation, with special structures taken into consideration. Our computational experiments show that both methods are efficient for large problems, with the product mn on the order of 10⁷. Using the first algorithm, we are able to solve problems with n = 100 and m = 512,000 in about 1 hour.His work was supported by Australian Research Council.Research supported in part by the Singapore-MIT Alliance.     

Self-adaptive support vector machines: modelling and experiments

Method  In this paper, we introduce a bi-level optimization formulation for the model and feature selection problems of support vector machines (SVMs). A bi-level optimization model is proposed to select the best model, where the standard convex quadratic optimization problem of the SVM training is cast as a subproblem. Feasibility  The optimal objective value of the quadratic problem of SVMs is minimized over a feasible range of the kernel parameters at the master level of the bi-level model. Since the optimal objective value of the subproblem is a continuous function of the kernel parameters, through implicity defined over a certain region, the solution of this bi-level problem always exists. The problem of feature selection can be handled in a similar manner. Experiments and results  Two approaches for solving the bi-level problem of model and feature selection are considered as well. Experimental results show that the bi-level formulation provides a plausible tool for model selection.     

Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming

ABSTRACT

We study and solve the two-stage stochastic extended second-order cone programming problem. We show that the barrier recourse functions and the composite barrier functions for this optimization problem are self-concordant families with respect to barrier parameters. These results are used to develop primal decomposition-based interior-point algorithms. The worst case iteration complexity of the developed algorithms is shown to be the same as that for the short- and long-step primal interior algorithms applied to the extensive formulation of our problem.     

Stochastic 0-1 linear programming under limited distributional information

We consider the problem where the a_j are random vectors with unknown distributions. The only information we are given regarding the random vectors a_j are their moments, up to order k. We give a robust formulation, as a function of k, for the 0-1 integer linear program under this limited distributional information.     

线性不确定系统的稳定控制鲁棒界和多级稳定鲁棒控制

利用李雅普诺夫稳定性理论研究了线性不确定系统的稳定鲁棒控制问题,得到结果“任何一个稳定控制都是具有一定稳定鲁棒界的稳定控制”.进一步地,根据系统的不确定量的范围,设计了多级稳定鲁棒控制策略.最后给出一个例子说明设计步骤的可行性.     

Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

We show that SDP (semidefinite programming) and SOCP (second order cone programming) relaxations provide exact optimal solutions for a class of nonconvex quadratic optimization problems. It is a generalization of the results by S. Zhang for a subclass of quadratic maximization problems that have nonnegative off-diagonal coefficient matrices of quadratic objective functions and diagonal coefficient matrices of quadratic constraint functions. A new SOCP relaxation is proposed for the class of nonconvex quadratic optimization problems by extracting valid quadratic inequalities for positive semidefinite cones. Its effectiveness to obtain optimal values is shown to be the same as the SDP relaxation theoretically. Numerical results are presented to demonstrate that the SOCP relaxation is much more efficient than the SDP relaxation.     

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.