fuzzy.GG: Gath Geva Clustering

Description Usage Arguments Details Value Slots References Examples

Description

Gath Geva for Fuzzy Clustering

Usage

1
2
fuzzy.GG(X, K, m, max.iteration, threshold, member.init, RandomNumber = 0,
  print.result = 0)

Arguments

X

dataset (matrix/data frame)

K

number of cluster

m

fuzzyfier

max.iteration

maximum iteration for convergence

threshold

convergence criteria

member.init

membership object or matrix that will be used for initialized

RandomNumber

random number for start initializing

print.result

print result (0/1)

Details

This function perform Gath Geva algorithm by Gath-Geva (1989). Gath Geva is one of fuzzy clustering methods to clustering dataset become K cluster. Number of cluster (K) must be greater than 1. To control the overlaping or fuzziness of clustering, parameter m must be specified. Maximum iteration and threshold is specific number for convergencing the cluster. Random Number is number that will be used for seeding to firstly generate fuzzy membership matrix.

Clustering will produce fuzzy membership matrix (U) and fuzzy cluster centroid (V). The greatest value of membership on data point will determine cluster label. Centroid or cluster center can be use to interpret the cluster. Both membership and centroid produced by calculating mathematical distance. Gath Geva distance with Covariance Cluster and norm distribution assumption

Value

Fuzzy Clustering object

Slots

centroid

centroid matrix

distance

distance matrix

func.obj

function objective

call.func

called function

fuzzyfier

fuzzyness parameter

method.fuzzy

method of fuzzy clustering used

member

membership matrix

hard.label

hard.label

References

Gath and A.B. Geva,(1989) Unsupervised Optimal Fuzzy Clustering Balasko, B., Abonyi, J., & Feil, B. (2002). Fuzzy Clustering and Data Analysis Toolbox: For Use with Matlab. Veszprem, Hungary.

Examples

1
fuzzy.GG(iris[,1:4],K=2,m=2,max.iteration=20,threshold=1e-3,RandomNumber=1234)

fauzipandya/advfclust documentation built on May 16, 2019, 10:56 a.m.