We propose an alternative approach to fuzzy c-means clustering which eliminates the weighting exponent parameter of conventional algorithms. It is based on a particular convex factorisation of data matrix. The proposed method is invariant under certain linear transformations of the data including principal component analysis. We tested its accuracy using both synthetic data and real datasets, and compared it to that provided by the usual fuzzy c-means algorithm. We were able to ascertain that our proposal can be a credible yet easier alternative to this approach to fuzzy clustering. Moreover, it showed no noticeable sensitivity to the initial guess of the partition matrix.info:eu-repo/semantics/publishedVersio
The fuzzy c-means (FCM) clustering algorithm has long been used to cluster numerical data. Recently ...
As one of the most important information of the data, the geometry structure information is usually ...
We propose a new data induced metric to perform un supervised data classification (clustering). Our ...
We propose an alternative approach to fuzzy c-means clustering which eliminates the weighting expone...
A general method for two-mode simultaneous reduction of units and variables of a data matrix is int...
In this paper, we propose a factor weighted fuzzy c-means clustering algorithm. Based on the inverse...
A new approach to fuzzy clustering is proposed in this paper. It aims to relax some constraints impo...
A new approach to fuzzy clustering is proposed in this paper. It aims to relax some constraints impo...
A general method for two-mode simultaneous reduction of observation units and variables of a data ma...
In this paper we study the fuzzy c-mean clustering algorithm combined with principal components meth...
This paper discusses various extensions of the classical within-group sum of squared errors function...
[[abstract]]The popular fuzzy c-means algorithm (FCM) is an objective function based clustering meth...
In this paper, the problem of achieving 'semi-fuzzy ' or 'soft ' clustering of m...
[[abstract]]Two well known fuzzy partition clustering algorithms, FCM and FPCM are based on Euclidea...
We propose a new method for the simultaneous reduction of units and variables in a data matrix. Red...
The fuzzy c-means (FCM) clustering algorithm has long been used to cluster numerical data. Recently ...
As one of the most important information of the data, the geometry structure information is usually ...
We propose a new data induced metric to perform un supervised data classification (clustering). Our ...
We propose an alternative approach to fuzzy c-means clustering which eliminates the weighting expone...
A general method for two-mode simultaneous reduction of units and variables of a data matrix is int...
In this paper, we propose a factor weighted fuzzy c-means clustering algorithm. Based on the inverse...
A new approach to fuzzy clustering is proposed in this paper. It aims to relax some constraints impo...
A new approach to fuzzy clustering is proposed in this paper. It aims to relax some constraints impo...
A general method for two-mode simultaneous reduction of observation units and variables of a data ma...
In this paper we study the fuzzy c-mean clustering algorithm combined with principal components meth...
This paper discusses various extensions of the classical within-group sum of squared errors function...
[[abstract]]The popular fuzzy c-means algorithm (FCM) is an objective function based clustering meth...
In this paper, the problem of achieving 'semi-fuzzy ' or 'soft ' clustering of m...
[[abstract]]Two well known fuzzy partition clustering algorithms, FCM and FPCM are based on Euclidea...
We propose a new method for the simultaneous reduction of units and variables in a data matrix. Red...
The fuzzy c-means (FCM) clustering algorithm has long been used to cluster numerical data. Recently ...
As one of the most important information of the data, the geometry structure information is usually ...
We propose a new data induced metric to perform un supervised data classification (clustering). Our ...