FKM.ent.noise | R Documentation |
Performs the fuzzy k-means clustering algorithm with entropy regularization and noise cluster.
The entropy regularization allows us to avoid using the artificial fuzziness parameter m. This is replaced by the degree of fuzzy entropy ent, related to the concept of temperature in statistical physics.
An interesting property of the fuzzy k-means with entropy regularization is that the prototypes are obtained as weighted means with weights equal to the membership degrees (rather than to the membership degrees at
the power of m as is for the fuzzy k-means).
The noise cluster is an additional cluster (with respect to the k standard clusters) such that objects recognized to be outliers are assigned to it with high membership degrees.
FKM.ent.noise (X, k, ent, delta, RS, stand, startU, index, alpha, conv, maxit, seed)
X |
Matrix or data.frame |
k |
An integer value or vector specifying the number of clusters for which the |
ent |
Degree of fuzzy entropy (default: 1) |
delta |
Noise distance (default: average Euclidean distance between objects and prototypes from |
RS |
Number of (random) starts (default: 1) |
stand |
Standardization: if |
startU |
Rational start for the membership degree matrix |
index |
Cluster validity index to select the number of clusters: |
alpha |
Weighting coefficient for the fuzzy silhouette index |
conv |
Convergence criterion (default: 1e-9) |
maxit |
Maximum number of iterations (default: 1e+6) |
seed |
Seed value for random number generation (default: NULL) |
If startU
is given, the argument k
is ignored (the number of clusters is ncol(startU)
).
If startU
is given, the first element of value
, cput
and iter
refer to the rational start.
The default value for ent
is in general not reasonable if FKM.ent
is run using raw data.
The update of the membership degrees requires the computation of exponential functions. In some cases, this may produce NaN
values and the algorithm stops. Such a problem is usually solved by running FKM.ent
using standardized data (stand=1
).
Object of class fclust
, which is a list with the following components:
U |
Membership degree matrix |
H |
Prototype matrix |
F |
Array containing the covariance matrices of all the clusters ( |
clus |
Matrix containing the indexes of the clusters where the objects are assigned (column 1) and the associated membership degrees (column 2) |
medoid |
Vector containing the indexes of the medoid objects ( |
value |
Vector containing the loss function values for the |
criterion |
Vector containing the values of the cluster validity index |
iter |
Vector containing the numbers of iterations for the |
k |
Number of clusters |
m |
Parameter of fuzziness ( |
ent |
Degree of fuzzy entropy |
b |
Parameter of the polynomial fuzzifier ( |
vp |
Volume parameter ( |
delta |
Noise distance |
gam |
Weighting parameter for the fuzzy covariance matrices ( |
mcn |
Maximum condition number for the fuzzy covariance matrices ( |
stand |
Standardization (Yes if |
Xca |
Data used in the clustering algorithm (standardized data if |
X |
Raw data |
D |
Dissimilarity matrix ( |
call |
Matched call |
Paolo Giordani, Maria Brigida Ferraro, Alessio Serafini
Dave' R.N., 1991. Characterization and detection of noise in clustering. Pattern Recognition Letters, 12, 657-664.
Li R., Mukaidono M., 1995. A maximum entropy approach to fuzzy clustering. Proceedings of the Fourth IEEE Conference on Fuzzy Systems (FUZZ-IEEE/IFES '95), pp. 2227-2232.
Li R., Mukaidono M., 1999. Gaussian clustering method based on maximum-fuzzy-entropy interpretation. Fuzzy Sets and Systems, 102, 253-258.
FKM.ent
, Fclust
, Fclust.index
, print.fclust
, summary.fclust
, plot.fclust
, butterfly
## butterfly data data(butterfly) ## fuzzy k-means with entropy regularization and noise cluster, fixing the number of clusters clust=FKM.ent.noise(butterfly,k = 2, RS=5,delta=3) ## fuzzy k-means with entropy regularization and noise cluster, selecting the number of clusters clust=FKM.ent.noise(butterfly,RS=5,delta=3)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.