Intrauterine growth restriction (IUGR) risk decision based on support vector machines

This paper studies the risk of intrauterine compromise in the fetuses with intrauterine growth restriction (IUGR) using support vector machines (SVM). A structured and globally optimized SVM system may be preferable procedure in the identification of IUGR fetus at risk. The IUGR risk is estimated in two stages: In the first stage, noninvasive Doppler pulsatility index (PI) and resistance index (RI) of umbilical artery (UA), middle cerebral artery (MCA) and ductus venosus (DV), and amniotic fluid index (AFI) are retrospectively analyzed and the Doppler indices are applied to the SVM system to make a diagnosis decision on the fetal well being as “reactive” or “nonreactive and/or fetal distress (FD)” on the nonstress test (NST) (training data). In the second stage (testing data), the decision is validated by the NST (target value). Experiments are performed in retrospective clinical situation. Forty-four preterm with IUGR and without IUGR pregnancies before 34 weeks gestation are considered. Also, the nonparametric Bayes-risk decision rule, k-nearest neighbor (k-NN), is used for comparison. It is observed that the SVM system is proven to be useful in predicting the expected risk in IUGR cases in the small population study. Also, the PI and RI values of UA, MCA and DV are effective in distinguishing IUGR cases at risk.     

基于矢量量化的快速图像检索

传统索引方法对高维数据存在"维数灾难"的困难.而对数据分布的精确描述及对数据空间的有效划分是高维索引机制中的关键问题.提出一种基于矢量量化的索引方法.该方法使用高斯混合模型描述数据的整体分布,并训练优化的矢量量化器划分数据空间.高斯混合模型能更好地描述真实图像库的数据分布;而矢量量化的划分方法可以充分利用维之间的统计相关性,能够对数据向量构造出更加精确的近似表示,从而提高索引结构的过滤效率并减少需要访问的数据向量.在大容量真实图像库上的实验表明,该方法显著减少了支配检索时间的I/O开销,提高了索引性能.     

超文本协调分类器的性能研究

为了获得高效的超文本分类算法,提出了一种新的协调分类超文本算法,并将ｋ－ＮＮ,Ｂａｙｅｓ和文档相似性引入了超文本分类领域,且这对３种分类器的超的分类效果进行了实验比较,最终得出一个高效的超文本分类器,目前,该方法已应用于新开发的两个实验系统;智能搜索引擎系统ＷｅｂＳｅａｒｃｈ和智能软件助理ＷｅｂＳｏｆｔ。     

基于Boosting的代价敏感软件缺陷预测方法

Boosting重抽样是常用的扩充小样本数据集的方法,首先针对抽样过程中存在的维数灾难现象,提出随机属性子集选择方法以进行降维处理;进而针对软件缺陷预测对于漏报与误报的惩罚因子不同的特点,在属性选择过程中添加代价敏感算法。以多个基本k-NN预测器为弱学习器,以代价最小为属性删除原则,得到当前抽样集的k值与属性子集的预测器集合,采用代价敏感的权重更新机制对抽样过程中的不同数据实例赋予相应权值,由所有预测器集合构成自适应的集成k-NN强学习器并建立软件缺陷预测模型。基于NASA数据集的实验结果表明,在小样本情况下,基于Boosting的代价敏感软件缺陷预测方法预测的漏报率有较大程度降低,误报率有一定程度增加,整体性能优于原来的Boosting集成预测方法。     

新的基于簇划分文本分类方法

基于向量空间模型的文本分类由于文本向量维数较高导致分类器效率较低.针对这一不足,提出一种新的基于簇划分的文本分类方法.其主要思想是根据向量空间中向量间的距离,将训练文档分成若干簇,同一簇中的文档具有相同类别.测试时,根据测试文档落入哪个簇,确定文档的类别,并且和传统的文本分类方法k-NN进行了比较.实验结果表明,该方法在高维空间具有良好的泛化能力和很好的时间性能.     

基于多尺度信息熵的雷达辐射源信号识别

随着雷达信号的日益复杂,从实数序列中提取特征变得越来越困难,但当它们表示成符号序列时,通常能更容易地挖掘出有效的特征参数。因此,该文提出一种基于多尺度信息熵(MSIE)的雷达信号识别方法。首先通过符号聚合近似(SAX)算法在不同字符集尺度下将雷达信号转换为符号化序列;然后联合各符号序列的信息熵值,组成MSIE特征向量;最后,使用k邻近算法(k-NN)作为分类器实现雷达信号的分类识别。通过仿真6种典型的雷达信号进行验证,结果表明该方法在信噪比(SNR)为5 dB时,不同雷达信号的识别正确率大于90%,并且优于传统的基于复杂度特征(盒维数和稀疏性)的识别方法。

     

A hybrid method based on artificial immune system and fuzzy k-NN algorithm for diagnosis of heart valve diseases

The use of artificial intelligence methods in medical analysis is increasing. This is mainly because the effectiveness of classification and detection systems has improved in a great deal to help medical experts in diagnosing. In this paper, we investigate the performance of an artificial immune system (AIS) based fuzzy k-NN algorithm to determine the heart valve disorders from the Doppler heart sounds. The proposed methodology is composed of three stages. The first stage is the pre-processing stage. The feature extraction is the second stage. During feature extraction stage, Wavelet transforms and short time Fourier transform were used. As next step, wavelet entropy was applied to these features. In the classification stage, AIS based fuzzy k-NN algorithm is used. To compute the correct classification rate of proposed methodology, a comparative study is realized by using a data set containing 215 samples. The validation of the proposed method is measured by using the sensitivity and specificity parameters. 95.9% sensitivity and 96% specificity rate was obtained.     

基于聚类索引树的高维近似检索算法

提出了一个基于聚类索引树的高维近似检索方法。详细描述了其建树算法和检索算法。由于传统索引对高维空间的k-近邻检索效率的提高非常有限，我们把近似检索和聚类索引树结合起来。从而用很小的精度损失换取很高的检索效率。实验表明，与精确检索相比，本方法的误差非常小，而检索速度大大优于其他方法，因此具有广泛的应用前景。     

Using coarse scale forest variables as ancillary information and weighting of variables in k-NN estimation: a genetic algorithm approach

The non-parametric k-nearest neighbour (k-NN) multi-source estimation method is commonly employed in forest inventories that use satellite images and field data. The method presumes the selection of a few estimation parameters. An important decision is the choice of the pixel-dependent geographical area from which the nearest field plots in the spectral space for each pixel are selected, the problem being that one spectral vector may correspond to several different ground data vectors. The weighting of different spectral components is an obvious problem when defining the distance metric in the spectral space.The paper presents a new method. The first innovation is that the large-scale variation of forest variables is used as ancillary data that are added to the variables of the multi-source k-NN estimation. These data are assigned weights in a way similar to the spectral information of satellite images when defining the applied distance metric. The second innovation is that “optimal” weights for spectral data, as well as ancillary data, are computed by means of a genetic algorithm. Tests with practical forest inventory data show that the method performs noticeably better than other applications of k-NN estimation methods in forest inventories, and that the problem of biases in the species volume predictions can for example, almost completely be overcome with this new approach.     

半限制空间内的RFID 可能性k-近邻查询技术

作为一种监控与跟踪车流和人类活动等的潜在技术,RFID(radio frequency identification)已经在数据库领域得到了很大关注.RFID监控对象上的k-近邻查询是一种最重要的时空查询,能够用来支持有价值的高层信息分析.但是,不同于没有限制的空间和基于限制的空间,RFID监控场景通常被设置在一种半限制的空间内,需要新的存储和距离计算策略.此外,监控对象位置的不确定性对查询语义和处理方法提出了挑战.提出了半限制空间的概念,并且分析了基于RFID的半限制空间的模型.基于半限制空间,在给定一个动态查询点的基础上,提出了3种模型和算法以有效地估计可能性k-近邻的查询结果,并采用一些特殊的索引技术加快查询的速度.实验对提出算法的效率和准确性进行了评估,表明了相关方法的有效性.