Skip to main content

An Artificial Life Approach for Semi-supervised Learning

  • Conference paper

Abstract

An approach for the integration of supervising information into unsupervised clustering is presented (semi supervised learning). The underlying unsupervised clustering algorithm is based on swarm technologies from the field of Artificial Life systems. Its basic elements are autonomous agents called Databots. Their unsupervised movement patterns correspond to structural features of a high dimensional data set. Supervising information can be easily incorporated in such a system through the implementation of special movement strategies. These strategies realize given constraints or cluster information. The system has been tested on fundamental clustering problems. It outperforms constrained k-means.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BELKIN, M., SINDHWANI, V., NIYOGI, P. (2006): The Geometric Basis of Semi-Supervised Learning. In: O. Chapelle, B. Scholkopf, and A. Zien (Eds.): Semi-Supervised Learning. MIT Press, 35-54.

    Google Scholar 

  • BILENKO, M., BASU, S., MOONEY, R.J. (2004): Integrating Constraints and Metric Learn-ing in Semi-Supervised Clustering. In: Proc. 21st International Conference on Machine Learning (ICML 2004). Banff, Canada, 81-88.

    Google Scholar 

  • KOHONEN, T. (1982): Self-organized formation of topologically correct feature maps. In: Biological Cybernetics (43). 59-69.

    Article  MATH  Google Scholar 

  • RAMOS, V., ABRAHAM, A. (2003): Swarms on Continuous Data. In: Proc. Congress on Evolutionary Computation. IEEE Press, Australia, 1370-1375.

    Chapter  Google Scholar 

  • ULTSCH, A. (2000): Visualization and Classification with Artificial Life. In: Proceedings Conf. Int. Fed. of Classification Societies (ifcs). Namur, Belgium.

    Google Scholar 

  • ULTSCH, A. (2003): Maps for the Visualization of high-dimensional Data Spaces. In: Pro-ceedings Workshop on Self-Organizing Maps (WSOM 2003). Kyushu, Japan, 225-230.

    Google Scholar 

  • ULTSCH, A., HERRMANN, L. (2006): Automatic Clustering with U*C. Technical Report, Dept. of Mathematics and Computer Science, University of Marburg.

    Google Scholar 

  • ULTSCH, A. (2007): Emergence in Self-Organizing Feature Maps. In: Proc. Workshop on Self-Organizing Maps (WSOM 2007). Bielefeld, Germany, to appear.

    Google Scholar 

  • WAGSTAFF, K., CARDIE, C., ROGERS, S., SCHROEDL, S. (2001): Constrained K-means Clustering with Background Knowledge. In: Proc. 18th International Conf. on Machine Learning. Morgan Kaufmann, San Francisco, CA, 577-584.

    Google Scholar 

  • ZHU, X. (2006): Semi-Supervised Learning Literature Survey. Computer Sciences TR 1530. University of Wisconsin, Madison.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herrmann, L., Ultsch, A. (2008). An Artificial Life Approach for Semi-supervised Learning. In: Preisach, C., Burkhardt, H., Schmidt-Thieme, L., Decker, R. (eds) Data Analysis, Machine Learning and Applications. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78246-9_17

Download citation

Publish with us

Policies and ethics