Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/1928
Type: Relatório
Title: Cluster analysis with deolistic graphs
Author(s)/Inventor(s): Alencar, Antonio Juarez Sylvio de Menezes de
Cruz, Leôncio Teixeira
Ferreira, Armando Leite
Schmitz, Eber Assis
Lima, Priscila Machado Vieira
Manso, Fernando Silva Pereira
Abstract: This work introduces a particular family of acyclic graphs referred to as Deolistic graphs. The formal definition of a Deolistic graph is presented together with a new clustering algorithm that uses logical sentences to reveal hidden structures in data. The sentences yielded by the algorithm can be generated by automatic means, considerably reducing the complexity of data analysis and time spent on the clustering process, not to mention the usefulness of its results. Furthermore, these sentences are rules that can be easily understood, interpreted and disclosed to all interested parties, thereby improving communication and reducing misunderstandings.
Keywords: Análise de clusters
Grafos deolisticos
Segmentação
Subject CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
Department : Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
In: Relatório técnico NCE
Issue: 0205
Issue Date: 31-Dec-2005
Publisher country: Brasil
Language: eng
Right access: Acesso Aberto
Citation: ALENCAR, A. J. et al. Cluster analysis with deolistic graphs. Rio de Janeiro: NCE/UFRJ, 2005. 17 p. (Relatório Técnico, 02/05)
URI: http://hdl.handle.net/11422/1928
Appears in Collections:Relatórios Técnicos e de Pesquisa

Files in This Item:
File Description SizeFormat 
02_05_000637952.pdf207,05 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.