A modified initialization method to find an initial center for Fuzzy K-modes clustering

Veena.S, Saranya.C; Jayanthi, P.

doi:10.1109/itcosp.2017.8303124

2017 IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing (INCOS) 2017

DOI: 10.1109/itcosp.2017.8303124

|View full text |Cite

A modified initialization method to find an initial center for Fuzzy K-modes clustering

Saranya.C Veena.S

P. Jayanthi

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

An Optimized k-means Algorithm Based on Information Entropy

Liu

Zhang

et al. 2021

The Computer Journal

View full text Add to dashboard Cite

Clustering is a widely used technique in data mining applications and various pattern recognition applications, in which data objects are divided into groups. K-means algorithm is one of the most classical clustering algorithms. In this algorithm, the initial clustering centers are randomly selected, this results in unstable clustering results. To solve this problem, an optimized algorithm to select the initial centers is proposed. In the proposed algorithm, dispersion degree is defined, which is based on entropy. In the algorithm, all the objects are firstly grouped into a big cluster, and the object that has the maximum dispersion degree and the object that has the minimum dispersion degree are selected as the initial clustering centers from the initial big cluster. And then other objects in the biggest cluster are partitioned to the initial clusters to which the objects are nearest. The partition process will be repeated until the cluster number is equal to the specified value k. Finally, the partitioned k clusters and their cluster centers are applied to k-means algorithm as initial clusters and centers. Several experiments are conducted on real data sets to evaluate the proposed algorithm. The proposed algorithm is compared with traditional k-means algorithm and max-min distance clustering algorithm, and experimental results show that the improved k-means algorithm is stable in selecting initial clustering, because it can select unique initial clustering centers. The optimized algorithm’s effectiveness and feasibility are also verified by experiments, and the algorithm can reduce the times of iterations and has more stable clustering results and higher accuracy.

show abstract

An Optimized k-means Algorithm Based on Information Entropy

Liu

Zhang

et al. 2021

The Computer Journal

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A modified initialization method to find an initial center for Fuzzy K-modes clustering

Cited by 1 publication

References 16 publications

An Optimized k-means Algorithm Based on Information Entropy

An Optimized k-means Algorithm Based on Information Entropy

Contact Info

Product

Resources

About