Skip to main content

Initialization of the Neighborhood EM Algorithm for Spatial Clustering

  • Conference paper
Advanced Data Mining and Applications (ADMA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5678))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of Royal Statistical Society B(39), 1–38 (1977)

    MathSciNet  MATH  Google Scholar 

  2. Ambroise, C., Govaert, G.: Convergence of an EM-type algorithm for spatial clustering. Pattern Recognition Letters 19(10), 919–927 (1998)

    Article  Google Scholar 

  3. Topchy, A., Jain, A.K., Punch, W.: Clustering ensembles: Models of consensus and weak partitions. IEEE Transactions on Pattern Aanalysis and Machine Intelligence 27(12), 1866–1881 (2005)

    Article  Google Scholar 

  4. Neal, R., Hinton, G.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan, M. (ed.) Learning in Graphical Models, pp. 355–368. Kluwer Academic Publishers, Dordrecht (1998)

    Chapter  Google Scholar 

  5. Franti, P., Kivijarvi, J.: Randomised local search algorithm for the clustering problem. Pattern Analysis & Applications 3(4), 358–369 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Celeux, G., Govaert, G.: A classification EM algorithm for clustering and two stochastic versions. Computational Statistics and Data Analysis 14(3), 315–332 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Katsavounidis, I., Kuo, C., Zhang, Z.: A new initialization technique for generalized lloyd iteration. IEEE Signal Processing Letters 1(10), 144–146 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, T., Ouyang, J., Qu, C., Liu, C. (2009). Initialization of the Neighborhood EM Algorithm for Spatial Clustering. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds) Advanced Data Mining and Applications. ADMA 2009. Lecture Notes in Computer Science(), vol 5678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03348-3_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03348-3_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03347-6

  • Online ISBN: 978-3-642-03348-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics