The Concentration centroid Minimum Distance Clustering Criterion
| dc.contributor.author | Tschiersch, Lars | de |
| dc.contributor.author | Zerbst, Matthias | de |
| dc.date.accessioned | 2004-12-06T18:50:29Z | |
| dc.date.available | 2004-12-06T18:50:29Z | |
| dc.date.issued | 2002 | de |
| dc.description.abstract | Building homogenous classes is one of the main goals in clustering. Homogeneity can be measured by the intra-class variance (Bock, 1998). Especially in erosion projects but in other applications as well the separation between the built classes is as important as the homogeneity of the classes. Special clustering methods can be used to reach this aim, for instance the Maximum Linkage Algorithm (Zerbst, 2001) or the Advanced Maximum Linkage Algorithm (Tschiersch, 2002). To judge the separation quality of such clusterings, the shortest distances between all centroids is considered. Zerbst (2001) shows that the arithmetic mean over all distances isn’t good enough for judging selectivity. Therefore the concentration centroid minimum distance criterion is proposed in this paper. This criterion is based on the ratio of weighted symmetric mean over the minimal distances and the Gini coefficient over the minimal distances. It also judges the class separation independent of the underlying data situation. | en |
| dc.format.extent | 259088 bytes | |
| dc.format.extent | 78480 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5249 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15185 | |
| dc.language.iso | en | de |
| dc.publisher | Universitätsbibliothek Dortmund | de |
| dc.subject.ddc | 310 | de |
| dc.title | The Concentration centroid Minimum Distance Clustering Criterion | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | en |
| dcterms.accessRights | open access |