Skip to main content

Cellular Automaton for Super-Paramagnetic Clustering of Data

  • Conference paper
Communication Systems and Information Technology

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 100))

Abstract

Using the basic idea of Super-paramagnetic Clustering (SPC), we propose a cellular automaton approach for data clustering: A data set is regarded as a Potts magnetic system and a short-range interaction is introduced between the neighboring spins. Let the system evolve automatically under the function of the spin-spin interaction and the thermal motion. Finally, at a proper temperature the system will reach the super-paramagnetic phase, in which the spins (data points) will form into a number of ‘magnetic domains’ (data clusters). We apply this method to some data sets with different structures and get satisfactory results.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. Theodoridis, S., Koutroumbas, K.: Pattern Recognition. Publishing House of Electronics Industry, BeiJing (2010)

    Google Scholar 

  2. Blatt, M., Wiseman, S., Domany, E.: Super-paramagnetic Clustering of Data. Physical Review Letters 76, 3251–3254 (1996)

    Article  Google Scholar 

  3. Blatt, M., Wiseman, S., Domany, E.: Data Clustering Using a Model Granular Magnet. Neural Computation 9, 1805–1842 (1997)

    Article  Google Scholar 

  4. Domany, E.: Superparamagnetic Clustering of Data-The Definitive Solution of an Ill-Posed Problem. Physica A 263, 158–169 (1999)

    Article  Google Scholar 

  5. Wang, S., Swendsen, R.H.: Cluster Monte Carlo alg. Physica A 167, 565 (1990)

    Article  MathSciNet  Google Scholar 

  6. Dan Mueller, D.C., Chen, K., et al.: Solving the advection-diffusion equations in biological contexts using the cellular Potts model. Physical Review E 72(4), 1–10 (2005)

    Google Scholar 

  7. Wu, F.Y.: The Potts model. Reviews of Modern Physics 54(1), 235–265 (1982)

    Article  MathSciNet  Google Scholar 

  8. Zhang, B.T., Liu, C.H.: Cluster-approximation mean field theory of a class of cellular automation models. Physical Review E 59(5), 4939–4944 (1999)

    Article  Google Scholar 

  9. Blatt, M., Wiseman, S., Domany, E.: Clustering data through an analogy to the Potts model. In: Touretzky, D.S., Mozer, M.C., Hasselmo, M.E. (eds.) Advances in Neural Information Processing Systems, vol. 8, MIT Press, Cambridge (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Botao, Z., Shuqiang, Z., Zhongqiu, Y. (2011). Cellular Automaton for Super-Paramagnetic Clustering of Data. In: Ma, M. (eds) Communication Systems and Information Technology. Lecture Notes in Electrical Engineering, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21762-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21762-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics