This paper proposes a novel hypersphere support vector machines （HSVMs） based on generalized multiplicative updates. This algorithm can obtain the boundary of hypersphere containing one class of samples by the descr...This paper proposes a novel hypersphere support vector machines （HSVMs） based on generalized multiplicative updates. This algorithm can obtain the boundary of hypersphere containing one class of samples by the description of the training samples from one class and use this boundary to classify the test samples. The generalized multiplicative updates are applied to solving boundary optimization progranmning. Multiplicative updates available are suited for nonnegative quadratic convex programming. The generalized multiplicative updates are derived to box and sum constrained quadratic programming in this paper. They provide an extremely straightforward way to implement support vector machines （SVMs） where all variables are updated in parallel. The generalized multiplicative updates converge monotonically to the solution of the maximum margin hyperplane. The experiments show the superiority of our new algorithm.展开更多
文摘提出了一种基于模糊聚类算法的高维特征选取方法。首先,利用Bhattacharyya距离过滤样本类别无关的特征;然后,基于递归特征剔除过程,提出了基于模糊迭代自组织数据分析技术(Interactive self-organizing dataanalysis technique,ISODATA)聚类方法,以样本与聚类中心的加权距离作为可分性指标,产生候选特征子集;最后,以候选特征子集分类和聚类的接受者操作特征曲线下面积(Area under the receiver operating characteristiccurve,AUC)值和正确率作为目标函数,确定最佳特征子集。将该方法用于选取5个基因表达谱数据集的特征基因,结果显示该方法所选特征具有较好的分类和聚类能力,说明了提出的特征选取方法的有效性。
基金Project supported by the National Natural Science Foundation of China (Grant No.60574075)
文摘This paper proposes a novel hypersphere support vector machines （HSVMs） based on generalized multiplicative updates. This algorithm can obtain the boundary of hypersphere containing one class of samples by the description of the training samples from one class and use this boundary to classify the test samples. The generalized multiplicative updates are applied to solving boundary optimization progranmning. Multiplicative updates available are suited for nonnegative quadratic convex programming. The generalized multiplicative updates are derived to box and sum constrained quadratic programming in this paper. They provide an extremely straightforward way to implement support vector machines （SVMs） where all variables are updated in parallel. The generalized multiplicative updates converge monotonically to the solution of the maximum margin hyperplane. The experiments show the superiority of our new algorithm.
