Show simple item record

2005-10-17Buch DOI: 10.18452/3636
Measures for the structure of clustering and admissibilities of its algorithm
dc.contributor.authorTakeuchi, Akinobu
dc.contributor.authorYadohisa, Hiroshi
dc.contributor.authorInada, Koichi
dc.date.accessioned2017-06-15T21:38:12Z
dc.date.available2017-06-15T21:38:12Z
dc.date.created2005-10-17
dc.date.issued2005-10-17
dc.identifier.issn1436-1086
dc.identifier.urihttp://edoc.hu-berlin.de/18452/4288
dc.description.abstractThe problem of selecting a clustering algorithm from the myriad of algorithms has been discussed in recent years. Many researchers have attacked this problem by using the concept of admissibility (e.g. Fisher and Van Ness, 1971, Yadohisa, et al., 1999). We propose a new criterion called the “structured ratio” for measuring the clustering results. It includes the concept of the well-structured admissibility as a special case, and represents some kind of “goodness-of-fit” of the clustering result. New admissibilities of the clustering algorithm and a new agglomerative hierarchical clustering algorithm are also provided by using the structured ratio. Details of the admissibilities of the eight popular algorithms are discussed.eng
dc.language.isoeng
dc.publisherHumboldt-Universität zu Berlin, Wirtschaftswissenschaftliche Fakultät
dc.subjectstructureeng
dc.subjectadmissibilityeng
dc.subjectAHCA (agglomerative hierarchical clustering algorithm)eng
dc.subject.ddc330 Wirtschaft
dc.titleMeasures for the structure of clustering and admissibilities of its algorithm
dc.typebook
dc.identifier.urnurn:nbn:de:kobv:11-10050568
dc.identifier.doihttp://dx.doi.org/10.18452/3636
local.edoc.container-titleSonderforschungsbereich 373: Quantification and Simulation of Economic Processes
local.edoc.pages6
local.edoc.type-nameBuch
local.edoc.container-typeseries
local.edoc.container-type-nameSchriftenreihe
local.edoc.container-volume2001
local.edoc.container-issue79
local.edoc.container-year2001
local.edoc.container-erstkatid2135319-0

Show simple item record