Titlebook: Classification, Automation, and New Media; Proceedings of the 2 Wolfgang Gaul,Gunter Ritter Conference proceedings 2002 Springer-Verlag Ber

钉牢

Two-mode Clustering with Genetic Algorithms the special structure of two-mode clustering into account. This algorithm is moreover compared with the Alternating Exchanges (AE) algorithm proposed by (.). The comparison is done by testdata as well as by real life data.

BRAWL

Exact Tests for the Comparison of Binary Data Structures in Timeilar problems were considered by (.) for dichotomous spatial data. However, due to the complexity of the spatial models only Markov chain Monte Carlo approximations were considered by these authors. We illustrate our exact tests by comparing the structure of two epidemiological data sets.

Ointment

Connected Maximum Split Clustering of Ladder Graphsimum Split problem on a grid graph with two rows and . columns (a .) is presented. Ladder structures naturally arise whenever there are two parallel ways connected by several “bridges” or “connectors” (for instance, river banks, assembly lines, processes).