A Fast Underwater Optical Image Segmentation Algorithm Based on a Histogram Weighted Fuzzy C-means Improved by PSO

The S/N of an underwater image is low and has a fuzzy edge.If using traditional methods to process it directly,the result is not satisfying.Though the traditional fuzzy C-means algorithm can sometimes divide the image into object and background,its time-consuming computation is often an obstacle.The mission of the vision system of an autonomous underwater vehicle (AUV) is to rapidly and exactly deal with the information about the object in a complex environment for the AUV to use the obtained result to execute the next task.So,by using the statistical characteristics of the gray image histogram,a fast and effective fuzzy C-means underwater image segmentation algorithm was presented.With the weighted histogram modifying the fuzzy membership,the above algorithm can not only cut down on a large amount of data processing and storage during the computation process compared with the traditional algorithm,so as to speed up the efficiency of the segmentation,but also improve the quality of underwater image segmentation.Finally,particle swarm optimization (PSO) described by the sine function was introduced to the algorithm mentioned above.It made up for the shortcomings that the FCM algorithm can not get the global optimal solution.Thus,on the one hand,it considers the global impact and achieves the local optimal solution,and on the other hand,further greatly increases the computing speed.Experimental results indicate that the novel algorithm can reach a better segmentation quality and the processing time of each image is reduced.They enhance efficiency and satisfy the requirements of a highly effective,real-time AUV.

A weighted fuzzy C-means clustering method for hardness prediction

The hardness prediction model was established by support vector regression(SVR).In order to avoid exaggerating the contribution of very tiny alloying elements,a weighted fuzzy C-means(WFCM)algorithm was proposed for data clustering using improved Mahalanobis distance based on random forest importance values,which could play a full role of important features and avoid clustering center overlap.The samples were divided into two classes.The top 10 features of each class were selected to form two feature subsets for better performance of the model.The dimension and dispersion of features decreased in such feature subsets.Comparing four machine learning algorithms,SVR had the best performance and was chosen to modeling.The hyper-parameters of the SVR model were optimized by particle swarm optimization.The samples in validation set were classified according to minimum distance of sample to clustering centers,and then the SVR model trained by feature subset of corresponding class was used for prediction.Compared with the feature subset of original data set,the predicted values of model trained by feature subsets of classified samples by WFCM had higher correlation coefficient and lower root mean square error.It indicated that WFCM was an effective method to reduce the dispersion of features and improve the accuracy of model.

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.

Einstein Weighted Geometric Operator for Pythagorean Fuzzy Hypersoft with Its Application in Material Selection

Hypersoft set theory is a most advanced form of soft set theory and an innovative mathematical tool for dealing with unclear complications.Pythagorean fuzzy hypersoft set(PFHSS)is the most influential and capable leeway of the hypersoft set(HSS)and Pythagorean fuzzy soft set(PFSS).It is also a general form of the intuitionistic fuzzy hypersoft set(IFHSS),which provides a better and more perfect assessment of the decision-making(DM)process.The fundamental objective of this work is to enrich the precision of decision-making.A novel mixed aggregation operator called Pythagorean fuzzy hypersoft Einstein weighted geometric(PFHSEWG)based on Einstein’s operational laws has been developed.Some necessary properties,such as idempotency,boundedness,and homogeneity,have been presented for the anticipated PFHSEWG operator.Multi-criteria decision-making(MCDM)plays an active role in dealing with the complications of manufacturing design for material selection.However,conventional methods of MCDM usually produce inconsistent results.Based on the proposed PFHSEWG operator,a robust MCDM procedure for material selection in manufacturing design is planned to address these inconveniences.The expected MCDM method for material selection(MS)of cryogenic storing vessels has been established in the real world.Significantly,the planned model for handling inaccurate data based on PFHSS is more operative and consistent.

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.

基于空间加权距离的自适应Fuzzy C-Means算法研究

空间聚类不仅应考虑GIS对象属性特征的相似性,还应考虑对象的空间邻近性。不同属性、位置特征在聚类中起到的作用不同。采用信息熵方法计算空间距离中各属性距离、位置距离的权重,权值大小用于度量相应特征在fuzzy c-means隶属度计算时的作用大小,并引入相似性指标,当两个聚类之间的相似度高于某个合并阈值时,则对应的一对聚类进行合并,从而克服需预先设置聚类类数的问题。通过应用实例的聚类有效性分析,与普通空间距离相比,基于空间加权距离的FCM算法具有稳定性和有效性。

基于VWM-GRA的新型Fuzzy-FMEA复杂装备风险评估方法

失效模式和影响分析(Failure Mode and Effect Analysis,FMEA)是一种识别和预防复杂装备潜在故障模式的风险评估方法,然而,现有FMEA方法采用等权重和精确数表征不确定情形下的风险因素评估信息,导致风险优先数(Risk Priority Number,RPN)难以准确评估复杂装备故障模式的风险优先级。针对这一难题,文中提出了一种基于变权方法-灰色关联分析(Variable Weight Method-Grey Relation Analysis,VWM-GRA)的新型Fuzzy-FMEA复杂装备风险评估方法。在风险因素权重分配方面,在模糊熵值法的基础上,考虑风险评估信息对风险因素权重的影响,构建风险因素变权综合模型以动态调整风险因素权重值,据此确定风险因素的客观变权重;在风险优先数排序方面,在模糊语言变量表征风险因素评估信息的基础上,考虑风险因素评估信息不确定性量化对故障模式排序精度的影响,构建故障模式模糊灰色关联分析模型,以获取评估信息数据序列间的相对关联度,据此评估故障模式的风险优先级。最后,通过航空发动机主轴轴承的故障模式风险实例,分析验证文中方法的有效性。案例分析表明:该方法能够有效解决不确定情形下准确评估复杂装备故障模式风险优先级的难题。

Residual-driven Fuzzy C-Means Clustering for Image Segmentation

In this paper,we elaborate on residual-driven Fuzzy C-Means(FCM)for image segmentation,which is the first approach that realizes accurate residual(noise/outliers)estimation and enables noise-free image to participate in clustering.We propose a residual-driven FCM framework by integrating into FCM a residual-related regularization term derived from the distribution characteristic of different types of noise.Built on this framework,a weighted?2-norm regularization term is presented by weighting mixed noise distribution,thus resulting in a universal residual-driven FCM algorithm in presence of mixed or unknown noise.Besides,with the constraint of spatial information,the residual estimation becomes more reliable than that only considering an observed image itself.Supporting experiments on synthetic,medical,and real-world images are conducted.The results demonstrate the superior effectiveness and efficiency of the proposed algorithm over its peers.

A New Method of Wind Turbine Bearing Fault Diagnosis Based on Multi-Masking Empirical Mode Decomposition and Fuzzy C-Means Clustering

Based on Multi-Masking Empirical Mode Decomposition (MMEMD) and fuzzy c-means (FCM) clustering, a new method of wind turbine bearing fault diagnosis FCM-MMEMD is proposed, which can determine the fault accurately and timely. First, FCM clustering is employed to classify the data into different clusters, which helps to estimate whether there is a fault and how many fault types there are. If fault signals exist, the fault vibration signals are then demodulated and decomposed into different frequency bands by MMEMD in order to be analyzed further. In order to overcome the mode mixing defect of empirical mode decomposition (EMD), a novel method called MMEMD is proposed. It is an improvement to masking empirical mode decomposition (MEMD). By adding multi-masking signals to the signals to be decomposed in different levels, it can restrain low-frequency components from mixing in highfrequency components effectively in the sifting process and then suppress the mode mixing. It has the advantages of easy implementation and strong ability of suppressing modal mixing. The fault type is determined by Hilbert envelope finally. The results of simulation signal decomposition showed the high performance of MMEMD. Experiments of bearing fault diagnosis in wind turbine bearing fault diagnosis proved the validity and high accuracy of the new method.

Soil pore identification with the adaptive fuzzy C-means method based on computed tomography images

The complex geometry and topology of soil is widely recognised as the key driver in many ecological processes. X-ray computed tomography (CT) provides insight into the internal structure of soil pores automatically and accurately. Until recently, there have not been methods to identify soil pore structures. This has restricted the development of soil science, particularly regarding pore geometry and spatial distribution. Through the adoption of the fuzzy clustering theory and the establishment of pore identification rules, a novel pore identification method is described to extract pore structures from CT soil images. The robustness of the adaptive fuzzy C-means method (AFCM), the adaptive threshold method, and Image-Pro Plus tools were compared on soil specimens under different conditions, such as frozen, saturated, and dry situations. The results demonstrate that the AFCM method is suitable for identifying pore clusters, especially tiny pores, under various soil conditions. The method would provide an optional technique for the study of soil micromorphology.

Fuzzy c-means clustering based on spatial neighborhood information for image segmentation

Fuzzy c-means （FCM） algorithm is one of the most popular methods for image segmentation. However, the standard FCM algorithm is sensitive to noise because of not taking into account the spatial information in the image. An improved FCM algorithm is proposed to improve the antinoise performance of FCM algorithm. The new algorithm is formulated by incorporating the spatial neighborhood information into the membership function for clustering. The distribution statistics of the neighborhood pixels and the prior probability are used to form a new membership func- tion. It is not only effective to remove the noise spots but also can reduce the misclassified pixels. Experimental results indicate that the proposed algorithm is more accurate and robust to noise than the standard FCM algorithm.

Generalized ordered weighted averaging operators based methods for MADM in intuitionistic fuzzy set setting

Multiattribute decision making（MADM） problems, in which the weights and ratings of alternatives are expressed with intuitionistic fuzzy（IF） sets, are investigated.Firstly, the relative degrees of membership and the relative degrees of non-membership are formulated as IF sets, the weights and values of alternatives on both qualitative and quantitative attributes may be expressed as IF sets in a unified way.Then a MADM method based on generalized ordered weighted averaging operators is proposed.The proposed method is illustrated with a numerical example.

Fault Diagnosis Model Based on Fuzzy Support Vector Machine Combined with Weighted Fuzzy Clustering

A fault diagnosis model is proposed based on fuzzy support vector machine (FSVM) combined with fuzzy clustering (FC).Considering the relationship between the sample point and non-self class,FC algorithm is applied to generate fuzzy memberships.In the algorithm,sample weights based on a distribution density function of data point and genetic algorithm (GA) are introduced to enhance the performance of FC.Then a multi-class FSVM with radial basis function kernel is established according to directed acyclic graph algorithm,the penalty factor and kernel parameter of which are optimized by GA.Finally,the model is executed for multi-class fault diagnosis of rolling element bearings.The results show that the presented model achieves high performances both in identifying fault types and fault degrees.The performance comparisons of the presented model with SVM and distance-based FSVM for noisy case demonstrate the capacity of dealing with noise and generalization.

Linear goal programming approach to obtaining the weights of intuitionistic fuzzy ordered weighted averaging operator

The multiple attribute decision making problems are studied, in which the information about attribute weights is partly known and the attribute values take the form of intuitionistic fuzzy numbers. The operational laws of intuitionistic fuzzy numbers are introduced, and the score function and accuracy function are presented to compare the intuitionistic fuzzy numbers. The intuitionistic fuzzy ordered weighted averaging （IFOWA） operator which is an extension of the well-known ordered weighted averaging （OWA） operator is investigated to aggregate the intuitionistic fuzzy information. In order to determine the weights of intuitionistic fuzzy ordered weighted averaging operator, a linear goal programming procedure is proposed for learning the weights from data. Finally, an example is illustrated to verify the effectiveness and practicability of the developed method.

FEW-NNN: A Fuzzy Entropy Weighted Natural Nearest Neighbor Method for Flow-Based Network Traffic Attack Detection

Attacks such as APT usually hide communication data in massive legitimate network traffic, and mining structurally complex and latent relationships among flow-based network traffic to detect attacks has become the focus of many initiatives. Effectively analyzing massive network security data with high dimensions for suspicious flow diagnosis is a huge challenge. In addition, the uneven distribution of network traffic does not fully reflect the differences of class sample features, resulting in the low accuracy of attack detection. To solve these problems, a novel approach called the fuzzy entropy weighted natural nearest neighbor(FEW-NNN) method is proposed to enhance the accuracy and efficiency of flowbased network traffic attack detection. First, the FEW-NNN method uses the Fisher score and deep graph feature learning algorithm to remove unimportant features and reduce the data dimension. Then, according to the proposed natural nearest neighbor searching algorithm(NNN_Searching), the density of data points, each class center and the smallest enclosing sphere radius are determined correspondingly. Finally, a fuzzy entropy weighted KNN classification method based on affinity is proposed, which mainly includes the following three steps: 1、 the feature weights of samples are calculated based on fuzzy entropy values, 2、 the fuzzy memberships of samples are determined based on affinity among samples, and 3、 K-neighbors are selected according to the class-conditional weighted Euclidean distance, the fuzzy membership value of the testing sample is calculated based on the membership of k-neighbors, and then all testing samples are classified according to the fuzzy membership value of the samples belonging to each class;that is, the attack type is determined. The method has been applied to the problem of attack detection and validated based on the famous KDD99 and CICIDS-2017 datasets. From the experimental results shown in this paper, it is observed that the FEW-NNN method improves the accuracy and efficiency of flow-based network traffic attack detection.

Multimode Process Monitoring Based on Fuzzy C-means in Locality Preserving Projection Subspace

For complex industrial processes with multiple operational conditions, it is important to develop effective monitoring algorithms to ensure the safety of production processes. This paper proposes a novel monitoring strategy based on fuzzy C-means. The high dimensional historical data are transferred to a low dimensional subspace spanned by locality preserving projection. Then the scores in the novel subspace are classified into several overlapped clusters, each representing an operational mode. The distance statistics of each cluster are integrated though the membership values into a novel BID (Bayesian inference distance) monitoring index. The efficiency and effectiveness of the proposed method are validated though the Tennessee Eastman benchmark process.

New two-dimensional fuzzy C-means clustering algorithm for image segmentation

To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.