论文信息 - Clustering on coloured lattices

Clustering on coloured lattices

This paper is concerned with nearest-neighbour systems on the coloured lattice (unordered state space). It extends the paper of Strauss (1975) on clustering in the two-colour case. Comparison is made with the more general methods of Besag (1974). Some tests are developed, and illustrated with an example. NEAREST-NEIGHBOUR SYSTEM; MARKOV RANDOM FIELD; CLUSTERING; QUALITATIVE DATA

D. J. Strauss

[1] J. M. Hammersley,et al. Markov fields on finite graphs and lattices , 1971 .

[2] J. Besag. Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[3] David J. Strauss. Analysing binary lattice data with the nearest-neighbor property , 1975 .

[4] A. R. Bloemena. Sampling from a graph , 1976 .