一种基于子集测度的FCM聚类加权指数计算方法

在模糊C均值(Fuzzy C-Means,FCM)聚类应用过程中,针对目前模糊加权指数的确定缺乏理论依据和有效评价方法这一问题,提出了一种基于子集测度的模糊加权指数计算方法.首先根据子集测度理论定义了一个聚类有效性函数,然后依据该函数在聚类过程中通过循环进化迭代来计算聚类结果的有效性,并将其值反馈到模糊加权指数m的变化中,而使m收敛到一个稳定解,即得到最佳模糊加权指数.理论分析和实验表明,该算法是有效的,为模糊加权指数m的探讨研究提供了一种新的思路和途径.     

硬聚类和模糊聚类的结合——双层FCM快速算法

模糊c均值(FCM)聚类算法在模式识别领域中得到了广泛的应用,但FCM算法在大数据集的情况下需要大量的CPU时间,令用户感到十分不便,提高算法的速度是一个急待解决的问题。本文提出的双层FCM聚类算法是一种快速算法,它体现了硬聚类和模糊聚类的结合,以硬聚类的结果对模糊聚类的初始值进行指导,从而明显地缩短了迭代过程。双层FCM算法所用的CPU时间仅为FCM算法的十三分之一,因而具有很强的实用价值。     

一种基于CS-FCM算法的模糊时间序列预测模型

为了发挥模糊理论在不确定性预测中的优势并保留模糊时间序列(FTS)预测模型的可解释性,本文针对目前应用广泛的模糊C均值聚类(FCM)算法进行改进,提出了一种基于布谷鸟搜索的FCM (CS-FCM)算法.将CS-FCM算法用于模糊时间序列模型的非均匀论域划分与数据的模糊化处理,建立一种基于CS-FCM算法的模糊时间序列预测模型.该算法可实现聚类中心的全局寻优,降低传统FCM算法易陷入局部极小值带来的误差,提高模型预测精度.实证分析结果表明, CS-FCM算法的适应度优于FCM算法,本文模型的预测误差小于经典模糊时间序列预测模型,验证了新预测模型的有效性.     

基于AFS拓扑和FCM的模糊聚类分析

聚类分析是数据挖掘的一个重要研究课题，模糊聚类是聚类分析的一个有效手段。本文在分析AFS方法和FCM算法的基础上，设计了一个基于AFS拓扑和FCM的模糊聚类算法，进行iris数据的聚类实验证明它聚类结果优于传统的FCM聚类算法，具有很好的推广性和实际应用价值。     

改进的遗传模糊聚类算法

对基于遗传算法的FCM(模糊c^-均值法)聚类算法进行了改进,能更好地把遗传算法的全局搜索能力和FCM的局部搜索能力结合起来。实验结果表明,这种改进的算法在分类正确率和稳定性上优于[1]和[3]中的方法;收敛速度和对初值的敏感性都明显优于FCM。     

基于微分进化算法的FCM图像分割算法

为提高模糊C均值(FCM)算法的自动化程度,提出基于微分进化算法的FCM图像分割算法(DEFCM),利用微分进化算法全局性和鲁棒性的特点自动确定分类数和初始聚类中心,再将其作为模糊c均值聚类的初始聚类中心,弥补FCM算法的不足.实验表明该算法不仅能够正确地对图像分类,而且能获得较好的图像分割效果和质量.     

权监督多级模糊优选模型

本从多级模糊优选概念出发，建立一种以决策经验，偏好为监督，在方案优选确定过程中融合主、客观权重，同时确定评价指标权重和决策方案优属度的权监督多级模糊优选算法。     

多产品模糊存储模型及算法

提出了一个需求为模糊数,产品存储空间有模糊约束的多产品EOQ模型,并采用两种方法进行求解.一种是结合模糊仿真技术和遗传算法的混合算法进行求解,另一种是将模糊模型转化为清晰模型,再用算法求解.最后举出具体数值实例,对两种方法的求解结果进行比较.     

多目标决策二级模糊优选模型

研究了近年来多目标决策系统模糊优选理论的发展状况,基于一种新的目标函数,给出了求解最优优属度与最优指标权重的模糊迭代算法;依据“数字-信息-知识”的思维,从系统的稳定性和可靠性角度,对原始数据进行信息挖掘,提出了二级模糊优选理论模型,进一步丰富了模糊优选理论模型.将提出的模糊决策模型应用于1 6家电炉炼钢企业的模糊综合评价决策,取得了较为满意的结果.     

基于自适应模糊聚类的T-S模糊辨识方法

针对模糊建模在进行结构辨识时需事先设定聚类数的问题,本文在改进模糊分割聚类算法的基础上,对算法中聚类数c给出优选方法,提出了参数自适应模糊聚类算法,并结合递推最小二乘法构建T-S模糊辨识算法。为了验证本文提出的模糊辨识方法的有效性,采用该算法对熟知的Box-Jenkins煤气炉数据和实际的电液位置伺服系统数据进行建模,结果显示该辨识方法具有较高的逼近精度和较好的泛化能力。     

An new initialization method for fuzzy c-means algorithm

In this paper an initialization method for fuzzy c-means (FCM) algorithm is proposed in order to solve the two problems of clustering performance affected by initial cluster centers and lower computation speed for FCM. Grid and density are needed to extract approximate clustering center from sample space. Then, an initialization method for fuzzy c-means algorithm is proposed by using amount of approximate clustering centers to initialize classification number, and using approximate clustering centers to initialize initial clustering centers. Experiment shows that this method can improve clustering result and shorten clustering time validly.     

On the use of divergence distance in fuzzy clustering

Clustering algorithms divide up a dataset into a set of classes/clusters, where similar data objects are assigned to the same cluster. When the boundary between clusters is ill defined, which yields situations where the same data object belongs to more than one class, the notion of fuzzy clustering becomes relevant. In this course, each datum belongs to a given class with some membership grade, between 0 and 1. The most prominent fuzzy clustering algorithm is the fuzzy c-means introduced by Bezdek (Pattern recognition with fuzzy objective function algorithms, 1981), a fuzzification of the k-means or ISODATA algorithm. On the other hand, several research issues have been raised regarding both the objective function to be minimized and the optimization constraints, which help to identify proper cluster shape (Jain et al., ACM Computing Survey 31(3):264–323, 1999). This paper addresses the issue of clustering by evaluating the distance of fuzzy sets in a feature space. Especially, the fuzzy clustering optimization problem is reformulated when the distance is rather given in terms of divergence distance, which builds a bridge to the notion of probabilistic distance. This leads to a modified fuzzy clustering, which implicitly involves the variance–covariance of input terms. The solution of the underlying optimization problem in terms of optimal solution is determined while the existence and uniqueness of the solution are demonstrated. The performances of the algorithm are assessed through two numerical applications. The former involves clustering of Gaussian membership functions and the latter tackles the well-known Iris dataset. Comparisons with standard fuzzy c-means (FCM) are evaluated and discussed.     

最佳费用流

建立赋模糊数为费用权的容量－－费用网络中，据模糊决策来求解最佳费用流的网络模型，并给出这一模型的相应算法。     

A newsvendor model with fuzzy price-dependent demand

Price-dependence is an important characteristic for some inventory problems. This paper proposes a newsvendor model with fuzzy price-dependent demand, and discusses the conditions to determine the optimal pricing and inventory decisions jointly so that the expected profit could be maximized. Then an algorithm combining the method of ranking fuzzy numbers is developed to tackle the problem. Furthermore, comparison is made between the fuzzy model and the deterministic model to study the effect of the uncertain price-dependent demand, and the sensitivity properties of the joint optimal decisions are illustrated through numerical examples.     

Using the Hamming distance to extend TOPSIS in a fuzzy environment

Considering the fact that, in some cases, determining precisely the exact value of attributes is difficult and that their values can be considered as fuzzy data, this paper extends the TOPSIS method for dealing with fuzzy data, and an algorithm for determining the best choice among all possible choices when the data are fuzzy is also presented. In this approach, to identify the fuzzy ideal solution and fuzzy negative ideal solution, one of the Yager indices which is used for ordering fuzzy quantities in [0, 1] is applied. Using Yager’s index leads to a procedure for choosing fuzzy ideal and negative ideal solutions directly from the data for observed alternatives. Then, the Hamming distance is proposed for calculating the distance between two triangular fuzzy numbers. Finally, an application is given, to clarify the main results developed in the paper.     

求最优模糊等价矩阵的一个算法

本文说明了模糊等价矩阵的结构，然后提出求模糊相似矩阵的最优模糊等价矩阵的一个算法，最后指出最优模糊等价矩阵一定存在，但不唯一。     

模糊线性规划问题的一种新的单纯形算法

提出求解模糊线性规划问题的一种新的思路 ,就是应用单纯形法先求解与 (FLP)相应的普通线性规划问题 ,通过模糊约束集与模糊目标集的隶属度的比较 ,获得两个集合交集的最优隶属度 ,将此最优隶属度代入最优单纯形表中 ,即可求得 (FLP)的解。本算法只需在一张适当的迭代表台上执行单纯形迭代过程 ,简捷方便适用     

Learning Fuzzy Grey Cognitive Maps using Nonlinear Hebbian-based approach

Recently, Fuzzy Grey Cognitive Maps (FGCM) has been proposed as a FCM extension. It is based on Grey System Theory, that it has become a very effective theory for solving problems within environments with high uncertainty, under discrete small and incomplete data sets. The proposed approach of learning FGCMs applies the Nonlinear Hebbian based algorithm determine the success of radiation therapy process estimating the final dose delivered to the target volume. The scope of this research is to explore an alternative decision support method using the main aspects of fuzzy logic and grey systems to cope with the uncertainty inherent in medical domain and physicians uncertainty to describe numerically the influences among concepts in medical domain. The Supervisor-FGCM, trained by NHL algorithm adapted in FGCMs, determines the treatment variables of cancer therapy and the acceptance level of final radiation dose to the target volume. Three clinical case studies were used to test the proposed methodology with meaningful and promising results and prove the efficiency of the NHL algorithm for FGCM approach.     

Hierarchical generation of α-Pareto optimal solutions in large-scale multi-objective non-linear systems with fuzzy parameters

This paper proposes a decomposition method for hierarchical generation of α-Pareto optimal solutions in large-scale multi-objective non-linear programming (MONLP) problems with fuzzy parameters in the objective functions and in the constraints (FMONLP). These fuzzy parameters are characterized by fuzzy numbers. For such problems, the concept of α-Pareto optimality introduced by extending the ordinary Pareto optimality based on the α-level sets of fuzzy numbers. The decomposition method is based on the principle of decompose the original problem into interdependent sub-problems. In this method, the global multi-objective non-linear problem is decomposed into smaller multi-objective sub-problems. The smaller sub-problems, which obtained solved separately by using the weighting method and through an operative procedure. All these solution are coordinates in such a way that an optimal solution for the global problem achieved. In addition, an interactive fuzzy decision-making algorithm for hierarchical generation of α-Pareto optimal solution through the decomposition method is developed. Finally, two numerical examples given to illustrate the results developed in this paper.