A Dynamical Clustering Algorithm for Multi-nominal Data

  • Verde R
  • de A. T. de Carvalho F
  • Lechevallier Y
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Summary: We present a dynamical clustering algorithm in order to partition a set of multi-nominal data in k classes. This kind of data can be considered as a particular description of symbolic objects. In this algorithm, the representation of the classes is given by prototypes that generalize the characteristics of the elements belonging to each class. A suitable allocation function (context dependent) is considered in this context to assign an object to a class. The final classes are described by the distributions associated to the multi-nominal variables of the elements belonging to each class. That representation corresponds to the usual description of the so-called modal symbolic objects.

Cite

CITATION STYLE

APA

Verde, R., de A. T. de Carvalho, F., & Lechevallier, Y. (2000). A Dynamical Clustering Algorithm for Multi-nominal Data (pp. 387–393). https://doi.org/10.1007/978-3-642-59789-3_61

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