A modified rough c-means clustering algorithm based on hybrid imbalanced measure of distance and density

Traditional c-means clustering partitions a group of objects into a number of non-overlapping sets. Rough sets provide more flexible and objective representation than classical sets with hard partition and fuzzy sets with subjective membership function for a given dataset. Rough c-means clustering and its extensions were introduced and successfully applied in many real life applications in recent years. Each cluster is represented by a reasonable pair of lower and upper approximations. However, the most available algorithms pay no attention to the influence of the imbalanced spatial distribution within a cluster. The limitation of the mean iterative calculation function, with the same weight for all the data objects in a lower or upper approximation, is analyzed. A hybrid imbalanced measure of distance and density for the rough c-means clustering is defined, and a modified rough c-means clustering algorithm is presented in this paper. To evaluate the proposed algorithm, it has been applied to several real world data sets from UCI. The validity of this algorithm is demonstrated by the results of comparative experiments.     

基于对象多属性差异的灰色发展聚类方法及应用

在现实决策问题中,决策对象在不同时期行为状态和所属类型往往呈现一定的发展规律,而现有聚类方法难以充分挖掘聚类对象的发展信息、对象间的关系信息和发展属性的差异信息。为有效处理此类问题,考虑到研究对象的发展趋势、发展行为和发展绝对量与增长量的属性差异,采用GM(1,1)和灰色定权聚类方法,构建了基于对象多属性差异的灰色发展聚类方法,并以我国区域高新技术产业化聚类评估问题为例验证了模型的有效性与合理性。结果表明,所构建模型能够有效描述研究对象呈现发展趋势或未来行为,并实现对研究对象的有效聚类。     

基于免疫模板聚类的模糊中波红外图像目标提取

借鉴生物先天性免疫与适应性免疫的协调作用机制,综合考虑中波红外图像的光谱成像机理和频域模板统计特征,提出一种免疫模板聚类目标提取算法。借鉴先天性免疫对抗原表面分子模式的识别作用,以最大类间方差,将模糊中波红外图像初分割为目标像素集、背景像素集和模糊像素集;借鉴先天性免疫的特征提呈作用,提取中波红外图像模糊像素的频域模板特征,将图像的像素灰度特征空间映射为频域模板特征空间;基于提呈得到的模板特征,对模糊像素集进行适应性免疫聚类,将模糊像素划分为目标像素或背景像素。用手部痕迹的模糊中波红外图像进行实验,并与经典边缘检测模板法和传统区域模板法进行了效果比较和定量评价,结果表明免疫模板聚类算法的目标提取率、与参考标准的重合度、绝对误差率均优于现有模板方法,能够有效实现模糊中波红外图像的目标提取。     

高维稳健主成分聚类方法及其应用研究

随着信息技术的高速发展,每条数据所包含的信息越来越丰富,使得数据不可避免地含有异常值,且随着维数的增加,异常值出现的可能性更大。传统的主成分聚类分析对异常值特別敏感,基于MCD估计的主成分聚类方法虽然对异常值具有防御作用,但是在高维数据下MCD估计的偏差过大,其稳健性显著降低,而且当维数大于观测值个数时MCD估计失效。为此本文提出了基于MRCD估计的稳健主成分聚类方法,数值模拟和实证分析表明,基于MRCD估计的主成分聚类分析的效果优于传统的主成分聚类分析和基于MCD估计的主成分聚类分析,尤其是在维数大于样本观测值的情况下,MRCD估计更为有效。     

基于选择性支持向量机集成的混沌时间序列预测

提出了一种基于聚类的选择性支持向量机集成预测模型.为提高支持向量机集成的泛化能力，采用自组织映射和K均值聚类算法结合的聚类组合算法，从每簇中选择出精度最高的子支持向量机进行集成，可以保证子支持向量机有较高精度并提高了子支持向量机之间的差异度.该方法能以较小的代价显著提高支持向量机集成的泛化能力.采用该方法对Mackey-Glass混沌时间序列和Lorenz系统生成的混沌时间序列进行预测实验，结果表明可以对混沌时间序列进行准确预测，验证了该方法的有效性. 关键词： 支持向量机 集成 混沌时间序列 聚类     

Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering

The data clustering problem consists in dividing a data set into prescribed groups of homogeneous data. This is an NP-hard problem that can be relaxed in the spectral graph theory, where the optimal cuts of a graph are related to the eigenvalues of graph 1-Laplacian. In this paper, we first give new notations to describe the paths, among critical eigenvectors of the graph 1-Laplacian, realizing sets with prescribed genus. We introduce the pseudo-orthogonality to characterize m₃(G), a special eigenvalue for the graph 1-Laplacian. Furthermore, we use it to give an upper bound for the third graph Cheeger constant h₃(G), that is, h₃(G) 6 m₃(G). This is a first step for proving that the k-th Cheeger constant is the minimum of the 1-Laplacian Raylegh quotient among vectors that are pseudo-orthogonal to the vectors realizing the previous k - 1 Cheeger constants. Eventually, we apply these results to give a method and a numerical algorithm to compute m₃(G), based on a generalized inverse power method.     

基于自适应径向基神经网络的类星体光谱自动识别方法

通过对光谱的研究来识别和认证类星体是天文学研究中的重要方法。文章提出了一种对类星体光谱进行自动识别的自适应径向基神经网络(RBFN)方法。该方法包括以下几个步骤: (1)先将训练样本归一化,再利用PCA变换进行降维,获得样本特征向量; (2)设计出K均值聚类算法与梯度下降法相结合的径向基神经网络结构的基本模型,再用SSE(sum of squares error)误差函数进行判断,对RBFN隐含层的神经元进行自动调节,直至满足给定误差阈值; (3)用训练得到的参数对用于测试的样本中的类星体光谱进行识别。该方法不但克服了经典RBFN算法选择隐层神经元数目的困难,而且还提高了对类星体识别的稳定性和正确率。研究结果对于大型光谱巡天所产生的海量数据的自动处理具有重要意义。     

The k-means range algorithm for personalized data clustering in e-commerce

This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications.     

一种基于遗传优化的BP神经网络的测光红移估计算法

除了星系的光谱红移之外,星系测光红移的估计也对研究宇宙大尺度结构及演变有着重要的研究意义。利用斯隆巡天项目最新发布的SDSS DR13的150 000个星系的测光及光谱数据,在红移值Z<0.8范围内,先使用SOM自组织神经网络对星系样本进行早型星系和晚型星系的聚类,然后用遗传算法优化后的BP神经网络对星系的测光红移进行估算。估算结果与作为标准的已知星系光谱红移进行比对,早型星系的红移估计最小均方误差约为0.001 3,晚型星系最小均方误差约为0.001 7。实验结果表明,遗传优化的BP算法在精度上优于BP神经网络算法,且效率上优于K近邻、核回归等传统测光红移估计算法。     

Finding All Maximal Cliques in Dynamic Graphs

Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like G _t = (V,E _t), where E _{t – 1} E _t, t = 1,...,T; E ₀ = . In this article algorithms are provided to track all maximal cliques in a fully dynamic graph.