IWO-Kohonen聚类算法在IDS中的应用

针对Kohonen神经网络模型网络入侵聚类正确率较低的问题,将入侵杂草优化(IWO)算法与Kohonen神经网络相结合,提出IWO-Kohonen聚类算法。利用IWO算法优化Kohonen神经网络的初始权值,训练Kohonen神经网络模型得到最优值。使用IWO算法增强算法的搜索能力,提高聚类正确率,并加快算法的收敛速度。实验结果表明,该算法与模糊聚类算法和广义神经网络聚类算法相比,分类正确率较高;与蚂蚁聚类算法和模糊C均值聚类算法相比,网络入侵检测率较高,误报率较低。     

基于潜在语义分析和自组织特征映射神经网络的文本聚类研究

基于潜在语义分析和自组织特征映射神经网络（LSA—SOM）,本文提出一种文本聚类方法。采用潜在语义分析的理论表示文本特征向量,以体现特征词的语义关系并实现特征向量的降维。利用SOM网络算法进行无监督自组织学习,并通过不断调节网络节点间的权向量来实现文本聚类。该方法不必预先给定聚类个数,可以在任意合适的位置生成一个新的类,克服传统方法中文本种类需要预先给定的缺点。     

基于免疫网络和SOM的文本聚类算法研究

文本聚类的核心问题是找到一种优化的聚类算法对文本向量进行聚类,是典型的高维数据聚类,提出一种基于自组织神经网络SOM和人工免疫网络aiNet的两阶段文本聚类算法TCBSA。新算法先用SOM神经网络进行聚类,把高维的文本数据映射到二维的平面上,然后再用aiNet对文本聚类。该方法利用SOM神经网络对高维数据降维的优点,克服了人工免疫网络对高维数据的聚类能力差的缺点。仿真实验结果表明该文本聚类算法不仅是可行的,而且具有一定的自适应能力和较好的聚类效果。     

基于基因表达式编程的ISODATA模糊聚类算法

针对ISODATA算法需要人为给定分类数,对初始聚类中心较为敏感,没有显示出自动聚类效果等不足,结合基因表达式编程(GEP)嵌套构成迭代自组织模糊聚类进行优化计算。该方法不仅能在不需要先验知识的条件下对数据进行自动聚类,而且充分利用了GEP算法的全局寻优能力及ISODATA算法的软性分类特性,提高了算法的收敛速度和聚类精度。通过仿真验证及对比分析,运用到地理信息系统(GIS)物流选址实际问题中,得到了理想聚类效果。     

一种面向网络话题发现的增量文本聚类算法*

为满足网络舆情监控系统中话题发现的需要,并克服经典single-pass算法处理网络文本聚类中受输入顺序影响和精度较低的主要不足,提出了ICIT算法,继承了single-pass算法的简单原理,保证了网络文本聚类的实时性;通过正文分词时标注词性选择名词动词进行正文向量化、建立文本标题向量来与文本正文向量共同表征文本、采用average-link策略、引入“代”的概念分批进行文本的聚类,以及在每批次聚类后添加报道重新选择调整所属的步骤来提高聚类的质量。实验证明了ICIT算法在提高话题发现准确度上的有效性和实用性。     

基于遗传算法和自组织特征映射网络的文本聚类方法

自组织映射(SOM)算法作为一种聚类和高维可视化的无监督学习算法,为进行中文Web文档聚类提供了有力的手段。但是SOM算法天然存在着对网络初始权值敏感的缺陷,从而影响聚类质量。为此,引进遗传算法对SOM网络加以优化。提出了以遗传算法优化SOM网络的文本聚类算法（GSTCA）;进行了对比实验,实验表明,改进后的算法GSTCA比SOM算法在Web中文文档聚类中具有更高的准确率,其F-measure值平均提高了14%,同时,实验还表明,GSTCA算法对网络初始权值是不敏感的,从而提高了算法的稳定性。     

基于遗传算法的自适应文本模糊聚类研究

针对FCM聚类算法时初始聚类中心的选择敏感,以及聚类数C难以确定的问题,提出一种基于遗传算法的自适应文本模糊聚类方法.该方法首先将文档集合表示成向量空间模型,并采用一种新型的可变长染色体编码方案,随机选择文本向量作为初始聚类中心形成染色体,然后结合FCM算法的高效性和遗传算法的全局优化能力,通过遗传进化,有效地避免了局部最优解的出现,同时得到了优化的聚类数目和聚类结果.实验表明该算法是一种精确高效的文本聚类方法.     

确定RBF神经网络参数的新方法

提出一种确定RBF网络隐含层神经元和权值的有效方法。该方法将自动聚类算法与对称距离相结合优化每个隐含层神经元的中心向量；利用伪逆方法确定隐层神经元到输出神经元的权值。实验结果表明：该方法比自动聚类算法有更好的分类能力。     

基于单词相似度的文本聚类

研究了现有的基于向量空间模型的文本聚类算法,发现这些算法都存在数据维度过高和忽略了单词之间语义关系的缺点.针对这些问题,提出一种基于单词相似度的文本聚类算法,该算法首先利用单词相似度对单词进行分类获得单词间的语义关系,然后利用产生的单词类作为向量空间的项表示文本降低了向量空间的维度,最后采用基于划分聚类方法对文本聚类.实验结果表明,相对于传统基于向量空间模型的聚类算法,该算法具有较好的聚类效果.     

基于主题模型的K-均值文本聚类

传统的向量空间模型表示文本的缺点是向量维数高,向量空间模型中一个文本是一个大的稀疏矩阵,计算文本之间的距离或者相似度时,算法的效率低,聚类效果不理想。在主题模型(Latent Dirichlet Allocation,LDA)中,将文本表示成主题(Topic)的概率分布,主题表示为词的概率分布。主题模型下,指定主题数目为T时,所有待聚类的文本都被表示成维数为T的向量。K-均值算法作为本文的聚类算法,并通过实验验证了主题模型的聚类效果要好于向量空间模型的聚类。     

一种基于LSA和Kohonen网络的文本分类新方法

文中根据隐含语义分析理论(LSA)和Kohonen网络理论提出一种文本分类新方法。应用Kohonen网络进行文本分类存在训练速度慢的缺点，因此在网络训练阶段引入了有监督机制，提高了网络的分类速度和精度；但是对于高维的文本特征向量来说，分类速度很低，甚至应用Kohonen网络进行分类，不能取得理想结果；新方法应用LSA理论来建立文本集的向量空间模型，在词条的权重中引入了语义关系，消减了原词条矩阵中包含的“噪声”因素，从而更加突出了词和文本之间的语义关系。通过奇异值分解(SVD)，有效地降低了向量空间的维数，从而大大提高了文本分类的精度和速度，同时根据因子分析理论给出了维数K的选取方法。     

基于动态适应度的基因表达式编程挖掘反函数

为提高基因表达式编程(GEP)发现知识效率,提出并实现了基因表达式编程的动态适应度函数. 将逐步权重自适应(SAW)应用于基因表达式编程中适应度函数的动态调整;将线性N维向量函数引入作为适应度函数的组件,用于提高求适应度效率;通过挖掘反函数和方程求解的实验, 表明新方法比传统基因表达式编程所求得的反函数表达式的精确度有较大的优势,性能提高约8%.     

Soft computing approach to fault diagnosis of centrifugal pump

Fault detection and isolation in rotating machinery is very important from an industrial viewpoint as it can help in maintenance activities and significantly reduce the down-time of the machine, resulting in major cost savings. Traditional methods have been found to be not very accurate. Soft computing based methods are now being increasingly employed for the purpose. The proposed method is based on a genetic programming technique which is known as gene expression programming (GEP). GEP is somewhat a new member of the genetic programming family. The main objective of this paper is to compare the classification accuracy of the proposed evolutionary computing based method with other pattern classification approaches such as support vector machine (SVM), Wavelet-GEP, and proximal support vector machine (PSVM). For this purpose, six states viz., normal, bearing fault, impeller fault, seal fault, impeller and bearing fault together, cavitation are simulated on centrifugal pump. Decision tree algorithm is used to select the features. The results obtained using GEP is compared with the performance of Wavelet-GEP, support vector machine (SVM) and proximal support vector machine (PSVM) based classifiers. It is observed that both GEP and SVM equally outperform the other two classifiers (PSVM and Wavelet-GEP) considered in the present study.     

基于一维Kohonen网络的遥感影像分类方法研究

分析了Kohonen网络的训练模式和聚类特性,选用规模相对较小的一维Kohonen网络,并调整网络输出层的规模和邻域形状,优化网络结构;同时根据多光谱遥感影像中地物波谱曲线特征,通过不同波段组合、波段权重系数调整等方法对输入数据进行预处理,使该方法更适用于多光谱遥感影像分类和专题提取.本文以浙江省绍兴地区多光谱遥感影像分类为例,研究结果表明使用改进后的分类方法可以有效提高分类精度.     

Emotion recognition from geometric facial features using self-organizing map

This paper presents a novel emotion recognition model using the system identification approach. A comprehensive data driven model using an extended Kohonen self-organizing map (KSOM) has been developed whose input is a 26 dimensional facial geometric feature vector comprising eye, lip and eyebrow feature points. The analytical face model using this 26 dimensional geometric feature vector has been effectively used to describe the facial changes due to different expressions. This paper thus includes an automated generation scheme of this geometric facial feature vector. The proposed non-heuristic model has been developed using training data from MMI facial expression database. The emotion recognition accuracy of the proposed scheme has been compared with radial basis function network, multi-layered perceptron model and support vector machine based recognition schemes. The experimental results show that the proposed model is very efficient in recognizing six basic emotions while ensuring significant increase in average classification accuracy over radial basis function and multi-layered perceptron. It also shows that the average recognition rate of the proposed method is comparatively better than multi-class support vector machine.     

基于SOM网络的随机映射文本降维方法

文中针对在文本处理的高维矢量环境中Kohonen自组织特征映射神经网络的计算瓶颈问题进行分析，引入RM(随机映射)方法并进行相应的理论分析，在此基础上提出可以运用RM方法有效并且可控地解决上述计算瓶颈问题，降低了文本处理环境中Kohonen神经网络的规模和时间、空间代价。文章通过实验证明了上述方法的有效性和正确性，从而达到提高自组织理论对于文本处理的实时性和实际可行性的目的，并对其进一步应用进行展望。     

Parallel 1D and 2D vector quantizers using a Kohonen neural network

The process of reconstructing an original image from a compressed one is a difficult problem, since a large number of original images lead to the same compressed image and solutions to the inverse problem cannot be uniquely determined. Vector quantization is a compression technique that maps an input set of k-dimensional vectors into an output set of k-dimensional vectors, such that the selected output vector is closest to the input vector according to a selected distortion measure. In this paper, we show that adaptive 2D vector quantization of a fast discrete cosine transform of images using Kohonen neural networks outperforms other Kohonen vector quantizers in terms of quality (i.e. less distortion). A parallel implementation of the quantizer on a network of SUN Sparcstations is also presented.     

Counter-Propagation Neural Networks for Molecular Sequence Classification: Supervised LVQ and Dynamic Node Allocation

A modified counter-propagation (CP) algorithm with supervised learning vector quantizer (LVQ) and dynamic node allocation has been developed for rapid classification of molecular sequences. The molecular sequences were encoded into neural input vectors using an n–gram hashing method for word extraction and a singular value decomposition (SVD) method for vector compression. The neural networks used were three-layered, forward-only CP networks that performed nearest neighbor classification. Several factors affecting the CP performance were evaluated, including weight initialization, Kohonen layer dimensioning, winner selection and weight update mechanisms. The performance of the modified CP network was compared with the back-propagation (BP) neural network and the k–nearest neighbor method. The major advantages of the CP network are its training and classification speed and its capability to extract statistical properties of the input data. The combined BP and CP networks can classify nucleic acid or protein sequences with a close to 100% accuracy at a rate of about one order of magnitude faster than other currently available methods.     

Models of self-organizing artificial neural networks to identify stationary industrial sources of air pollution

A problem of identifying one particular or a few possible pollution sources that are responsible for the deterioration of the air quality as a result of exceeding the standards of the maximum permissible emissions is considered. A model problem for a group of spatially divided stationary permanent industrial sources is solved. A statement identifying the problem and a method to solve it using two architectures of artificial neural networks, Kohonen’s networks for learning vector quantization with fixed and adaptive structures, as well as adaptive resonance theory network for analog inputs (ART-2), are presented. The method consists of clustering the data provided by self-learning algorithms (unsupervised learning). Estimation equations are given and operation algorithms of Kohonen’s and adaptive resonance theory networks at different life cycle stages are described. The results of the solution of the model problem that are obtained using each network is performed are comparatively analyzed.     

深度广度联合解码的基因表达式程序设计

基因表达式程序设计(GEP)在时间序列分析、分类、自动程序设计、多目标优化、海量数据分析等领域中有着广泛的应用。在GEP解码过程中,将深度优先和广度优先技术的优点相结合,提出了基于深度广度联合解码的GEP算法,从而既能适量地增加种群中个体的多样性,又能适当地保留较优的子树信息(sub_ET)。实验表明,相比标准GEP算法,新算法在进化时间增加不多的情况下提高了平均适应度,获得了更高的成功率。