A powerful hybrid clustering method based on modified stem cells and Fuzzy C-means algorithms

One of the simple techniques for Data Clustering is based on Fuzzy C-means (FCM) clustering which describes the belongingness of each data to a cluster by a fuzzy membership function instead of a crisp value. However, the results of fuzzy clustering depend highly on the initial state selection and there is also a high risk for getting the best results when the datasets are large. In this paper, we present a hybrid algorithm based on FCM and modified stem cells algorithms, we called it SC-FCM algorithm, for optimum clustering of a dataset into K clusters. The experimental results obtained by using the new algorithm on different well-known datasets compared with those obtained by K-means algorithm, FCM, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Artificial Bee Colony (ABC) Algorithm demonstrate the better performance of the new algorithm.     

Trust estimation of the semantic web using semantic web clustering

Abstract

Development of semantic web and social network is undeniable in the Internet world these days. Widespread nature of semantic web has been very challenging to assess the trust in this field. In recent years, extensive researches have been done to estimate the trust of semantic web. Since trust of semantic web is a multidimensional problem, in this paper, we used parameters of social network authority, the value of pages links authority and semantic authority to assess the trust. Due to the large space of semantic network, we considered the problem scope to the clusters of semantic subnetworks and obtained the trust of each cluster elements as local and calculated the trust of outside resources according to their local trusts and trust of clusters to each other. According to the experimental result, the proposed method shows more than 79% Fscore that is about 11.9% in average more than Eigen, Tidal and centralised trust methods. Mean of error in this proposed method is 12.936, that is 9.75% in average less than Eigen and Tidal trust methods.     

Cluster center initialization algorithm for K-modes clustering

Partitional clustering of categorical data is normally performed by using K-modes clustering algorithm, which works well for large datasets. Even though the design and implementation of K-modes algorithm is simple and efficient, it has the pitfall of randomly choosing the initial cluster centers for invoking every new execution that may lead to non-repeatable clustering results. This paper addresses the randomized center initialization problem of K-modes algorithm by proposing a cluster center initialization algorithm. The proposed algorithm performs multiple clustering of the data based on attribute values in different attributes and yields deterministic modes that are to be used as initial cluster centers. In the paper, we propose a new method for selecting the most relevant attributes, namely Prominent attributes, compare it with another existing method to find Significant attributes for unsupervised learning, and perform multiple clustering of data to find initial cluster centers. The proposed algorithm ensures fixed initial cluster centers and thus repeatable clustering results. The worst-case time complexity of the proposed algorithm is log-linear to the number of data objects. We evaluate the proposed algorithm on several categorical datasets and compared it against random initialization and two other initialization methods, and show that the proposed method performs better in terms of accuracy and time complexity. The initial cluster centers computed by the proposed approach are close to the actual cluster centers of the different data we tested, which leads to faster convergence of K-modes clustering algorithm in conjunction to better clustering results.     

一种新的聚类有效性函数:模糊划分的模糊熵

模糊聚类分析结果是否合理的问题属于模糊聚类有效性判定课题,其核心是模糊聚类有效性函数的构造。文中基于序关系定义了模糊划分模糊熵来描述模糊划分的模糊程度。考虑到现有的一类有效的模糊聚类有效性函数就是基于数据集的模糊划分的,因此文中也用模糊划分的模糊熵作为聚类有效性函数。实验表明,模糊划分的模糊熵作为模糊聚类的有效性函数是合理的、可行的。     

改进FCM和LFP相结合的白细胞图像分类

研究白细胞图像分类识别中有效的图像分割与特征提取方法,以提高白细胞图像的正确识别率.由于某些白细胞(粒细胞)中颗粒的存在,严重影响细胞核与细胞质区域的正确分割,通过将空间信息与核函数融入模糊C-均值聚类(FCM)算法,提出一种改进的FCM算法.应用该算法对白细胞图像进行分割,并采用数学形态学方法对分割后的图像进行处理,获得了很好的分割效果,解决了粒细胞的质核分割难题.对于细胞的纹理特征提取,通过对局部二值模式(LBP)中阈值参数的模糊化,建立了基于局部模糊模式(LFP)的纹理特征提取算法.运用本文方法进行图像分割和纹理提取,以支持向量机作为分类器,对CellAtlas的100幅白细胞图像进行了分类识别的实验,结果表明白细胞的正确识别率达到93％.     

基于改进能量分区控制传感网络通信优化仿真

当前无线传感网络中的节点分布可能存在极不均匀现象,造成节点能量消耗不集中,远离Sink节点的簇头能耗较大,破坏传感网络覆盖拓扑结构,导致网络的能量不均衡现象,通信受阻.为解决上述问题,提出了一种基于模糊c均值节点能量分区控制算法.利用混沌序列的均匀遍历特性和差分进化算法的高效全局搜索能力,对传感网络内的节点能量属性进行分类搜索,利用Logistics混沌映射对头节点进行优化分区操作,把混沌扰动量引入到节点能量分区当中,完成最优能量节点的选择,优化通信过程.仿真结果证明,算法对无线传感网络最优节点的聚类性能效果提高明显,通信效率提高25％以上.具有很好的实际应用性能和效果.     

一种新的不确定树模式聚类算法

不确定树模式聚类是数据挖掘领域中的一个重要问题,提出了一种新的不确定树模式聚类算法,有效地解决了因数据的不确定性而导致的无法聚类的问题.为了更加准确地度量树模式之间的相似性,提出了一种语义相似度计算方法与结构相似度计算方法.设计了一个动态聚类过程,自适应获取聚类阈值,较大程度上减少了人为干扰导致聚类结果不准确的影响,使得具有相似结构的子树聚集在同一个相似分组中,不同分组之间的子树相似度达到最小化.通过模拟数据和真实环境两部分实验表明,算法有效可行,聚类结果较准确且具有较好的运行效率.     

制糖过程中递归模糊神经网络软测量技术

糖厂澄清工段过程包含复杂的物理和化学反应,具有非线性、大滞后和不确定性的特点,难以建立精确的机理模型.常规神经网络建模是静态映射,实际应用中,权值的调节不能充分利用工业生产现场的动态数据信息,效果不理想.为此,提出了含有递归环节的T-S模糊神经网络(TSRFNN)结构,采用混沌BP学习算法引入非线性自反馈项获得复杂系统的动力学特征,通过与常规T-S模糊神经网络(TSFNN)在糖厂澄清工段过程的建模与仿真试验中进行比较,结果表明,在处理这类时变复杂系统建模方面TSRFNN表现出更加优越的性能,获得了非线性系统的全局最优模型.     

兼容弱连通簇的Ad Hoc网络分簇算法

现有分簇算法生成的簇结构都是强连通的单一结构,无法充分利用节点资源.针对该问题,提出一种兼容弱连通簇的分簇算法.定义符合弱连通簇的邻居表结构,并阐述邻居表维护策略,该算法去除簇成员与簇首强连通的条件限制,从而可选择更优的节点作为簇首.分析结果表明,该算法得到的簇结构具有较好的稳定性和持续性.     

结合mean-shift与MST的K-means聚类算法

针对初始点选择不当导致K—means陷入局部最小值问题,提出一种结合自适应mean-shift与最小生成树（MST）的K—means聚类算法。将数据对象投影到主成分分析（PCA）子空间,给出自适应mean．shift算法,并在PCA子空间内将数据向密度大的区域聚集,再利用MST与图连通分量算法,找出数据的类别数和类标签,据此计算原始空间的密度峰值,并将其作为K．means聚类的初始中心点。对K—means的目标函数、聚类精度和运行时间进行比较,结果表明,该算法在较短的运行时间内能给出较优的全局解。