基于概率典型性和聚类排斥的无噪声模糊聚类方法

提出了建立在概率典型性和聚类排斥基础上的一个新型无噪声模糊聚类方法RTCM，给出了它的迭代算法过程，并验证了它的收敛性．首先引述了一般的聚类方法，它们主要分为两种：噪声聚类，如模糊c均值（FCM）、可能模糊c均值（FPCM）；无噪声聚类，如NC、PCM等，然后给出了RTCM算法模型和过程，并验证了它的局部收敛性．该算法解决噪声环境下的数据聚类问题，避免了重叠聚类．对比试验表明，该算法改善了噪声环境下FCM，NC、PCM、FPCM的聚类中心质量，有效地解决了PCM在近邻聚类数据中的聚类重叠问题．     

基于汉字与部件聚类的计算机模拟研究

以自组织特征映射算法为理论基础，提出了一种新的SOMNET算法，利用人工神经网络实现了具有相似特征的汉字的聚类以及汉字部件的聚类。并对汉字及其部件的显示效果进行了分析，从不同角度刻画了SOM模型的应用。研究结果对于汉字认知研究以及留学生第二语言习得教学具有一定的参考价值。     

Identification of piecewise affine systems based on statistical clustering technique

This paper is concerned with the identification of a class of piecewise affine systems called a piecewise affine autoregressive exogenous (PWARX) model. The PWARX model is composed of ARX sub-models each of which corresponds to a polyhedral region of the regression space. Under the temporary assumption that the number of sub-models is known a priori, the input-output data are collected into several clusters by using a statistical clustering algorithm. We utilize support vector classifiers to estimate the boundary hyperplane between two adjacent regions in the regression space. In each cluster, the parameter vector of the sub-model is obtained by the least squares method. It turns out that the present statistical clustering approach enables us to estimate the number of sub-models based on the information criteria such as CAIC and MDL. The estimate of the number of sub-models is performed by applying the identification procedure several times to the same data set, after having fixed the number of sub-models to different values. Finally, we verify the applicability of the present identification method through a numerical example of a Hammerstein model.     

传感器网络目标恢复算法研究

分析了传感器网络在目标跟踪过程中产生目标丢失故障的原因.在此基础上采用分簇设计思想,通过对跟踪目标移动速度的计算和目标搜寻区域的建立等方法,提出了目标丢失故障恢复新的算法和技术.实验证明,所提出的算法和技术在延长传感器网络生存时间前提下,能够有效地解决跟踪目标发生丢失故障后目标快速恢复问题.     

一种基于SOM的中文文本两阶段快速聚类方法应用研究

研究了一种基于自组织神经网络的中文文档聚类方法,按照提出的中文聚类模型,该方法首先对文档进行SOM训练产生初步的聚类结果,然后对第一次聚类结果进行基于参考点和密度的快速聚类,理论分析和实验结果也证明了该方法适合高维中文文档的聚类,与直接聚类方法相比,该方法提高了聚类的效果,减少了计算时间。     

ITS智能车辆横向运动模式空间构造算法研究

针对ITS（intelligent transport system）智能车辆复杂的非线性结构和时变特性，提出了以空间代替时间建立IV（intelligent vehicle）横向运动模式空间的思想。通过改变车辆的各种参数，针对车体的数学模型采集车体在各种环境条件下的模拟运动控制信息，以模糊C均值算（FCM）为基础，推导出车辆运动模式空间的构造算法．该构造算法能够客观地对测量数据进行有效聚类，聚类清晰，模式子空间划分清楚，从而为车辆运动模式空间的构造提供了一种理论依据．最后对样本数据的泉类和模式空间的构造算法进行了仿真，结果证明了算法的有效性和可行性．     

The development and initial evaluation of the Survey of Readiness for Alcoholics Anonymous Participation.

This article presents 5 studies related to the development and initial evaluation of the Survey of Readiness for Alcoholics Anonymous Participation (SYRAAP). The SYRAAP is a brief, multidimensional, self-administered instrument that assesses beliefs associated with Alcoholics Anonymous (AA) participation. Study 1 generated 239 candidate items for potential inclusion in the instrument. Study 2 assessed the content validity of these items according to 3 criteria and identified a subset of 60 with the highest values on the criteria for further consideration. Study 3 produced a shorter version of the SYRAAP and evaluated its structure, internal reliability, and validity. Study 4 reevaluated the structure and internal reliability of the SYRAAP and yielded findings that were generally consistent with those from Study 3. Study 5 established stability reliability for the instrument. The collective findings indicated the SYRAAP can reliably and validly assess individual-level beliefs associated with AA participation. The potential use of the SYRAAP for researchers and clinicians, along with limitations of the work presented here, are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Utilizing Genetic Algorithms to Optimize Membership Functions for Fuzzy Weighted Association Rules Mining

It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unrealistic that experts can always provide such sets. And finding the most appropriate fuzzy sets becomes a more complex problem when items are not considered to have equal importance and the support and confidence parameters required for the association rules mining process are specified as linguistic terms. Existing clustering based automated methods are not satisfactory because they do not consider the optimization of the discovered membership functions. In order to tackle this problem, we propose Genetic Algorithms (GAs) based clustering method, which dynamically adjusts the fuzzy sets to provide maximum profit based on user specified linguistic minimum support and confidence terms. This is achieved by tuning the base values of the membership functions for each quantitative attribute with respect to two different evaluation functions maximizing the number of large itemsets and the average of the confidence intervals of the generated rules. To the best of our knowledge, this is the first effort in this direction. Experiments conducted on 100 K transactions from the adult database of United States census in year 2000 demonstrate that the proposed clustering method exhibits good performance in terms of the number of produced large itemsets and interesting association rules.     

层次凝聚算法在商品个性化推荐中的应用

商品的个性化推荐是电子商务个性化服务中非常重要的一个方面,而聚类协作过滤则是推荐系统中采用最为广泛的技术。在基于聚类协作过滤的商品个性化推荐中的聚类算法通常采用划分聚类,文章根据电子商务网站的特点,提出了用改进的Rock层次凝聚算法Improved-Rock实现基于购买商品类别相似性的用户聚类。模拟实验结果表明该算法的应用是有实际价值的。     

Web文本挖掘技术及其应用的研究

文章详细研究了Web文本挖掘的定义及类型，重点分析了Web文本挖掘算法，总结了文本挖掘的应用，提出了今后工作的重点。