Algoritmos para la clasificación piramidal simbólica

 

Guardado en:
Detalles Bibliográficos
Autores: Rodríguez, Oldemar, Brito, María Paula, Diday, Edwin
Formato: artículo original
Estado:Versión publicada
Fecha de Publicación:2000
Descripción:This pyramidal clustering method generalizes hierarchies by allowing non-disjoint classes at a given level instead a partition. Moreover, the clusters of the pyramid are intervals of a total order on the set being clustered, hence pyramids constitute an intermediate model between the tree and the lattice structures. This method allows moreover to cluster more complex data than the tabular model allows to process, by considering variation on the values taken by the variables. Each cluster formed is defined not only by the set of its elements (i.e. its extent) but also by a symbolic object, which describes its properties (its intent). In this paper we propose a new algorithm CAPS to built a symbolic pyramid, this algorithm in an extension to symbolic case of the algorithm CAP proposed in [Diday 1984] to the symbolic case. An example is presented to illustrate the effectiveness of the proposed algorithm and we also present a free software for this algorithm.  
País:Portal de Revistas UCR
Institución:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Lenguaje:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/178
Acceso en línea:https://revistas.ucr.ac.cr/index.php/matematica/article/view/178
Palabra clave:symbolic data analysis
pyramidal clustering
exten
inten
conceptual lattices
symbolic pyramid
pirámide
objeto simbólico
grada
grado de generalidad
objeto completo
componente conexa
tablas de datos simbólica