模糊决策树中参数对模糊熵的敏感性分析

模糊决策树的ID3算法是Quinlan提出的传统ID3算法的一个模糊版本。树的整个产生过程在给定的显著性水平α的基础上进行，的值在很大程度上影响模糊熵的计算。从而影响模糊决策树最终的分类结果。对参数α关于模糊熵的敏感性进行了分析，试图定性地找出二者之间的解析关系，从而为选取参数α的值以达到最优的分类结果提供理论依据。     

拉格朗日多项式逻辑回归分类算法并行计算优化

针对拉格朗日多项式逻辑回归算法中逻辑回归参数计算复杂高、耗时长,直接制约其在大数据量遥感图像上应用的问题,提出了基于图形处理器GPU对算法进行数据级并行计算处理。算法首先利用已知的训练样本进行多元回归参数估算,然后利用得到的回归参数和光谱数据进行分类,能够获得较高的分类精度,其中算法步骤中的矩阵乘法、矩阵求逆、矩阵特征值计算采用CULA库函数并行实现。利用真实场景的高光谱图像对文中提出的并行计算优化方案实验验证,结果表明,该方法能够实现对多元回归参数计算加速200倍左右,对整个拉格朗日多项式逻辑回归分类算法计算加速60倍左右。     

一种基于向量空间模型的文本分类方法

介绍的文本分类是指在给定分类体系下，根据文本的内容自动确定文本类别的过程。通过分析网页的特点及因特网用户感兴趣的查询信息，提出了一种基于机器学习的、独立于语种的文本分类模型。这一模型的关键算法主要利用字间的相关信息、词频、页面的标记信息以及对用户的查询信息的浅层语义分析，提取网页特征，并计算可调的词频加权参数和增加特征词的可分性信息，然后通过本类和非本类训练，建立预定义类的特征向量空间，进一步对文本进行分类。这种分类方法在相似文本分类中具有明显的优势。     

利用LS—SVM模块化决策系统求解EEG源参数

给定头皮脑电位的分布推算脑内电活动的源是脑电研究的一个重要的方面.研究涉及到信息科学、电磁场计算及生物医学工程等多个学科领域,其研究成果在神经疾病诊断、探索人的感觉和认知过程等方面具有蕈要意义.基于最小二乘支持向最机(LS-SVM)算法建立模块化决策系统,首先对脑电数据进行分类,然后依据分类结果提取数据样本,并建立回归模型,最后求解多种偶极子源参数.从而建立起头皮电压和脑电源参数之间的内在联系,为脑电动态分析提出一种实时的研究思路.计算机仿真计算结果证明了此方法的有效性.     

一种基于多项式逻辑回归高光谱影像分类方法的改进

针对多项式逻辑回归分类器在参数寻优过程中精度提升不明显和运行速度缓慢的问题,提出一种利用DFP修正拟牛顿算法进行多项式逻辑回归参数求解的方法来提高多项式逻辑回归参数优化的效率,该算法以弦截法代替牛顿算法中的二阶Hessian矩阵,并采用DFP修正法不断修正。利用该算法对两幅高光谱影像进行分类实验,结果表明:与传统的多项式回归分类方法相比,该算法在分类精度和效率方面都有明显的改进。     

利用线性回归分类算法的人脸识别方法

针对人脸识别中存在的连续遮挡问题,笔者提出了一种利用线性回归分类算法的人脸识别新方法。首先,开发了一个线性模型,表示探针图像为特定类图库的一个线性组合。然后,对所有类模型的给定进行了探究,并且该决策是以有利于类的最小重建误差为规则。最后,对于连续遮挡问题,提出了一个模块化线性回归分类(LRC)方法进行分类识别,提出的LRC算法落入最近子空间分类。在人脸识别文献中的一些典型评估协议中,该算法在ORL人脸数据库上与集中先进算法进行评估。实验结果证明,提出的方法取得了98.75%的最高识别成功率。     

遥感影像投影寻踪回归分类模型

将投影寻踪回归分析技术引入遥感影像分类中,详尽叙述遥感影像投影寻踪回归分类模型的建立和实现过程。将广州地区的TM影像用于分类实验,并用混合蛙跳算法来优化投影寻踪回归分类模型中的参数矩阵,取得了较为理想的分类效果。此外,还进一步分析了投影中心的设定、调整以及优化算法和岭函数个数对投影寻踪回归模型分类精度的影响。实验结果表明,该模型易于优化实现,稳定性强,模型中岭函数的个数对投影寻踪回归模型的分类精度没有显著影响。     

自调用支持向量回归和偏最小二乘优化支持向量机参数

参数选择是支持向量分类、回归分析的关键问题之一,在大训练样本条件下,大范围遍历搜索极为耗时.将均匀设计(UD)分别与自调用支持向量回归(SVR)、偏最小二乘回归(PLR)结合,提出了两种将大样本搜索转化为小样本搜索的策略UD-SVR和LID-PLR:在默认搜索范围内由均匀设计产生部分参数组合,每组合对训练集经交叉测试得评价指标(对分类为准确率,对回归为均方误差);以评价指标为目标函数,对部分参数组合形成的小样本,UD-SVR自调用支持向量回归以留一法进行大范围搜索建模,UD-PLR以PLR直接建模,并预测默认范围内所有参数组合;取预测评价指标最优的对应参数组合训练大样本,完成独立预测.对8个基准分类教据集、8个回归数据集的独立预测表明,两种新方法在保证预测精度的同时,大幅度缩短了训练建模时间,为大样本支持向量机参数选择提供了新的有效解决方案,UD-SVR比UD-PLR更具鲁棒性.     

ε-不敏感的光滑支持向量回归机的收敛性

?-不敏感的光滑支持向量回归机采用快速的迭代方法进行求解,使回归性能及效率得到了提高,但并没有考虑该回归机的收敛性。针对该问题,采用集合论等方法,通过相关的理论推导,证明该光滑支持向量回归机对任意给定的惩罚参数都是全局收敛的,并给出它的收敛上界,为该光滑支持向量机提供了基本的理论支持。     

基于智能最小二乘支持向量机的大数据分析与预测

大数据分析方法能发现数据中存在的关系和规则,预测事物未来的发展趋势,从而提高决策的科学性。针对传统预测方法精度低、泛化性差的问题,提出基于智能支持向量机的大数据分析与预测方法。设计一种新的支持向量机模型参数选择准则,即模型残差概率密度函数逼近给定的高斯分布,并按照该准则采用混沌收缩粒子群优化算法确定模型参数,从而提高数据分类或回归处理的精度与泛化性。采用选矿生产过程现场数据进行实验,结果验证了该方法的有效性,并表明其精度比LSSVM方法更高。     

贝叶斯分类器的判别式参数学习

为了提高贝叶斯分类器的分类性能,针对贝叶斯网络分类器的构成特征,提出一种基于参数集成的贝叶斯分类器判别式参数学习算法PEBNC。该算法将贝叶斯分类器的参数学习视为回归问题,将加法回归模型应用于贝叶斯网络分类器的参数学习,实现贝叶斯分类器的判别式参数学习。实验结果表明,在大多数实验数据上,PEBNC能够明显提高贝叶斯分类器的分类准确率。此外,与一般的贝叶斯集成分类器相比,PEBNC不必存储成员分类器的参数,空间复杂度大大降低。     

New support vector algorithms

We propose a new class of support vector algorithms for regression and classification. In these algorithms, a parameter nu lets one effectively control the number of support vectors. While this can be useful in its own right, the parameterization has the additional benefit of enabling us to eliminate one of the other free parameters of the algorithm: the accuracy parameter epsilon in the regression case, and the regularization constant C in the classification case. We describe the algorithms, give some theoretical results concerning the meaning and the choice of nu, and report experimental results.     

基于均匀设计的支持向量机参数优化方法

在实际应用中,支持向量机的性能依赖于参数的选择。针对支持向量机的参数选择问题进行了研究和分析,提出了基于均匀设计的支持向量机参数优化方法。与基于网格搜索、粒子群算法、遗传算法等支持向量机参数优化方法进行了比较与分析,采用多个不同规模的标准的分类数据集进行测试,比较了四种方法的分类正确率和运行时间。仿真实验表明,四种方法都能找到最优参数,使支持向量机的分类正确率接近或超过分类数据集的理论精度,本文方法具有寻参时间短的特点。     

Estimation of probabilities using the logistic model in retrospective studies

Methods for estimating the parameters of the logistic regression model when the data are collected using a case-control (retrospective) scheme are compared. The regression coefficients are estimated by maximum likelihood methodology. This leaves the constant term parameter to be estimated. Four methods for estimating this parameter are proposed. The comparison of the four estimators is in two parts. First, they are compared for large samples. This is accomplished via the asymptotic distribution of the estimators. Second, the estimators are compared for small samples. This is conducted via stimulation using 11 logistic models. The estimation of the posterior probability of the response variable being a success (Px), as given by the logistic regression model, when the constant parameter is estimated by each of the four proposed methods is the main focus of this paper. A third concern is the comparison of the logistic discriminant procedures when each of the four methods of estimating the constant parameters is used. In addition, the linear discriminant function procedure is included. This comparison is executed only for small samples via simulation. It was found that when estimating Px, method 1 (which is essentially the MLE) minimizes the expected mean square error. The results were not as clear when the parameter of interest was the constant term itself. The results from the classification comparisons implied that when the logistic model contains mostly (or all) binary regression variables the logistic discriminant procedure using method 1 to estimate the constant term gives minimum expected error rate; otherwise the linear discriminant function gives minimum expected error rate. In the latter case the logistic discriminant procedure (method 1 estimator of the constant term) is approximately as good.     

基于隐含语义索引的文本情感序列回归方法

传统上,文本情感分析技术仅限于情感分类,即仅局限于简单的将评论分为正面或负面两类。而在实际中,有时更需要将评论进行分级,比如把商品划分为“好”、“中”、“差”、“极差”等若干个级别,以便更准确表达评论者的情感;现有的情感分类方法无法解决评论分级问题。为此,提出了基于潜在语义索引的评论文本情感序列回归方法,首先采用潜在语义索引对评论文本进行特征变换,并在此基础上采用核判别学习序列回归方法进行序列回归,实现对评论文本的情感分级。通过在Movie Reviews数据库的实验,验证了提出方法的有效性。     

改进退火遗传算法在SQL数据挖掘参数优化中的应用

针对SQL数据挖掘在复杂动力学系统故障诊断中的模式分类问题,以决策树参数优化为例,开展SQL数据挖掘分类算法参数优化研究。目前数据挖掘中的各类算法参数往往根据经验值设定,预测精度不高;只用遗传算法进行参数优化,分类预测结果容易发生振荡和早熟现象。采用改进的退火遗传算法对SQL数据挖掘中的决策树算法参数进行优化,解决了人工经验设置参数效率低下、精度不高的问题,同时实现了全局搜索,快速收敛到全局最优解。     

Some sets of orthogonal polynomial kernel functions

Kernel methods provide high performance in a variety of machine learning tasks. However, the success of kernel methods is heavily dependent on the selection of the right kernel function and proper setting of its parameters. Several sets of kernel functions based on orthogonal polynomials have been proposed recently. Besides their good performance in the error rate, these kernel functions have only one parameter chosen from a small set of integers, and it facilitates kernel selection greatly. Two sets of orthogonal polynomial kernel functions, namely the triangularly modified Chebyshev kernels and the triangularly modified Legendre kernels, are proposed in this study. Furthermore, we compare the construction methods of some orthogonal polynomial kernels and highlight the similarities and differences among them. Experiments on 32 data sets are performed for better illustration and comparison of these kernel functions in classification and regression scenarios. In general, there is difference among these orthogonal polynomial kernels in terms of accuracy, and most orthogonal polynomial kernels can match the commonly used kernels, such as the polynomial kernel, the Gaussian kernel and the wavelet kernel. Compared with these universal kernels, the orthogonal polynomial kernels each have a unique easily optimized parameter, and they store statistically significantly less support vectors in support vector classification. New presented kernels can obtain better generalization performance both for classification tasks and regression tasks.     

Semi-supervised tensor learning for image classification

In this paper, we propose a new tensor-based representation algorithm for image classification. The algorithm is realized by learning the parameter tensor for image tensors. One novelty is that the parameter tensor is learned according to the Tucker tensor decomposition as the multiplication of a core tensor with a group of matrices for each order, which endows that the algorithm preserved the spatial information of image. We further extend the proposed tensor algorithm to a semi-supervised framework, in order to utilize both labeled and unlabeled images. The objective function can be solved by using the alternative optimization method, where at each iteration, we solve the typical ridge regression problem to obtain the closed form solution of the parameter along the corresponding order. Experimental results of gray and color image datasets show that our method outperforms several classification approaches. In particular, we find that our method can implement a high-quality classification performance when only few labeled training samples are provided.     

A-Brain: a general system for solving data analysis problems

An intelligent system should be able to solve a wide range of problems from different domains. In this paper we propose a complex and adaptive system capable of solving various data analysis problems without needing human help for parameter settings. The system, called A-Brain, consists of several interconnected components (a decision-maker, a trainer, and several problem solvers) which provide a base for building complex problem solvers. The parameters of the trainer's algorithm are problem independent. This fact is a requirement for intelligent systems which cannot rely on human intervention while operating. The A-Brain system is used to solve some well-known problems in the field of symbolic regression and classification. Numerical experiments show that the A-Brain system is able to perform very well on the considered test problems.     

改进的MEA进行特征选择及SVM参数同步优化

特征选择和参数优化是提高支持向量机（SVM）分类性能的两个重要手段,将两者进行同步优化能提高分类器的分类精度。利用思维进化算法（MEA）进行特征选择和SVM参数同步优化能取得较好的分类效果,但也存在着收敛速度慢,易陷入局部最优的问题,无法进一步提高分类精度。针对这一问题,提出了一种改进的思维进化算法进行分类器优化（RMEA-SVM）,在传统思维进化算法的基础上引入了“学习”和“反思”机制,利用子群体间信息共享进行学习,通过适应度值的比较进行反思。通过这种方式保证种群的多样性,加快收敛速度,进一步提高分类精度。实验结果证明了算法的有效性。