scholarly journals Entropy-Based Multiview Data Clustering Analysis in the Era of Industry 4.0

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yi Gu ◽  
Kang Li
Keyword(s):  
Industry 4.0 ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Complex Data ◽  
Single View ◽  
The Face ◽  
Fuzzy C Means Clustering ◽  
Fuzzy Index ◽  
Multiview Clustering ◽  
Almost All

In the era of Industry 4.0, single-view clustering algorithm is difficult to play a role in the face of complex data, i.e., multiview data. In recent years, an extension of the traditional single-view clustering is multiview clustering technology, which is becoming more and more popular. Although the multiview clustering algorithm has better effectiveness than the single-view clustering algorithm, almost all the current multiview clustering algorithms usually have two weaknesses as follows. (1) The current multiview collaborative clustering strategy lacks theoretical support. (2) The weight of each view is averaged. To solve the above-mentioned problems, we used the Havrda-Charvat entropy and fuzzy index to construct a new collaborative multiview fuzzy c-means clustering algorithm using fuzzy weighting called Co-MVFCM. The corresponding results show that the Co-MVFCM has the best clustering performance among all the comparison clustering algorithms.

The Kernel Rough K-Means Algorithm

2020 ◽  
Vol 13 (2) ◽  
pp. 234-239
Author(s):  
Wang Meng ◽  
Dui Hongyan ◽  
Zhou Shiyuan ◽  
Dong Zhankui ◽  
Wu Zige
Keyword(s):  
Clustering Algorithm ◽  
Rough Set Theory ◽  
Fuzzy Theory ◽  
Clustering Algorithms ◽  
Attractive Alternative ◽  
Complex Data ◽  
Soft Clustering ◽  
Alternative Clustering ◽  
Clustering And Classification ◽  
Hard Clustering

Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in recent years. The clustering method can be divided into two categories according to the uncertainty, which are hard clustering and soft clustering. The Hard C-Means clustering (HCM) belongs to hard clustering while the Fuzzy C-Means clustering (FCM) belongs to soft clustering in the field of k-means clustering research respectively. The linearly separable problem is a big challenge to clustering and classification algorithm and further improvement is required in big data era. Objective: RKM algorithm based on fuzzy roughness is also a hot topic in current research. The rough set theory and the fuzzy theory are powerful tools for depicting uncertainty, which are the same in essence. Therefore, RKM can be kernelized by the mean of KFCM. In this paper, we put forward a Kernel Rough K-Means algorithm (KRKM) for RKM to solve nonlinear problem for RKM. KRKM expanded the ability of processing complex data of RKM and solve the problem of the soft clustering uncertainty. Methods: This paper proposed the process of the Kernel Rough K-Means algorithm (KRKM). Then the clustering accuracy was contrasted by utilizing the data sets from UCI repository. The experiment results shown the KRKM with improved clustering accuracy, comparing with the RKM algorithm. Results: The classification precision of KFCM and KRKM were improved. For the classification precision, KRKM was slightly higher than KFCM, indicating that KRKM was also an attractive alternative clustering algorithm and had good clustering effect when dealing with nonlinear clustering. Conclusion: Through the comparison with the precision of KFCM algorithm, it was found that KRKM had slight advantages in clustering accuracy. KRKM was one of the effective clustering algorithms that can be selected in nonlinear clustering.

Regularized Fuzzy c-Means Clustering and its Behavior at Point of Infinity

2019 ◽  
Vol 23 (3) ◽  
pp. 485-492 ◽  
Author(s):  
Yuchi Kanzawa ◽  
Sadaaki Miyamoto ◽  
◽  
Keyword(s):  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Fuzzy Classification ◽  
Fuzzy C Means ◽  
Derivative Function ◽  
Fuzzy C Means Clustering ◽  
Classification Function

This study shows that a general regularized fuzzy c-means (rFCM) clustering algorithm, including some conventional clustering algorithms, can be constructed if a given regularizer function value, its derivative function value, and its inverse derivative function value can be calculated. Furthermore, the results of the study show that the behavior of the fuzzy classification function for rFCM at an infinity point is similar to that for some conventional clustering algorithms.

Fuzzy Similarity Measure Based Spectral Clustering Framework for Noisy Image Segmentation

2017 ◽  
Vol 25 (04) ◽  
pp. 649-673 ◽  
Author(s):  
Subhanshu Goyal ◽  
Sushil Kumar ◽  
M. A. Zaveri ◽  
A. K. Shukla
Keyword(s):  
Similarity Measure ◽  
Spectral Clustering ◽  
Clustering Algorithm ◽  
Spatial Information ◽  
Clustering Algorithms ◽  
Gaussian Kernel ◽  
Similarity Matrix ◽  
Fuzzy Similarity ◽  
Level Information ◽  
Fuzzy C Means Clustering

In recent times, graph based spectral clustering algorithms have received immense attention in many areas like, data mining, object recognition, image analysis and processing. The commonly used similarity measure in the clustering algorithms is the Gaussian kernel function which uses sensitive scaling parameter and when applied to the segmentation of noise contaminated images leads to unsatisfactory performance because of neglecting the spatial pixel information. The present work introduces a novel framework for spectral clustering which embodied local spatial information and fuzzy based similarity measure to tackle the above mentioned issues. In our approach, firstly we filter the noise components from original image by using the spatial and gray–level information. The similarity matrix is then constructed by employing a similarity measure which takes into account the fuzzy c-partition matrix and vectors of the cluster centers obtained by fuzzy c-means clustering algorithm. In the last step, spectral clustering technique is realized on derived similarity matrix to obtain the desired segmentation result. Experimental results on segmentation of synthetic and Berkeley benchmark images with noise demonstrates the effectiveness and robustness of the proposed method, giving it an edge over the clustering based segmentation method reported in the literature.

scholarly journals Implementation of Energy HEED (ER-HEED) Protocol Using Super Cluster Head for WSN

2018 ◽  
Vol 7 (S1) ◽  
pp. 119-122
Author(s):  
G. Pattabirani ◽  
K. Selvakumar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Hybrid Energy ◽  
Almost All ◽  
Energy Efficient Clustering ◽  
Super Cluster Head

Wireless Sensor Network (WSN) is used in almost all applications in developing environment. This is due to their ability and easy implementation through several applications. The most important criteria in WSN are to minimize the energy consumption and improve the network lifetime. Clustering algorithms are considered as one of the effective way to improve the network lifetime in WSN. Hybrid, Energy-Efficient and Distributed (HEED) clustering approach uses energy-efficient clustering algorithm. This paper proposes an Enhanced Rotational HEED (ER-HEED) protocol using super cluster head for minimizing energy consumption and to improve the network lifetime. The proposed work is carried out in two stages, first stage, super cluster head is introduced. In second stage, the node with maximum threshold is chosen as a cluster head on rotation within in the cluster. The results show that the ER-HEED performs well when compared with HEED and LEACH.

scholarly journals A STEP TOWARDS THE MAJORITY-BASED CLUSTERING VALIDATION DECISION FUSION METHOD

2021 ◽  
Vol 11 (2) ◽  
pp. 4-13
Author(s):  
Taras Panskyi ◽  
Volodymyr Mosorov
Keyword(s):  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Decision Fusion ◽  
Maximum Efficiency ◽  
Final Decision ◽  
Fusion Method ◽  
Dissimilarity Measures ◽  
Suitable Index ◽  
Almost All ◽  
Clustering Validation

A variety of clustering validation indices (CVIs) aimed at validating the results of clustering analysis and determining which clustering algorithm performs best. Different validation indices may be appropriate for different clustering algorithms or partition dissimilarity measures; however, the best suitable index to use in practice remains unknown. A single CVI is generally unable to handle the wide variability and scalability of the data and cope successfully with all the contexts. Therefore, one of the popular approaches is to use a combination of multiple CVIs and fuse their votes into the final decision. The aim of this work is to analyze the majority-based decision fusion method. Thus, the experimental work consisted of designing and implementing the NbClust majority-based decision fusion method and then evaluating the CVIs performance with different clustering algorithms and dissimilarity measures in order to discover the best validation configuration. Moreover, the author proposed to enhance the standard majority-based decision fusion method with straightforward rules for the maximum efficiency of the validation procedure. The result showed that the designed enhanced method with an invasive validation configuration could cope with almost all data sets (99%) with different experimental factors (density, dimensionality, number of clusters, etc.).

scholarly journals AN EFFICIENTFUZZY C-MEANS CLUSTERING ALGORITHM FOR MULTI-VALUED DATA SETS

2021 ◽  
Vol 9 (1) ◽  
pp. 1250-1264
Author(s):  
P Gopala Krishna, D Lalitha Bhaskari
Keyword(s):  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Data Sets ◽  
Similar Data ◽  
Job Descriptions ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
Ship Function ◽  
Partition Clustering ◽  
Diverse Data

In data analysis, items were mostly described by a set of characteristics called features, in which each feature contains only single value for each object. Even so, in existence, some features may include more than one value, such as a person with different job descriptions, activities, phone numbers, skills and different mailing addresses. Such features may be called as multi-valued features, and are mostly classified as null features while analyzing the data using machine learning and data mining techniques.  In this paper, it is proposed a proximity function to be described between two substances with multi-valued features that are put into effect for clustering.The suggested distance approach allows iterative measurements of the similarities around objects as well as their characteristics. For facilitating the most suitable multi-valued factors, we put forward a model targeting at determining each factor’s relative prominence for diverse data extracting problems. The proposed algorithm is a partition clustering strategy that uses fuzzy c- means clustering for evolutions, which is using the novel member ship function by utilizing the proposed similarity measure. The proposed clustering algorithm as fuzzy c- means based Clustering of Multivalued Attribute Data (FCM-MVA).Therefore this becomes feasible using any mechanisms for cluster analysis to group similar data. The findings demonstrate that our test not only improves the performance the traditional measure of similarity but also outperforms other clustering algorithms on the multi-valued clustering framework.  

Fuzzy C-Means Clustering Algorithm Based on Coefficient of Variation

2014 ◽  
Vol 998-999 ◽  
pp. 873-877
Author(s):  
Zhen Bo Wang ◽  
Bao Zhi Qiu
Keyword(s):  
Coefficient Of Variation ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Real Data ◽  
Cluster Center ◽  
Data Set ◽  
Fuzzy C Means ◽  
Initial Cluster ◽  
Fuzzy C Means Clustering ◽  
The Impact

To reduce the impact of irrelevant attributes on clustering results, and improve the importance of relevant attributes to clustering, this paper proposes fuzzy C-means clustering algorithm based on coefficient of variation (CV-FCM). In the algorithm, coefficient of variation is used to weigh attributes so as to assign different weights to each attribute in the data set, and the magnitude of weight is used to express the importance of different attributes to clusters. In addition, for the characteristic of fuzzy C-means clustering algorithm that it is susceptible to initial cluster center value, the method for the selection of initial cluster center based on maximum distance is introduced on the basis of weighted coefficient of variation. The result of the experiment based on real data sets shows that this algorithm can select cluster center effectively, with the clustering result superior to general fuzzy C-means clustering algorithms.

scholarly journals Neural Network Based Fuzzy C-MEANS Clustering Algorithm

2011 ◽  
pp. 100-104
Author(s):  
Suneetha Chittinen ◽  
Dr. Raveendra Babu Bhogapathi
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Data Sets ◽  
Fuzzy C Means ◽  
Fast Learning ◽  
Presentation Sequence ◽  
Fuzzy C Means Clustering ◽  
Artificial Neural

In this paper, fuzzy c-means algorithm uses neural network algorithm is presented. In pattern recognition, fuzzy clustering algorithms have demonstrated advantage over crisp clustering algorithms to group the high dimensional data into clusters. The proposed work involves two steps. First, a recently developed and Enhanced Kmeans Fast Leaning Artificial Neural Network (KFLANN) frame work is used to determine cluster centers. Secondly, Fuzzy C-means uses these cluster centers to generate fuzzy membership functions. Enhanced K-means Fast Learning Artificial Neural Network (KFLANN) is an algorithm which produces consistent classification of the vectors in to the same clusters regardless of the data presentation sequence. Experiments are conducted on two artificial data sets Iris and New Thyroid. The result shows that Enhanced KFLANN is faster to generate consistent cluster centers and utilizes these for elicitation of efficient fuzzy memberships.

scholarly journals Deep Embedded Non-Redundant Clustering

2020 ◽  
Vol 34 (04) ◽  
pp. 5174-5181
Author(s):  
Lukas Miklautz ◽  
Dominik Mautz ◽  
Muzaffer Can Altinigneli ◽  
Christian Böhm ◽  
Claudia Plant
Keyword(s):  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Image Data ◽  
Linear Representation ◽  
Representation Learning ◽  
Complex Data ◽  
Data Types ◽  
Data Set ◽  
Non Linear ◽  
Representational Power

Complex data types like images can be clustered in multiple valid ways. Non-redundant clustering aims at extracting those meaningful groupings by discouraging redundancy between clusterings. Unfortunately, clustering images in pixel space directly has been shown to work unsatisfactory. This has increased interest in combining the high representational power of deep learning with clustering, termed deep clustering. Algorithms of this type combine the non-linear embedding of an autoencoder with a clustering objective and optimize both simultaneously. None of these algorithms try to find multiple non-redundant clusterings. In this paper, we propose the novel Embedded Non-Redundant Clustering algorithm (ENRC). It is the first algorithm that combines neural-network-based representation learning with non-redundant clustering. ENRC can find multiple highly non-redundant clusterings of different dimensionalities within a data set. This is achieved by (softly) assigning each dimension of the embedded space to the different clusterings. For instance, in image data sets it can group the objects by color, material and shape, without the need for explicit feature engineering. We show the viability of ENRC in extensive experiments and empirically demonstrate the advantage of combining non-linear representation learning with non-redundant clustering.

scholarly journals Application of Fuzzy Grade-of-Membership Clustering to Analysis of Remote Sensing Data

1999 ◽  
Vol 12 (1) ◽  
pp. 200-219 ◽  
Author(s):  
Lisa M. Talbot ◽  
Bryan G. Talbot ◽  
Robert E. Peterson ◽  
H. Dennis Tolley ◽  
Harvey D. Mecham
Keyword(s):  
Remote Sensing ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Remote Sensing Data ◽  
Sensing Data ◽  
Temperature And Precipitation ◽  
Fuzzy C Means Clustering ◽  
Alternative Means ◽  
Climatic Classification ◽  
Grade Of Membership

Abstract A fuzzy grade-of-membership (GoM) clustering algorithm is applied to analysis of remote sensing data, in particular, the type of data used in climatic classification. The methodology is applied to a cloud product data subset derived from NASA’s International Satellite Cloud Climatology Project, which includes remotely sensed global monthly average surface temperature and precipitation data for land and coastal regions for the year 1984. GoM partitions for this case are similar to those of vector quantization and fuzzy c-means clustering algorithms, which is significant given the striking differences between the algorithms. The GoM clustering approach is shown to provide an alternative means of interpreting large heterogeneous datasets for exploratory analysis, which broadens the application base by admitting categorical data.

Sign in / Sign up

Export Citation Format

Share Document