Cluster analysis with deolistic graphs
Autor(a) principal: | |
---|---|
Data de Publicação: | 2005 |
Outros Autores: | , , , , |
Tipo de documento: | Relatório |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFRJ |
Texto Completo: | http://hdl.handle.net/11422/1928 |
Resumo: | 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. |
id |
UFRJ_70b2e4e5bcc4d417803efae74ecda51e |
---|---|
oai_identifier_str |
oai:pantheon.ufrj.br:11422/1928 |
network_acronym_str |
UFRJ |
network_name_str |
Repositório Institucional da UFRJ |
repository_id_str |
|
spelling |
Alencar, Antonio Juarez Sylvio de Menezes deCruz, Leôncio TeixeiraFerreira, Armando LeiteSchmitz, Eber AssisLima, Priscila Machado VieiraManso, Fernando Silva Pereira2017-05-09T14:51:11Z2023-11-30T03:00:27Z2005-12-31ALENCAR, A. J. et al. Cluster analysis with deolistic graphs. Rio de Janeiro: NCE/UFRJ, 2005. 17 p. (Relatório Técnico, 02/05)http://hdl.handle.net/11422/1928This 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.Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-09T14:51:11Z No. of bitstreams: 1 02_05_000637952.pdf: 212022 bytes, checksum: 1d1cd22e5e07024facb2b4c9dac0173f (MD5)Made available in DSpace on 2017-05-09T14:51:11Z (GMT). No. of bitstreams: 1 02_05_000637952.pdf: 212022 bytes, checksum: 1d1cd22e5e07024facb2b4c9dac0173f (MD5) Previous issue date: 2005-12-31engRelatório técnico NCECNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOAnálise de clustersGrafos deolisticosSegmentaçãoCluster analysis with deolistic graphsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/report0205abertoBrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaisinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRJinstname:Universidade Federal do Rio de Janeiro (UFRJ)instacron:UFRJORIGINAL02_05_000637952.pdf02_05_000637952.pdfapplication/pdf212022http://pantheon.ufrj.br:80/bitstream/11422/1928/1/02_05_000637952.pdf1d1cd22e5e07024facb2b4c9dac0173fMD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81853http://pantheon.ufrj.br:80/bitstream/11422/1928/2/license.txtdd32849f2bfb22da963c3aac6e26e255MD52TEXT02_05_000637952.pdf.txt02_05_000637952.pdf.txtExtracted texttext/plain34709http://pantheon.ufrj.br:80/bitstream/11422/1928/3/02_05_000637952.pdf.txt5dcf2409ee2c555e1ca70ea3d6eb3304MD5311422/19282023-11-30 00:00:27.39oai:pantheon.ufrj.br:11422/1928TElDRU7Dh0EgTsODTy1FWENMVVNJVkEgREUgRElTVFJJQlVJw4fDg08KCkFvIGFzc2luYXIgZSBlbnRyZWdhciBlc3RhIGxpY2Vuw6dhLCB2b2PDqihzKSBvKHMpIGF1dG9yKGVzKSBvdSBwcm9wcmlldMOhcmlvKHMpIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBjb25jZWRlKG0pIGFvIFJlcG9zaXTDs3JpbyBQYW50aGVvbiBkYSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gZGUgSmFuZWlybyAoVUZSSikgbyBkaXJlaXRvIG7Do28gLSBleGNsdXNpdm8gZGUgcmVwcm9kdXppciwgY29udmVydGVyIChjb21vIGRlZmluaWRvIGFiYWl4byksIGUvb3UgZGlzdHJpYnVpciBvIGRvY3VtZW50byBlbnRyZWd1ZSAoaW5jbHVpbmRvIG8gcmVzdW1vKSBlbSB0b2RvIG8gbXVuZG8sIGVtIGZvcm1hdG8gZWxldHLDtG5pY28gZSBlbSBxdWFscXVlciBtZWlvLCBpbmNsdWluZG8sIG1hcyBuw6NvIGxpbWl0YWRvIGEgw6F1ZGlvIGUvb3UgdsOtZGVvLgoKVm9jw6ogY29uY29yZGEgcXVlIGEgVUZSSiBwb2RlLCBzZW0gYWx0ZXJhciBvIGNvbnRlw7pkbywgdHJhZHV6aXIgYSBhcHJlc2VudGHDp8OjbyBkZSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gY29tIGEgZmluYWxpZGFkZSBkZSBwcmVzZXJ2YcOnw6NvLgoKVm9jw6ogdGFtYsOpbSBjb25jb3JkYSBxdWUgYSBVRlJKIHBvZGUgbWFudGVyIG1haXMgZGUgdW1hIGPDs3BpYSBkZXNzYSBzdWJtaXNzw6NvIHBhcmEgZmlucyBkZSBzZWd1cmFuw6dhLCBiYWNrLXVwIGUgcHJlc2VydmHDp8OjbyBkaWdpdGFsLgoKRGVjbGFyYSBxdWUgbyBkb2N1bWVudG8gZW50cmVndWUgw6kgc2V1IHRyYWJhbGhvIG9yaWdpbmFsLCBlIHF1ZSB2b2PDqiB0ZW0gbyBkaXJlaXRvIGRlIGNvbmNlZGVyIG9zIGRpcmVpdG9zIGNvbnRpZG9zIG5lc3RhIGxpY2Vuw6dhLiBWb2PDqiB0YW1iw6ltIGRlY2xhcmEgcXVlIGEgc3VhIGFwcmVzZW50YcOnw6NvLCBjb20gbyBtZWxob3IgZGUgc2V1cyBjb25oZWNpbWVudG9zLCBuw6NvIGluZnJpbmdpIGRpcmVpdG9zIGF1dG9yYWlzIGRlIHRlcmNlaXJvcy4KClNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCB2b2PDqiBuw6NvIHRlbSBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIGRldGVudG9yIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBlIGNvbmNlZGUgYSBVRlJKIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvIGRhIHN1Ym1pc3PDo28uCgpTZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBiYXNlYWRvIGVtIHRyYWJhbGhvIHF1ZSBmb2ksIG91IHRlbSBzaWRvIHBhdHJvY2luYWRvIG91IGFwb2lhZG8gcG9yIHVtYSBhZ8OqbmNpYSBvdSBvdXRybyhzKSBvcmdhbmlzbW8ocykgcXVlIG7Do28gYSBVRlJKLCB2b2PDqiBkZWNsYXJhIHF1ZSBjdW1wcml1IHF1YWxxdWVyIGRpcmVpdG8gZGUgUkVWSVPDg08gb3UgZGUgb3V0cmFzIG9icmlnYcOnw7VlcyByZXF1ZXJpZGFzIHBvciBjb250cmF0byBvdSBhY29yZG8uCgpBIFVGUkogaXLDoSBpZGVudGlmaWNhciBjbGFyYW1lbnRlIG8ocykgc2V1KHMpIG5vbWUocykgY29tbyBhdXRvcihlcykgb3UgcHJvcHJpZXTDoXJpbyhzKSBkYSBzdWJtaXNzw6NvLCBlIG7Do28gZmFyw6EgcXVhbHF1ZXIgYWx0ZXJhw6fDo28sIHBhcmEgYWzDqW0gZGFzIHBlcm1pdGlkYXMgcG9yIGVzdGEgbGljZW7Dp2EsIG5vIGF0byBkZSBzdWJtaXNzw6NvLgo=Repositório de PublicaçõesPUBhttp://www.pantheon.ufrj.br/oai/requestopendoar:2023-11-30T03:00:27Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ)false |
dc.title.en.fl_str_mv |
Cluster analysis with deolistic graphs |
title |
Cluster analysis with deolistic graphs |
spellingShingle |
Cluster analysis with deolistic graphs Alencar, Antonio Juarez Sylvio de Menezes de CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO Análise de clusters Grafos deolisticos Segmentação |
title_short |
Cluster analysis with deolistic graphs |
title_full |
Cluster analysis with deolistic graphs |
title_fullStr |
Cluster analysis with deolistic graphs |
title_full_unstemmed |
Cluster analysis with deolistic graphs |
title_sort |
Cluster analysis with deolistic graphs |
author |
Alencar, Antonio Juarez Sylvio de Menezes de |
author_facet |
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 |
author_role |
author |
author2 |
Cruz, Leôncio Teixeira Ferreira, Armando Leite Schmitz, Eber Assis Lima, Priscila Machado Vieira Manso, Fernando Silva Pereira |
author2_role |
author author author author author |
dc.contributor.author.fl_str_mv |
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 |
dc.subject.cnpq.fl_str_mv |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
topic |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO Análise de clusters Grafos deolisticos Segmentação |
dc.subject.por.fl_str_mv |
Análise de clusters Grafos deolisticos Segmentação |
description |
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. |
publishDate |
2005 |
dc.date.issued.fl_str_mv |
2005-12-31 |
dc.date.accessioned.fl_str_mv |
2017-05-09T14:51:11Z |
dc.date.available.fl_str_mv |
2023-11-30T03:00:27Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/report |
format |
report |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
ALENCAR, A. J. et al. Cluster analysis with deolistic graphs. Rio de Janeiro: NCE/UFRJ, 2005. 17 p. (Relatório Técnico, 02/05) |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11422/1928 |
identifier_str_mv |
ALENCAR, A. J. et al. Cluster analysis with deolistic graphs. Rio de Janeiro: NCE/UFRJ, 2005. 17 p. (Relatório Técnico, 02/05) |
url |
http://hdl.handle.net/11422/1928 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.ispartof.pt_BR.fl_str_mv |
Relatório técnico NCE |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.country.fl_str_mv |
Brasil |
dc.publisher.department.fl_str_mv |
Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFRJ instname:Universidade Federal do Rio de Janeiro (UFRJ) instacron:UFRJ |
instname_str |
Universidade Federal do Rio de Janeiro (UFRJ) |
instacron_str |
UFRJ |
institution |
UFRJ |
reponame_str |
Repositório Institucional da UFRJ |
collection |
Repositório Institucional da UFRJ |
bitstream.url.fl_str_mv |
http://pantheon.ufrj.br:80/bitstream/11422/1928/1/02_05_000637952.pdf http://pantheon.ufrj.br:80/bitstream/11422/1928/2/license.txt http://pantheon.ufrj.br:80/bitstream/11422/1928/3/02_05_000637952.pdf.txt |
bitstream.checksum.fl_str_mv |
1d1cd22e5e07024facb2b4c9dac0173f dd32849f2bfb22da963c3aac6e26e255 5dcf2409ee2c555e1ca70ea3d6eb3304 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ) |
repository.mail.fl_str_mv |
|
_version_ |
1784097087257837568 |