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.

Fuzzy C-Means Algorithm Based on Density Canopy and Manifold Learning

Fuzzy C-Means(FCM)is an effective and widely used clustering algorithm,but there are still some problems.considering the number of clusters must be determined manually,the local optimal solutions is easily influenced by the random selection of initial cluster centers,and the performance of Euclid distance in complex high-dimensional data is poor.To solve the above problems,the improved FCM clustering algorithm based on density Canopy and Manifold learning(DM-FCM)is proposed.First,a density Canopy algorithm based on improved local density is proposed to automatically deter-mine the number of clusters and initial cluster centers,which improves the self-adaptability and stability of the algorithm.Then,considering that high-dimensional data often present a nonlinear structure,the manifold learning method is applied to construct a manifold spatial structure,which preserves the global geometric properties of complex high-dimensional data and improves the clustering effect of the algorithm on complex high-dimensional datasets.Fowlkes-Mallows Index(FMI),the weighted average of homogeneity and completeness(V-measure),Adjusted Mutual Information(AMI),and Adjusted Rand Index(ARI)are used as performance measures of clustering algorithms.The experimental results show that the manifold learning method is the superior distance measure,and the algorithm improves the clustering accuracy and performs superiorly in the clustering of low-dimensional and complex high-dimensional data.

Unknown DDoS Attack Detection with Fuzzy C-Means Clustering and Spatial Location Constraint Prototype Loss

Since its inception,the Internet has been rapidly evolving.With the advancement of science and technology and the explosive growth of the population,the demand for the Internet has been on the rise.Many applications in education,healthcare,entertainment,science,and more are being increasingly deployed based on the internet.Concurrently,malicious threats on the internet are on the rise as well.Distributed Denial of Service(DDoS)attacks are among the most common and dangerous threats on the internet today.The scale and complexity of DDoS attacks are constantly growing.Intrusion Detection Systems(IDS)have been deployed and have demonstrated their effectiveness in defense against those threats.In addition,the research of Machine Learning(ML)and Deep Learning(DL)in IDS has gained effective results and significant attention.However,one of the challenges when applying ML and DL techniques in intrusion detection is the identification of unknown attacks.These attacks,which are not encountered during the system’s training,can lead to misclassification with significant errors.In this research,we focused on addressing the issue of Unknown Attack Detection,combining two methods:Spatial Location Constraint Prototype Loss(SLCPL)and Fuzzy C-Means(FCM).With the proposed method,we achieved promising results compared to traditional methods.The proposed method demonstrates a very high accuracy of up to 99.8%with a low false positive rate for known attacks on the Intrusion Detection Evaluation Dataset(CICIDS2017)dataset.Particularly,the accuracy is also very high,reaching 99.7%,and the precision goes up to 99.9%for unknown DDoS attacks on the DDoS Evaluation Dataset(CICDDoS2019)dataset.The success of the proposed method is due to the combination of SLCPL,an advanced Open-Set Recognition(OSR)technique,and FCM,a traditional yet highly applicable clustering technique.This has yielded a novel method in the field of unknown attack detection.This further expands the trend of applying DL and ML techniques in the development of intrusion detection systems and cybersecurity.Finally,implementing the proposed method in real-world systems can enhance the security capabilities against increasingly complex threats on computer networks.

基于优化模糊C-means算法的不平衡大数据分类研究

针对不平衡大数据的分类问题,提出一种优化模糊C-means算法的不平衡大数据分类算法。先计算C-means模糊交叉算子,定义优化函数,并求解大数据不平衡增益。利用Spark分类平台,确定大数据样本压缩模糊近邻值的取值范围,再通过放大近邻值的处理方式,定义不平衡阈向量,从而完善整个分类流程,完成基于优化模糊C-means算法的不平衡大数据分类方法的设计。实验结果表明,上述分类方法的应用,可将正例信息、负例信息的取样长度区间完全分离开来,能有效解决因不平衡大数据分类不精准造成的信息样本混淆的问题,符合实际应用需求。

基于BP神经网络和C-Means聚类算法的水下导航适配区分类预测

在国家明确强调“海洋强国”战略部署的时代背景下,适配区分类预测技术是解决水下导航与定位问题的核心技术。因此,研发基于重力异常数据的水下导航适配区分类预测模型,对于提高导航可靠性与精准度具有关键性的技术意义。本文针对不同区域的重力异常特征分布不同,首先提出一种基于C-Means聚类算法的区域适配性标定方法,通过将海域划分为五类,对各区域进行适配性标定。然后,在此基础上,本文提出一种基于BP神经网络的适配区分类预测方法,对区域适配度进行预测。实验结果表明,本文提出的预测模型在训练集中的预测精度达到99%,而在测试集中模型的预测精度达到97%。由此可见本文提出的预测模型具有较好的迁移性能,能够帮助水下航行器进行精准定位。

Computational Intelligence-Based System in the Support of the Diagnosis of Brain Tumors： An Approach through Fuzzy C-Means Method

Brain tumor is a major cause of an increased transient between children and adults. This article proposes an improved method based on magnetic resonance （MRI） brain imaging and image segmentation. Automated classification is encouraged by the need for high accuracy in dealing with a human life. Detection of brain tumor is a challenging problem due to the high diversity in tumor appearance and ambiguous tumor boundaries. MRI images are chosen for the detection of brain tumors as they are used in the determination of soft tissues. First, image preprocessing is used to improve image quality. Second, the multi-scale decomposition of complex dual-wavelet tree transformations is used to analyze the texture of an image. Resource extraction draws resources from an image using gray-level co-occurrence matrix （GLCM）. Therefore, the neuro-fuzzy technique is used to classify brain tumor stages as benign, malignant, or normal based on texture characteristics. Finally, tumor location is detected using Otsu threshold. The performance of the classifier is evaluated on the basis of classification accuracies. The simulated results show that the proposed classifier provides better accuracy than the previous method.

NEW SHADOWED C-MEANS CLUSTERING WITH FEATURE WEIGHTS

Partition-based clustering with weighted feature is developed in the framework of shadowed sets. The objects in the core and boundary regions, generated by shadowed sets-based clustering, have different impact on the prototype of each cluster. By integrating feature weights, a formula for weight calculation is introduced to the clustering algorithm. The selection of weight exponent is crucial for good result and the weights are updated iteratively with each partition of clusters. The convergence of the weighted algorithms is given, and the feasible cluster validity indices of data mining application are utilized. Experimental results on both synthetic and real-life numerical data with different feature weights demonstrate that the weighted algorithm is better than the other unweighted algorithms.

Fuzzy c-means text clustering based on topic concept sub-space

To improve the accuracy of text clustering, fuzzy c-means clustering based on topic concept sub-space （TCS2FCM） is introduced for classifying texts. Five evaluation functions are combined to extract key phrases. Concept phrases, as well as the descriptions of final clusters, are presented using WordNet origin from key phrases. Initial centers and membership matrix are the most important factors affecting clustering performance. Orthogonal concept topic sub-spaces are built with the topic concept phrases representing topics of the texts and the initialization of centers and the membership matrix depend on the concept vectors in sub-spaces. The results show that, different from random initialization of traditional fuzzy c-means clustering, the initialization related to text content contributions can improve clustering precision.

ALLIED FUZZY c-MEANS CLUSTERING MODEL

A novel model of fuzzy clustering, i.e. an allied fuzzy c means （AFCM） model is proposed based on the combination of advantages of fuzzy c means （FCM） and possibilistic c means （PCM） clustering. PCM is sensitive to initializations and often generates coincident clusters. AFCM overcomes this shortcoming and it is an ex tension of PCM. Membership and typicality values can be simultaneously produced in AFCM. Experimental re- suits show that noise data can be well processed, coincident clusters are avoided and clustering accuracy is better.

基于模糊C-means的多视角聚类算法

目前多数多视角聚类算法属于"刚性"划分算法,不适用于处理具有聚簇重叠结构的数据集,为此,提出一种基于模糊C-means的多视角聚类算法(简称FCM-MVC),该算法利用隶属度描述对象与类别的关系,能够更真实地描述具有聚簇重叠结构数据集的聚类结果。FCM-MVC算法同时利用多个视角信息,自动计算每个视角的权重。研究结果表明:FCM-MVC算法能够有效处理具有聚簇重叠结构的数据集;与已有的3种经典的多视角聚类算法相比,该算法获得的聚类精度更高。

HSI空间和改进C-means的彩色人民币号码分割方法

针对采集到的人民币号码图像都是彩色图像并携带有噪声这一现象,本文提出基于HSI空间和改进的C-means算法的人民币彩色号码图像分割方法。选用HSI颜色空间作为彩色分割空间,在HSI空间内,将HSI的3-D搜索问题转化为3个1-D的搜索问题,求取图像在3个1-D方向上的灰度直方图,该方法根据图像当前点3×3邻域内每个像素灰度值与当前点灰度值差值的大小情况,确定聚类算法中当前点的灰度值p(m)的值,采用C-means聚类算法分别确定文字和非文字的聚类中心,利用欧式距离进行人民币号码前景和背景的聚类判断。该方法直接对彩色人民币号码图像进行分割,考虑了当前点与邻域像素点之间的相互关系,具有一定的自适应性。实验结果表明,提出的号码图像分割方法不受图像噪声和局部边缘变化的影响,且变换后数据量减少,易于计算,该方法对字母和数字的分割都有效,鲁棒性较强。

基于模糊c-means算法的空间数据分类和预测

空间分类和预测是空间数据挖掘中一个非常重要的方法,但对它们的研究目前尚处于初始阶段.通过引入空间对象对模糊聚类的模糊隶属度的概念,提出了基于模糊c-means算法的空间数据分类和预测的方法(SFCM).该方法首先用模糊c-means方法对数据集论域空间进行聚类,但由于空间数据具有空间自相关的特性,在用模糊c-means算法进行空间聚类时加入了空间信息.然后计算每个空间对象对所有聚类的模糊隶属度并从中找出模糊隶属度最大的聚类.最后用该聚类中心对象的因变量的值作为该空间对象的因变量的估计值.理论分析和实验结果表明,该算法是有效可行的.

基于模糊C-means聚类的地球化学数据分析

采用数据挖掘技术中模糊C-means聚类算法,以地球化学元素为数据对象、样品分析结果为属性值,对某已知金矿区和锡矿区岩石样品的元素组合特征进行了分析。聚类分析得出的元素组合关系与已知地质资料相一致,表明模糊C-means聚类算法能够客观、有效地发现地球化学元素的组合特征。同时,对位于内蒙古地区某多金属成矿带的地球化学采样数据进行了分析,根据聚类结果推断该地区是寻找金、银多金属矿产资源的目标区域。

C-means-based ant colony algorithm for TSP

To solve the traveling salesman problem with the characteristics of clustering,a novel hybrid algorithm,the ant colony algorithm combined with the C-means algorithm,is presented.In order to improve the speed of convergence,the traveling salesman problem(TSP)data is specially clustered by the C-means algorithm,then,the result is processed by the ant colony algorithm to solve the problem.The proposed algorithm treats the C-means algorithm as a new search operator and adopts a kind of local searching strategy—2-opt,so as to improve the searching performance.Given the cluster number,the algorithm can obtain the preferable solving result.Compared with the three other algorithms—the ant colony algorithm,the genetic algorithm and the simulated annealing algorithm,the proposed algorithm can make the results converge to the global optimum faster and it has higher accuracy.The algorithm can also be extended to solve other correlative clustering combination optimization problems.Experimental results indicate the validity of the proposed algorithm.

基于粗糙集理论的模糊C-means高维数据聚类算法

模糊C-means算法是一种重要的聚类分析算法,但是在数据维数较高的情况下,该算法计算量急剧上升从而导致其效率较低.针对这一问题,提出了一种基于粗糙集理论的模糊C-means高维数据聚类算法,该算法在传统模糊C-means算法的基础上引入了粗糙集属性约简的理念,通过对数据集属性的约简,提取出对分类影响较大的属性集而摒弃与分类无关的属性,进而在聚类过程中只计算属性约简结果集中的属性,从而减少聚类过程的工作量、提高聚类效率.理论分析和实验结果表明,该算法在处理高维数据时较高效.

一种基于蚁群算法和C-Means算法的图像分割方法

针对传统C-Means算法在图像分割应用中的缺陷,本文提出一种蚁群算法(Ant Colony Optimization ACO)融合C-Means算法的图像聚类分割方法,它融合了C-Means算法和蚁群算法的优点,比传统的C-Means算法能得到更好的分割质量。实际图像分割试验结果表明该方法是一种良好的图像分割新方法。

基于Hadoop二阶段并行模糊c-Means聚类算法

针对Mapreduce机制下算法通信时间占用比过高,实际应用价值受限的情况,提出基于Hadoop二阶段并行c-Means聚类算法用来解决超大数据的分类问题。首先,改进Mapreduce机制下的MPI通信管理方法,采用成员管理协议方式实现成员管理与Mapreduce降低操作的同步化;其次,实行典型个体组降低操作代替全局个体降低操作,并定义二阶段缓冲算法;最后,通过第一阶段的缓冲进一步降低第二阶段Mapreduce操作的数据量,尽可能降低大数据带来的对算法负面影响。在此基础上,利用人造大数据测试集和KDD CUP 99入侵测试集进行仿真,实验结果表明,该算法既能保证聚类精度要求又可有效加快算法运行效率。

基于蚁群算法和C-means算法的图像分割方法

在计算机飞速发展的背景下,计算机的图像处理技术渗入到各个行业中。图像分割作为一种基本的图像处理技术,它的目的是把图像分成各具特征的区域,从中提取感兴趣的技术。针对以前的C-means算法在图像分割应用中的缺陷,本文提出了新的基于蚁群算法和C-means算法相结合的新型图像分割方法,它和蚁群算法以及C-means算法相比,具有明显的优点,能够获得更好的分割质量。

半监督平衡化模糊C-means聚类

传统模糊C-means聚类(FCM,fuzzy C-means)在处理非平衡数据集时,由于相异类中所含样本数量差异较大,导致类间权值不平衡和"均匀效应",从而易产生聚类错误.另外,FCM属于无监督方法,无法更好地利用已知的部分类标记信息引导聚类.为解决这两方面问题,提出一种半监督的平衡化模糊C-means聚类(SBFCM,semi-supervised balanced fuzzy C-means)方法.SBFCM在FCM目标函数的基础上加入了对聚类模糊隶属度矩阵的近似正交约束和半监督约束,从而得到了新的聚类目标函数.实验结果表明,相比于FCM,SBFCM能有效缓解由"均匀效应"导致的聚类错误现象,并能有效地利用部分先验类标记信息,从而可获得更好的聚类效果.