间隔值辅助的SMO算法改进研究

顺序最小优化（SMO）算法是现今求解支持向量机（SVM）的最优秀算法之一,其效率直接影响到SVM的训练效率。为提高SVM的训练效率,提出了一种间隔值辅助的SMO改进算法。通过一定量的经验性实验,统计总结出了间隔值随迭代次数变化的规律,即该变化呈铰链函数形态,起始阶段下降很快,经过一小段缓慢变化期后进入间隔值几乎无变化的水平区域。由此,提出并实现了SMO改进算法,通过跟踪间隔值随迭代次数的变化率,待越过拐点一小段时间后终止算法以缩短SVM训练时间。对比实验以及k分类的交叉验证（k-CV）证明,改进后的SMO算法在保持原有算法的模型预测能力的基础上,能够产生至少45%的效率提升。     

Modified transform-based gamma correction for MRI tumor image denoising and segmentation by optimized histon-based elephant herding algorithm

Medical image processing is typically performed to diagnose a patient's brain tumor prior to surgery. In this study, a technique in denoising and segmentation was developed to improve medical image processing. The proposed approach employs multiple modules. In the first module, the noisy brain tumor image is transformed into multiple low- and high-pass tetrolet coefficients. In the second module, multiple low-pass tetrolet coefficients are applied through a modified transform-based gamma correction method. Generalized cross-validation is used on multiple high-pass tetrolet coefficients to obtain the best threshold value. In the third module, all enhanced coefficients are applied to the partial differential equation method. In the final module, the denoised image is applied to Atanassov's intuitionistic fuzzy set histon-based fuzzy clustering method with centroid optimization using an elephant herding method. Accordingly, the tumor part is segmented from the nontumor part in the magnetic resonance imaging brain images. The method was assessed in terms of peak signal-to-noise ratio, mean square error, specificity, sensitivity, and accuracy. The experimental results showed that the suggested method is superior to traditional methods.     

基于交叉验证SVM的网络入侵检测

针对传统入侵检测系统漏报率和误报率高的问题,将支持向量机(SVM)应用于入侵检测中,提出了在SVM学习过程中引入交叉验证的方法,采用径向基函数(RBF)作为核,将训练集分成若干子集,每一子集使用其它子集训练得到的分类器进行测试,获得RBF的两个最佳参数后,将其应用于最终的分类器.实验结果表明,该方法能够有效检测入侵攻击,具有更高的检测率和更强的泛化能力,同时具有较低的误报率和漏报率,可以有效地运用于入侵检测系统中.     

PRIMEROSE: PROBABILISTIC RULE INDUCTION METHOD BASED ON ROUGH SETS AND RESAMPLING METHODS

Automated knowledge acquisition is an important research issue in machine learning. Several methods of inductive learning, such as ID3 family and AQ family, have been applied to discover meaningful knowledge from large databases and their usefulness is assured in several aspects. However, since their methods are of a deterministic nature and the reliability of acquired knowledge is not evaluated statistically, these methods are ineffective when applied to domains essentially probabilistic in nature, such as medical domains. Extending concepts of rough set theory to a probabilistic domain, we introduce a new approach to knowledge acquisition, which induces probabilistic rules based on rough set theory (PRIMEROSE) and develop a program that extracts rules for an expert system from a clinical database, using this method. The results show that the derived rules almost correspond to those of the medical experts.     

Selecting the right-size model for prediction

We evaluate the effectiveness of cross-validation in selecting the right-size model for decision tree and k-nearest neighbor learning methods. For samples with at least 200 cases, extensive empirical evidence supports the following conclusions relative to complexity-fit selection: (a) 10-fold cross-validation is nearly unbiased; (b) ignoring model complexity-fit and picking the standard model is highly biased; (c) 10-fold cross-validation is consistent with optimal complexity-fit selection for large sample sizes and (d) the accuracy of complexity-fit selection by 10-fold cross-validation is largely dependent on sample size, irrespective of the population distribution.     

A theory of cross-validation error

Abstract

This paper presents a theory of error in cross-validation testing of algorithms for predicting real-valued attributes. The theory justifies the claim that predicting real-valued attributes requires balancing the conflicting demands of simplicity and accuracy. Furthermore, the theory indicates precisely how these conflicting demands must be balanced, in order to minimize cross-validation error. A general theory is presented, then it is developed in detail for linear regression and instance-based learning     

以离子液体密度为例的分子性质预测模型建模方法探讨

分子性质预测模型是针对特定应用需求筛选设计化学品的有力工具,然而诸多相关建模过程中的测试集划分、交叉验证、算法选择等关键环节普遍存在严谨性不足的问题,模型真实预测性能难以保证。以基团贡献法预测离子液体密度为例,探讨了分子性质预测模型建模过程中数据集划分和交叉验证的重要性,提出了自动基团划分方法并研究了数据集中基团涉及分子个数对预测精度的影响。通过对比五种回归算法（多重线性回归、岭回归、随机森林、支持向量机、神经网络）,基于岭回归的基团贡献模型预测性能最佳,在由1078种离子液体、共计23034个数据点组成的数据集上得到的平均相对误差为1.88%。     

自底向上优化神经网络的方法

引荐了一种自动优化神经网络的新方法。这种启迪方法综合采用了相关有效算法,通过快速自底向上构造神经网络算法,可以获得优化结构的神经网络,即时选定参数算法动态优化神经网络的学习参数,并且快速交叉校验算法为解决过度适应问题提供了捷径。实验证明,这种启迪方法能自动有效地优化神经网络,与其它算法相较而言,具有更好的归纳性能、优化的网络结构和更快的学习速度。     

交叉验证的BP神经网络恒星光谱分类

LAMOST作为国家重大科学工程项目,目前在世界上对光谱的观测、获取率最高,为天文学的研究与发展提供大量的数据和信息资源.根据LAMOST发布的恒星光谱数据文件,从中提取出关于恒星光谱波长的数据信息,对数据进行噪声剔除、数据降维、数据规范化、数据降维处理.利用BP神经网络算法对数据进行分类处理,根据分类结果正确率来判断BP神经网络模型的优劣.但是BP神经网络对测试集数据的测试效果并不代表对其他数据具有同样的测试效果而且易产生过拟合,所以采用交叉验证与BP神经网络相结合的方法, BP神经网络算法可对多组不同的数据进行测试,得到多组测试结果并求得平均值,可得到BP神经网络模型相对稳定的测试结果并降低结果的随机性.     

A non-parametric segmentation methodology for oral videocapillaroscopic images

We aim to describe a new non-parametric methodology to support the clinician during the diagnostic process of oral videocapillaroscopy to evaluate peripheral microcirculation. Our methodology, mainly based on wavelet analysis and mathematical morphology to preprocess the images, segments them by minimizing the within-class luminosity variance of both capillaries and background. Experiments were carried out on a set of real microphotographs to validate this approach versus handmade segmentations provided by physicians. By using a leave-one-patient-out approach, we pointed out that our methodology is robust, according to precision–recall criteria (average precision and recall are equal to 0.924 and 0.923, respectively) and it acts as a physician in terms of the Jaccard index (mean and standard deviation equal to 0.858 and 0.064, respectively).