Fuzzy clustering algorithm based on adaptive euclidean distance and entropy regularization for interval-valued data

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Symbolic Data Analysis provides suitable new types of variable that can take into account the variability present in the observed measurements. This paper proposes a partitioning fuzzy clustering algorithm for interval-valued data based on suitable adaptive Euclidean distance and entropy regularization. The proposed method optimizes an objective function by alternating three steps aiming to compute the fuzzy cluster representatives, the fuzzy partition, as well as relevance weights for the interval-valued variables. Experiments on synthetic and real datasets corroborate the usefulness of the proposed algorithm.

Cite

CITATION STYLE

APA

Rodríguez, S. I. R., & de Carvalho, F. de A. T. (2018). Fuzzy clustering algorithm based on adaptive euclidean distance and entropy regularization for interval-valued data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11139 LNCS, pp. 695–705). Springer Verlag. https://doi.org/10.1007/978-3-030-01418-6_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free