Using entropy of categorical data for clustering

Authors

Keywords:

clustering, entropy, number of clusters

Abstract

One of the most important tasks of cluster analysis is determining the number of clusters. In this article we suggest a method for it, using entropy of categorical data. Examples, illustrating the method, are given.

Author Biography

Chavdar Dangalchev

Chavdar Dangalchev
18, Veliko Tarnovo
4000 Plovdiv, Bulgaria
e-mail: dangalchev@hotmail.com

References

D. Barbara, J. Couto, Y. Li. COOLCAT: an entropy-based algorithm for categorical clustering. Proceedings of the Eleventh ACM CIKM Conference, 2002, 582–589.

E. Aldana-Bobadilla, A. Kuri-Morales. A clustering method based on the maximum entropy principle. Entropy, 17, (2015), No 1, 151–180.

A. Jain, R. Dubes. Algorithms for Clustering Data. Prentice Hall, 1988.

R. L. Thorndike. Who belongs in the family? Psychometrika, 18, 4 (1953), 267–276.

Downloads

Published

2020-04-07

How to Cite

[1]
Dangalchev, C. 2020. Using entropy of categorical data for clustering. Mathematics and Education in Mathematics. 49, (Apr. 2020), 133–136.

Issue

Section

Section B: Mathematical Modelling and Informatics