Initialization of the neighborhood EM algorithm for spatial clustering

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Like other iterative refinement clustering algorithms, the Neighborhood Expectation-Maximization (NEM) algorithm is sensitive to the initial state of cluster separation. Therefore, the study of the initialization methods is of great importance for the success of finding a better sub-optimal solution in practice. However, existing initialization methods for mixture model based clustering using EM-style algorithms do not account for the unique properties of spatial data, such as spatial autocorrelation. To that end, this paper incorporates spatial information into the initialization and compares three representative initialization methods. Our experimental results on both synthetic and real-world datasets show that the NEM algorithm usually leads to a better clustering solution if it starts with initial states returned by the spatial augmented initialization method based on K-Means. © 2009 Springer.

Cite

CITATION STYLE

APA

Hu, T., Ouyang, J., Qu, C., & Liu, C. (2009). Initialization of the neighborhood EM algorithm for spatial clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5678 LNAI, pp. 487–495). https://doi.org/10.1007/978-3-642-03348-3_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free