The redesigned Fuzzy C Strange points clustering algorithm

The redesigned Fuzzy C Strange points clustering algorithm uses the membership function to find the strange points and also to establish the degree of likeness of elements to different clusters as opposed to the traditional fuzzy c strange points clustering algorithm which uses the Euclidean distance to find the strange points and membership function only to group the points into clusters. The redesigned algorithm was observed to give similar quality of clusters and also converge with the same speed of execution as the orthodox fuzzy c strange points clustering method.

[1]  Terence Johnson.  Clustering of collinear data points in lower dimensions , 2012 .

[2]  James C. Bezdek,et al.  Efficient Implementation of the Fuzzy c-Means Clustering Algorithms , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Terence Johnson,et al.  Enhanced K Strange Points Clustering Algorithm , 2015, 2015 International Conference on Emerging Information Technology and Engineering Solutions.

[4]  Tzung-Pei Hong,et al.  Induction of fuzzy rules and membership functions from training examples , 1996, Fuzzy Sets Syst..

[5]  Santosh Kumar Singh,et al.  Fuzzy C strange points clustering algorithm , 2016, 2016 International Conference on Information Communication and Embedded Systems (ICICES).

[6]  R. Fisher.  THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS , 1936 .

[7]  Santosh Kumar Singh,et al.  K-Strange Points Clustering Algorithm , 2015 .

[8]  Henry Wolkowicz,et al.  Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming , 1999, Comput. Optim. Appl..