Research on Short-Term Load Forecasting of Distribution Stations Based on the Clustering Improvement Fuzzy Time Series Algorithm

An improved fuzzy time series algorithmbased on clustering is designed in this paper.The algorithm is successfully applied to short-term load forecasting in the distribution stations.Firstly,the K-means clustering method is used to cluster the data,and the midpoint of two adjacent clustering centers is taken as the dividing point of domain division.On this basis,the data is fuzzed to form a fuzzy time series.Secondly,a high-order fuzzy relation with multiple antecedents is established according to the main measurement indexes of power load,which is used to predict the short-term trend change of load in the distribution stations.Matlab/Simulink simulation results show that the load forecasting errors of the typical fuzzy time series on the time scale of one day and one week are[−50,20]and[−50,30],while the load forecasting errors of the improved fuzzy time series on the time scale of one day and one week are[−20,15]and[−20,25].It shows that the fuzzy time series algorithm improved by clustering improves the prediction accuracy and can effectively predict the short-term load trend of distribution stations.

Hierarchical hesitant fuzzy K-means clustering algorithm

Due to the limitation and hesitation in one＇s knowledge, the membership degree of an element to a given set usually has a few different values, in which the conventional fuzzy sets are invalid. Hesitant fuzzy sets are a powerful tool to treat this case. The present paper focuses on investigating the clustering technique for hesitant fuzzy sets based on the K-means clustering algorithm which takes the results of hierarchical clustering as the initial clusters. Finally, two examples demonstrate the validity of our algorithm.

Diabetic Retinopathy Diagnosis Using ResNet with Fuzzy Rough C-Means Clustering

Diabetic Retinopathy(DR)is a vision disease due to the long-term prevalenceof Diabetes Mellitus.It affects the retina of the eye and causes severedamage to the vision.If not treated on time it may lead to permanent vision lossin diabetic patients.Today’s development in science has no medication to cureDiabetic Retinopathy.However,if diagnosed at an early stage it can be controlledand permanent vision loss can be avoided.Compared to the diabetic population,experts to diagnose Diabetic Retinopathy are very less in particular to local areas.Hence an automatic computer-aided diagnosis for DR detection is necessary.Inthis paper,we propose an unsupervised clustering technique to automatically clusterthe DR into one of its five development stages.The deep learning based unsupervisedclustering is made to improve itself with the help of fuzzy rough c-meansclustering where cluster centers are updated by fuzzy rough c-means clusteringalgorithm during the forward pass and the deep learning model representationsare updated by Stochastic Gradient Descent during the backward pass of training.The proposed method was implemented using python and the results were takenon DGX server with Tesla V100 GPU cards.An experimental result on the publicallyavailable Kaggle dataset shows an overall accuracy of 88.7%.The proposedmodel improves the accuracy of DR diagnosis compared to the existingunsupervised algorithms like k-means,FCM,auto-encoder,and FRCM withalexnet.

Study on the Development and Implementation of Different Big Data Clustering Methods

Clustering is an unsupervised learning method used to organize raw data in such a way that those with the same (similar) characteristics are found in the same class and those that are dissimilar are found in different classes. In this day and age, the very rapid increase in the amount of data being produced brings new challenges in the analysis and storage of this data. Recently, there is a growing interest in key areas such as real-time data mining, which reveal an urgent need to process very large data under strict performance constraints. The objective of this paper is to survey four algorithms including K-Means algorithm, FCM algorithm, EM algorithm and BIRCH, used for data clustering and then show their strengths and weaknesses. Another task is to compare the results obtained by applying each of these algorithms to the same data and to give a conclusion based on these results.

New judging model of fuzzy cluster optimal dividing based on rough sets theory

To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory： information system discrete algorithm （algorithm 1） and samples representatives judging algorithm （algorithm 2）. On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.

Clustering of Web Learners Based on Rough Set

The demand for individualized teaching from E-learning websites is rapidly increasing due to the huge differences existed among Web learners. A method for clustering Web learners based on rough set is proposed. The basic idea of the method is to reduce the learning attributes prior to clustering, and therefore the clustering of Web learners is carried out in a relative low-dimensional space. Using this method, the E-learning websites can arrange corresponding teaching content for different clusters of learners so that the learners’ individual requirements can be more satisfied. Key words rough set - attributes reduction - k-means clustering - individualized teaching CLC number TP 391.6 Foundation item: Supported by the National “863” Program of China (2002AA111010, 2003AA001032)Biography: LIU Shuai-dong (1979-), male, Master candidate, research direction: knowledge discovery and individualized learning techniques.

Hybrid Clustering Using Firefly Optimization and Fuzzy C-Means Algorithm

Classifying the data into a meaningful group is one of the fundamental ways of understanding and learning the valuable information. High-quality clustering methods are necessary for the valuable and efficient analysis of the increasing data. The Firefly Algorithm (FA) is one of the bio-inspired algorithms and it is recently used to solve the clustering problems. In this paper, Hybrid F-Firefly algorithm is developed by combining the Fuzzy C-Means (FCM) with FA to improve the clustering accuracy with global optimum solution. The Hybrid F-Firefly algorithm is developed by incorporating FCM operator at the end of each iteration in FA algorithm. This proposed algorithm is designed to utilize the goodness of existing algorithm and to enhance the original FA algorithm by solving the shortcomings in the FCM algorithm like the trapping in local optima and sensitive to initial seed points. In this research work, the Hybrid F-Firefly algorithm is implemented and experimentally tested for various performance measures under six different benchmark datasets. From the experimental results, it is observed that the Hybrid F-Firefly algorithm significantly improves the intra-cluster distance when compared with the existing algorithms like K-means, FCM and FA algorithm.

Long-term Traffic Volume Prediction Based on K-means Gaussian Interval Type-2 Fuzzy Sets

This paper uses Gaussian interval type-2 fuzzy se theory on historical traffic volume data processing to obtain a 24-hour prediction of traffic volume with high precision. A K-means clustering method is used in this paper to get 5 minutes traffic volume variation as input data for the Gaussian interval type-2 fuzzy sets which can reflect the distribution of historical traffic volume in one statistical period. Moreover, the cluster with the largest collection of data obtained by K-means clustering method is calculated to get the key parameters of type-2 fuzzy sets, mean and standard deviation of the Gaussian membership function.Using the range of data as the input of Gaussian interval type-2 fuzzy sets leads to the range of traffic volume forecasting output with the ability of describing the possible range of the traffic volume as well as the traffic volume prediction data with high accuracy. The simulation results show that the average relative error is reduced to 8% based on the combined K-means Gaussian interval type-2 fuzzy sets forecasting method. The fluctuation range in terms of an upper and a lower forecasting traffic volume completely envelopes the actual traffic volume and reproduces the fluctuation range of traffic flow.

Rough similarity degree and rough close degree in rough fuzzy sets and the applications

Based on rough similarity degree of rough sets and close degree of fuzzy sets, the definitions of rough similarity degree and rough close degree of rough fuzzy sets are given, which can be used to measure the similar degree between two rough fuzzy sets. The properties and theorems are listed. Using the two new measures, the method of clustering in the rough fuzzy system can be obtained. After clustering, the new fuzzy sample can be recognized by the principle of maximal similarity degree.

基于Rough sets和Fuzzy sets理论的约简算法

对决策表约简的一些roughsets和fuzzysets相关概念进行了阐述。在应用Rough集对决策系统进行约简的基础上,结合模糊聚类分析方法,论述了这一可行的决策表约简算法。该算法以属性核与属性重要性的代数定义形式为基础,利用聚类分析的模糊处理方法,解决了约简过程。并给出了对一电器公司全国连锁销售数据约简处理结果,得出了能帮助不同级别决策者进行决策的辅助性的规则知识。

Comparison of Clustering Methods in Yeast Saccharomyces Cerevisiae

In recent years, microarray technology has been widely applied in biological and clinical studies for simultaneous monitoring of gene expression in thousands of genes. Gene clustering analysis is found useful for discovering groups of correlated genes potentially co-regulated or associated to the disease or conditions under investigation. Many clustering methods including k-means, fuzzy c-means, and hierarchical clustering have been widely used in literatures. Yet no comprehensive comparative study has been performed to evaluate the effectiveness of these methods, specially, in yeast saccharomyces cerevisiae. In this paper, these three gene clustering methods are compared. Classification accuracy and CPU time cost are employed for measuring performance of these algorithms. Our results show that hierarchical clustering outperforms k-means and fuzzy c-means clustering. The analysis provides deep insight to the complicated gene clustering problem of expression profile and serves as a practical guideline for routine microarray cluster analysis of gene expression.

Different Feature Selection of Soil Attributes Influenced Clustering Performance on Soil Datasets

Feature selection is very important to obtain meaningful and interpretive clustering results from a clustering analysis. In the application of soil data clustering, there is a lack of good understanding of the response of clustering performance to different features subsets. In the present paper, we analyzed the performance differences between k-means, fuzzy c-means, and spectral clustering algorithms in the conditions of different feature subsets of soil data sets. The experimental results demonstrated that the performances of spectral clustering algorithm were generally better than those of k-means and fuzzy c-means with different features subsets. The feature subsets containing environmental attributes helped to improve clustering performances better than those having spatial attributes and produced more accurate and meaningful clustering results. Our results demonstrated that combination of spectral clustering algorithm with the feature subsets containing environmental attributes rather than spatial attributes may be a better choice in applications of soil data clustering.

一种模糊Rough决策方法

利用模糊集理论和粗糙集理论在处理不确定性和不精确性问题方面侧重点的差异性 ,构造一种组合决策模型。该模型从问题领域内的部分不精确信息出发利用模糊聚类方法构造一个决策信息系统 ,利用粗糙集理论关于决策规则的约简方法从决策信息系统中提取 (挖掘 )决策规则 ,使之适用于问题的整个领域。

基于混合度量与类簇自适应调整的粗糙模糊K-means聚类算法

针对粗糙K-means聚类及其相关衍生算法需要提前人为给定聚类数目、随机选取初始类簇中心导致类簇交叉区域的数据划分准确率偏低等问题,文中提出基于混合度量与类簇自适应调整的粗糙模糊K-means聚类算法.在计算边界区域的数据对象归属于不同类簇的隶属程度时,综合考虑局部密度和距离的混合度量,并采用自适应调整类簇数目的策略,获得最佳聚类数目.选取数据对象稠密区域中距离最小的两个样本的中点作为初始类簇中心,将附近局部密度高于平均密度的对象划分至该簇后再选取剩余的初始类簇中心,使初始类簇中心的选取更合理.在人工数据集和UCI标准数据集上的实验表明,文中算法在处理类簇交叠严重的球簇状数据集时,具有自适应性,聚类精度较优.

基于区间2-型模糊度量的粗糙K-means聚类算法

现有粗糙K-means聚类算法及系列改进、衍生算法均是从不同角度描述交叉类簇边界区域中的不确定性数据对象,却忽视类簇间规模的不均衡对聚类迭代过程及结果的影响.文中引入区间2-型模糊集的概念度量类簇的边界区域数据对象,提出基于区间2-型模糊度量的粗糙K-means聚类算法.首先根据类簇的数据分布生成边界区域样本对交叉类簇的隶属度区间,体现数据样本的空间分布信息.然后进一步考虑类簇的数据样本规模,在隶属度区间的基础上自适应地调整边界区域的样本对交叉类簇的影响系数.文中算法削弱边界区域对较小规模类簇的中心均值迭代的不利影响,提高聚类精度.在人工数据集及UCI标准数据集的测试分析验证算法的有效性.

基于模糊粗糙集的大型汽轮机组设备故障识别方法

针对大型汽轮机组设备故障种类多,提出基于模糊粗糙集的大型汽轮机组设备故障识别方法。首先,模糊化处理大型汽轮机组设备故障信息,将复杂的故障信息转化为简单的模糊编码后,使用故障类型-征兆特征决策表生成方法构建特征决策表,表中各行代表故障类型,各列代表故障征兆特征;将决策表数据输入基于改进可拓神经网络聚类的故障分类模型中,决策表的历史数据作为训练数据,当下机组设备运行状态数据作为测试数据,通过判断当下设备运行状态是否与某故障类型-征兆特征决策表的数据匹配,完成设备故障识别。实验中,此方法可有效识别16种汽轮机组设备故障。

A NOVEL TEMPORAL ERROR CONCEALMENT METHOD BASED ON FUZZY REASONING FOR H.264

In this paper,a fuzzy reasoning based temporal error concealment method is proposed. The basic temporal error concealment is implemented by estimating Motion Vector (MV) of the lost MacroBlock (MB) from its neighboring MVs. Which MV is the most proper one is evaluated by some criteria. Generally,two criteria are widely used,namely Side Match Distortion (SMD) and Sum of Absolute Difference (SAD) of corresponding MV. However,each criterion could only partly describe the status of lost block. To accomplish the judgement more accurately,the two measures are considered together. Thus a refined measure based on fuzzy reasoning is adopted to balance the effects of SMD and SAD. Terms SMD and SAD are regarded as fuzzy input and the term ‘similarity’ as output to complete fuzzy reasoning. Result of fuzzy reasoning represents how the tested MV is similar to the original one. And k-means clustering technique is performed to define the membership function of input fuzzy sets adaptively. According to the experimental results,the concealment based on new measure achieves better performance.

基于支持向量聚类和模糊粗糙集的交通流数据修复方法

为解决受天气影响、探测器故障和人为错误等多种原因造成的交通流数据丢失问题,提出一种基于模糊粗糙集理论的交通流数据补缺方法,将支持向量聚类与模糊粗糙集结合进行交通流数据的分类,并结合模糊神经网络和遗传算法进行数据补齐。该方法对支持向量聚类参数,聚类大小和加权因子进行优化,并估计缺失值。研究结果表明所提出的混合方法具有足够且合理的数据修复性能,与模糊神经网络等估算模型的结果对比表明,该模型的数据修复效果优于其他对比模型。

Illumination-Free Clustering Using Improved Slime Mould Algorithm for Acute Lymphoblastic Leukemia Image Segmentation

Partitional clustering techniques such as K-Means(KM),Fuzzy C-Means(FCM),and Rough K-Means(RKM)are very simple and effective techniques for image segmentation.But,because their initial cluster centers are randomly determined,it is often seen that certain clusters converge to local optima.In addition to that,pathology image segmentation is also problematic due to uneven lighting,stain,and camera settings during the microscopic image capturing process.Therefore,this study proposes an Improved Slime Mould Algorithm(ISMA)based on opposition based learning and differential evolution’s mutation strategy to perform illumination-free White Blood Cell(WBC)segmentation.The ISMA helps to overcome the local optima trapping problem of the partitional clustering techniques to some extent.This paper also performs a depth analysis by considering only color components of many well-known color spaces for clustering to find the effect of illumination over color pathology image clustering.Numerical and visual results encourage the utilization of illumination-free or color component-based clustering approaches for image segmentation.ISMA-KM and“ab”color channels of CIELab color space provide best results with above-99%accuracy for only nucleus segmentation.Whereas,for entire WBC segmentation,ISMA-KM and the“CbCr”color component of YCbCr color space provide the best results with an accuracy of above 99%.Furthermore,ISMA-KM and ISMA-RKM have the lowest and highest execution times,respectively.On the other hand,ISMA provides competitive outcomes over CEC2019 benchmark test functions compared to recent well-established and efficient Nature-Inspired Optimization Algorithms(NIOAs).

Automatic Optic Disc Detection in Retinal Images Using FKMT‒MOPDF

In recent days,detecting Optic Disc(OD)in retinal images has been challenging and very important to the early diagnosis of eye diseases.The process of detecting the OD is challenging due to the diversity of color,intensity,brightness and shape of the OD.Moreover,the color similarities of the neighboring organs of the OD create difficulties during OD detection.In the proposed Fuzzy K‒Means Threshold(FKMT)and Morphological Operation with Pixel Density Feature(MOPDF),the input retinal images are coarsely segmented by fuzzy K‒means clustering and thresholding,in which the OD is classified from its neighboring organs with intensity similarities.Then,the segmented images are given as the input to morphological operation with pixel density feature calculations,which reduce the false detection in the small pixel of the OD.Finally,the OD area is detected by applying the Sobel edge detection method,which accurately detects the OD from the retinal images.After detection optimization,the proposed method achieved Sensitivity(SEN),Specificity(SPEC)and Accuracy(ACC),with 96.74%,96.78%and 96.92%in DiaretDB0(Standard Diabetic Retinopathy Database Calibration level 0),97.12%,97.10%and 97.75%in DiaretDB1(Standard Diabetic Retinopathy Database Calibration level 1)and 97.19%,97.47%and 97.43%in STARE(Structured Analysis of the Retina)dataset respectively.The experimental results demonstrated the proposed method’s efficiency for segmenting and detecting OD areas.