改进的快速模糊C-均值聚类算法

为解决模糊C-均值(FCM)聚类算法在大数据量中存在的计算量大、运行时间过长的问题,提出了一种改进方法：先用多次随机取样聚类得到的类中心作为FCM算法的初始类中心,以减少FCM算法收敛所需的迭代次数;接着通过数据约减,压缩参与迭代运算的数据集,减少每次迭代过程的运算时间。该方法使FCM算法运算速度大大提高,且不影响算法的聚类效果。     

Modified Gath-Geva fuzzy clustering for identification of Takagi-Sugeno fuzzy models

The construction of interpretable Takagi-Sugeno (TS) fuzzy models by means of clustering is addressed. First, it is shown how the antecedent fuzzy sets and the corresponding consequent parameters of the TS model can be derived from clusters obtained by the Gath-Geva (GG) algorithm. To preserve the partitioning of the antecedent space, linearly transformed input variables can be used in the model. This may, however, complicate the interpretation of the rules. To form an easily interpretable model that does not use the transformed input variables, a new clustering algorithm is proposed, based on the expectation-maximization (EM) identification of Gaussian mixture models. This new technique is applied to two well-known benchmark problems: the MPG (miles per gallon) prediction and a simulated second-order nonlinear process. The obtained results are compared with results from the literature.     

改进微分进化算法的半监督模糊聚类

通过对已标示和未标示数据的学习和分类,提出一种改进微分进化算法的半监督模糊聚类。先从大量的数据中选取一小部分进行标记,然后利用标记数据来指导进化过程,实现对未标记数据的分类。通过参考粒子群算法惯性权重思想,引入惯性加权系数,在计算初期能够维持个体的多样性,后期能够加快算法的收敛速度,有效提高了算法的性能。遥感图像数据实验结果显示该方法可以提高分类精度。     

A new fuzzy cover approach to clustering

This paper presents a new fuzzy cover-based clustering algorithm. In the proposed algorithm, the concept of fuzzy cover and objective function are employed to identify holding points in the dataset, and we associate these holding points together to build up the backbones of the final clusters. Three specific objectives underlie the presentation of the proposed approach in this paper. The first is to describe mathematical formulation of the fuzzy covers, and the second is to summarize the detailed procedure of constructing fuzzy covers and splicing them into clusters. The third goal is to demonstrate that this approach is able to find out reasonable representative patterns in the final clusters. We illustrate this approach with four examples in order to verify the clustering effectiveness.     

直觉模糊集的聚类方法研究

对基于直觉模糊集的聚类问题进行了研究．首先给出直觉模糊相似度的概念,并构建了直觉模糊相似矩阵和直觉模糊等价矩阵;然后定义了直觉模糊相似矩阵的合成运算法则．给出直觉模糊相似矩阵转化为直觉模糊等价矩阵的途径;此外．还分别定义了直觉模糊相似矩阵和直觉模糊等价矩阵的λ-截矩阵,进而给出了直觉模糊集的一种聚类方法;最后通过算例对该方法进行了说明和分析．     

Semi-supervised fuzzy clustering: A kernel-based approach

Semi-supervised clustering algorithms aim to improve the clustering accuracy under the supervisions of a limited amount of labeled data. Since kernel-based approaches, such as kernel-based fuzzy c-means algorithm (KFCM), have been successfully used in classification and clustering problems, in this paper, we propose a novel semi-supervised clustering approach using the kernel-based method based on KFCM and denote it the semi-supervised kernel fuzzy c-mean algorithm (SSKFCM). The objective function of SSKFCM is defined by adding classification errors of both the labeled and the unlabeled data, and its global optimum has been obtained through repeatedly updating the fuzzy memberships and the optimized kernel parameter. The objective function may have more than one local optimum, so we employ a function transformation technique to reformulate the objective function after a local minimum has been obtained, and select the best optimum as the solution to the objective function. Experimental results on both the artificial and several real data sets show SSKFCM performs better than its conventional counterparts and it achieves the best accurate clustering results when the parameter is optimized.     

Supplier selection using a novel intuitionist fuzzy clustering approach

Supplier selection is a complicated decision-making problem involving multicriteria, alternative and decision makers (DMs). The main purpose of this paper is to demonstrate the use of a clustering-based method to solve a group decision making (GDM) problem and, also to achieve more realistic and homogeneous results. Intuitionistic fuzzy value (IFV) is used to show the decision makers’ preferences and IFN clustering method is utilized to cluster around DM's preferences. Intuitionistic fuzzy weighted geometric (IFWG) is applied to aggregate the obtained clusters. Ranking process is used based on the two indices, score function and accuracy function, to rank the alternatives. Lastly, to demonstrate the efficiency of our proposed method, it is implemented to choose suppliers in a car factory.The strength of the propose approach is considering the group agreement on proposed DMs’ preferences for giving different effect on their judgment. Besides, encountering the qualitative judgment of DMs using IFV concept with score function and the accuracy function for modeling the DMs’ knowledge is the other contribution of this paper.     

A loose-pattern process approach to clustering fuzzy data sets

A loose-pattern process approach to clustering sets consists of three main computations: loose-pattern reject option, tight-pattern classifcation, and loose-pattern assigning classes. The loose-pattern rejection is implemented using a rule based on q nearest neighbors of each point. Two clustering methods, GLC and OUPIC, are introduced as tight-pattern clustering techniques. The decisions of loose-pattern assigning classes are related to a heuristic membership function. The function and experiments with one set is discussed.     

新相似性度量在文档模糊聚类中的应用研究

相似文档检索在文档管理中是很重要的,提出一种在大文档集中基于模糊聚类的快速高效的聚类方法,传统方法大都通过词与词之间的比较来检索文档,该方法让文档通过两层结构得出相似度。系统用预定义模糊簇来描述相似文档的特征向量,用这些向量估计相似度,由此得出文档之间的距离,系统应用了新的相似性度量方法,并通过实验证实了其可行性和高效性。     

A new kernel-based fuzzy clustering approach: support vector clustering with cell growing

In this paper, the support vector clustering is extended to an adaptive cell growing model which maps data points to a high dimensional feature space through a desired kernel function. This generalized model is called multiple spheres support vector clustering, which essentially identifies dense regions in the original space by finding their corresponding spheres with minimal radius in the feature space. A multisphere clustering algorithm based on adaptive cluster cell growing method is developed, whereby it is possible to obtain the grade of memberships, as well as cluster prototypes in partition. The effectiveness of the proposed algorithm is demonstrated for the problem of arbitrary cluster shapes and for prototype identification in an actual application to a handwritten digit data set.     

Modified semi-supervised affinity propagation clustering with fuzzy density fruit fly optimization

Neural Computing and Applications - Affinity propagation (AP) is a clustering method that takes as input measures of similarity between pairs of data points. As the oscillations and preference...     

A multi-agent-based approach for fuzzy clustering of large image data

Data clustering usually requires extensive computations of similarity measures between dataset members and cluster centers, especially for large datasets. Image clustering can be an intermediate process in image retrieval or segmentation, where a fast process is critically required for large image databases. This paper introduces a new approach of multi-agents for fuzzy image clustering (MAFIC) to improve the time cost of the sequential fuzzy \(c\)-means algorithm (FCM). The approach has the distinguished feature of distributing the computation of cluster centers and membership function among several parallel agents, where each agent works independently on a different sub-image of an image. Based on the Java Agent Development Framework platform, an implementation of MAFIC is tested on 24-bit large size images. The experimental results show that the time performance of MAFIC outperforms that of the sequential FCM algorithm by at least four times, and thus reduces the time needed for the clustering process.     

结合模糊C均值聚类与图割的图像分割方法

本文针对模糊C均值聚类没有考虑像素空间信息的不足,提出一种结合模糊C均值聚类与图割的图像分割方法。本文以图割理论为基础,考虑到像素的空间信息,建立一个关于标号的全局能量函数,以FCM聚类中心为终端建立多终端网络图,该网络通过 扩展移动算法求解全局最小或近似最小能量函数所对应的标号函数 ,在各类间重新划分所有像素点,实现目标正确分割。实验表明,本文方法在分割精度、性能、抗噪性等方面均有较大改进。     

结合可信度模糊评价与动态聚类的构件选择

开放、动态的Internet环境下,网构软件面临可信性的重大挑战。运用模糊理论,提出了一种满足最贴近用户可信度期望的构件选择方法。该方法中,定义了网构软件环境下构件的6种可信属性,介绍了一种多因素的构件可信度模糊综合评价方法,以此为基础,建立了一种满足用户可信度期望的关键词：网构软件;可信计算;构件选择;模糊综合评价;动态聚类网构软件模型,为实现候选构件与抽象构件的映射,应用基于模糊等价关系的动态聚类实现可信构件的选择。结合案例说明了方法的有效性。     

Collaborative fuzzy clustering

In this study, we introduce a new clustering architecture in which several subsets of patterns can be processed together with an objective of finding a structure that is common to all of them. To reveal this structure, the clustering algorithms operating on the separate subsets of data collaborate by exchanging information about local partition matrices. In this sense, the required communication links are established at the level of information granules (more specifically, fuzzy sets forming the partition matrices) rather than patterns that are directly available in the databases. We discuss how this form of collaboration helps meet requirements of data confidentiality. A detailed clustering algorithm is developed on a basis of the standard FCM method and illustrated by means of numeric examples.     

Convex-set-based fuzzy clustering

Prototype-based methods are commonly used in cluster analysis and the results may be highly dependent on the prototype used. We propose a two-level fuzzy clustering method that involves adaptively expanding and merging convex polytopes, where the convex polytopes are considered as a “flexible” prototype. Therefore, the dependency on the use of a specified prototype can be eliminated. Also, the proposed method makes it possible to effectively represent an arbitrarily distributed data set without a priori knowledge of the number of clusters in the data set. In the first level of our proposed method, each cluster is represented by a convex polytope which is described by its set of vertices. Specifically, nonlinear membership functions are utilized to determine whether an input pattern creates a new cluster or whether an existing cluster should be modified. In the second level, the expandable clusters that are selected by an intercluster distance measure are merged to improve clustering efficiency and to reduce the order dependency of the incoming input patterns. Several experimental results are given to show the validity of our method     

Accelerating fuzzy clustering

This paper extends earlier work [C. Borgelt, R. Kruse, Speeding up fuzzy clustering with neural network techniques, in: Proceedings of the 12th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE’03, St. Louis, MO, USA), IEEE Press, Piscataway, NJ, USA, 2003] on an approach to accelerate fuzzy clustering by transferring methods that were originally developed to speed up the training process of (artificial) neural networks. The core idea is to consider the difference between two consecutive steps of the alternating optimization scheme of fuzzy clustering as providing a gradient. This “gradient” may then be modified in the same way as a gradient is modified in error backpropagation in order to enhance the training. Even though these modifications are, in principle, directly applicable, carefully checking and bounding the update steps can improve the performance and can make the procedure more robust. In addition, this paper provides a new and much more detailed experimental evaluation that is based on fuzzy cluster comparison measures [C. Borgelt, Resampling for fuzzy clustering, Int. J. Uncertainty, Fuzziness Knowledge-based Syst. 15 (5) (2007), 595-614], which can be used nicely to study the convergence speed.     

A real time hydrological forecasting system using a fuzzy clustering approach

A new technique to predict extreme and rare situations of hydrometric levels in hydrological basins is presented in this paper. A fuzzy logic approach has been exploited for the adaptive clustering of input data and for the forecasting model. The methodology has been developed, in collaboration with an Italian manufacturer of meteorological and environmental sensing equipment, for the design of a system prototype to be installed in the “Padule di Fucecchio” basin in Middle-North of Italy. All the presented data come from monitoring equipments installed in this basin. The effectiveness of the method has been evaluated by comparing the performance to that obtained with a neural network forecasting approach.     

A min-max approach to fuzzy clustering, estimation, and identification

This study, for any unknown physical process y=f(x/sub 1/,...,x/sub n/), is concerned with the: 1) fuzzy partition of n-dimensional input space X=X/sub 1//spl times//spl middot//spl middot//spl middot//spl times/X/sub n/ into K different clusters, 2) estimating the process behavior y/spl circ/=f(x/spl circ/) for a given input x/spl circ/=(x/spl circ//sub 1/,/spl middot//spl middot//spl middot/,x/spl circ//sub n/)/spl isin/X, and 3) fuzzy approximation of the process, with uncertain input-output identification data {(x(k)/spl plusmn//spl delta/x/sub k/),(y(k)/spl plusmn/v/sub k/)}/sub k=1,.../, using a Sugeno type fuzzy inference system. A unified min-max approach (that attempts to minimize the worst-case effect of data uncertainties and modeling errors on estimation performance), is suggested to provide robustness against data uncertainties and modeling errors. The proposed method of min-max fuzzy parameters estimation does not make any assumption and does not require a priori knowledge of upper bounds, statistics, and distribution of data uncertainties and modeling errors. To show the feasibility of the approach, simulation studies and a real-world application of physical fitness classification based on the fuzzy interpretation of physiological parameters, have been provided.