Performs the Gustafson and Kessel - like fuzzy k-means clustering algorithm with noise cluster.
Differently from fuzzy k-means, it is able to discover non-spherical clusters.
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.gk.noise (X, k, m, vp, delta, RS, stand, startU, index, alpha, conv, maxit, seed)
Object of class fclust
, which is a list with the following components:
Membership degree matrix
Prototype matrix
Array containing the covariance matrices of all the clusters
Matrix containing the indexes of the clusters where the objects are assigned (column 1) and the associated membership degrees (column 2)
Vector containing the indexes of the medoid objects (NULL
for FKM.gk.noise
)
Vector containing the loss function values for the RS
starts
Vector containing the values of the cluster validity index
Vector containing the numbers of iterations for the RS
starts
Number of clusters
Parameter of fuzziness
Degree of fuzzy entropy (NULL
for FKM.gk.noise
)
Parameter of the polynomial fuzzifier (NULL
for FKM.gk.noise
)
Volume parameter
Noise distance
Weighting parameter for the fuzzy covariance matrices (NULL
for FKM.gk.noise
)
Maximum condition number for the fuzzy covariance matrices (NULL
for FKM.gk.noise
)
Standardization (Yes if stand=1
, No if stand=0
)
Data used in the clustering algorithm (standardized data if stand=1
)
Raw data
Dissimilarity matrix (NULL
for FKM.gk.noise
)
Matched call
Matrix or data.frame
An integer value or vector specifying the number of clusters for which the index
is to be calculated (default: 2:6)
Parameter of fuzziness (default: 2)
Volume parameter (default: rep(1,max(k)
). If k
is a vector, for each group the first k
element of vp
are considered.
Noise distance (default: average Euclidean distance between objects and prototypes from FKM.gk
using the same values of k
and m
)
Number of (random) starts (default: 1)
Standardization: if stand=1
, the clustering algorithm is run using standardized data (default: no standardization)
Rational start for the membership degree matrix U
(default: no rational start)
Cluster validity index to select the number of clusters: "PC"
(partition coefficient), "PE"
(partition entropy), "MPC"
(modified partition coefficient), "SIL"
(silhouette), "SIL.F"
(fuzzy silhouette), "XB"
(Xie and Beni) (default: "SIL.F")
Weighting coefficient for the fuzzy silhouette index SIL.F
(default: 1)
Convergence criterion (default: 1e-9)
Maximum number of iterations (default: 1e+6)
Seed value for random number generation (default: NULL)
Paolo Giordani, Maria Brigida Ferraro, Alessio Serafini
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.
If a cluster covariance matrix becomes singular, then the algorithm stops and the element of value
is NaN.
The Babuska et al. variant in FKM.gkb.noise
is recommended.
Dave' R.N., 1991. Characterization and detection of noise in clustering. Pattern Recognition Letters, 12, 657-664.
Gustafson E.E., Kessel W.C., 1978. Fuzzy clustering with a fuzzy covariance matrix. Proceedings of the IEEE Conference on Decision and Control, pp. 761-766.
FKM.gkb.noise
, Fclust
, Fclust.index
, print.fclust
, summary.fclust
, plot.fclust
, unemployment
if (FALSE) {
## unemployment data
data(unemployment)
## Gustafson and Kessel-like fuzzy k-means with noise cluster, fixing the number of clusters
clust=FKM.gk.noise(unemployment,k=3,delta=20,RS=10)
## Gustafson and Kessel-like fuzzy k-means with noise cluster, selecting the number of clusters
clust=FKM.gk.noise(unemployment,k=2:6,delta=20,RS=10)
}
Run the code above in your browser using DataLab