Skip to main content
Log in

Unsupervised and semi-supervised clustering by message passing: soft-constraint affinity propagation

  • Interdisciplinary Physics
  • Published:
The European Physical Journal B Aims and scope Submit manuscript

Abstract

Soft-constraint affinity propagation (SCAP) is a new statistical-physics based clustering technique [M. Leone, Sumedha, M. Weigt, Bioinformatics 23, 2708 (2007)]. First we give the derivation of a simplified version of the algorithm and discuss possibilities of time- and memory-efficient implementations. Later we give a detailed analysis of the performance of SCAP on artificial data, showing that the algorithm efficiently unveils clustered and hierarchical data structures. We generalize the algorithm to the problem of semi-supervised clustering, where data are already partially labeled, and clustering assigns labels to previously unlabeled points. SCAP uses both the geometrical organization of the data and the available labels assigned to few points in a computationally efficient way, as is shown on artificial and biological benchmark data.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • A.K. Jain, M.N. Murthy, P.J. Flynn, ACM Computing Surveys 31, 264 (1999)

    Google Scholar 

  • R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification, 2nd edn. (Wiley-Interscience, 2000)

  • Semi-Supervised Learning edited by O. Chapelle, B. Schölkopf, A. Zien (MIT Press, Cambridge MA, 2006)

  • G. Getz, N. Sehntal and E.Domany, Proceedings of “Learning with Partially Classified Training Data” ICML 2005, p. 37

  • R.R. Sokal, C.D. Michener, University of Kansas Scientific Bulletin (1958)

  • S.C. Johnson, Psychometrika 2, 241 (1967)

  • J. McQueen, in Proc. 5th Berkeley Symp. on Math. Stat. and Prob., edited by L. Le Cam, J. Neyman (Uni. of California Press, 1967)

  • M. Blatt, S. Wiseman, E. Domany, Phys. Rev. Lett. 76, 3251 (1996)

    Google Scholar 

  • B.J. Frey, D. Dueck, Science 315, 972 (2007)

    Google Scholar 

  • J.S. Yedidia, W.F. Freeman, Y. Weiss, IEEE Trans. Inform. Theory 47, 1 (2005)

    Google Scholar 

  • F.R. Kschischang, B.J. Frey, H.A. Loeliger, IEEE Trans. Inform. Theory 47, 1 (2001)

    Google Scholar 

  • M. Mézard, G. Parisi, Eur. Phys. J. B 20, 217 (2001)

    Google Scholar 

  • A.K. Hartmann, M. Weigt, Phase Transitions in Combinatorial Optimization Problems (Wiley-VCH, Berlin, 2005)

  • M. Leone, Sumedha, M. Weigt, Bioinformatics 23, 2708 (2007)

    Google Scholar 

  • R.O. Duda, P.E. Hart, Classification and Scene Analysis (Wiley, New York, 1973)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Weigt.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sumedha, M., Weigt, M. Unsupervised and semi-supervised clustering by message passing: soft-constraint affinity propagation. Eur. Phys. J. B 66, 125–135 (2008). https://doi.org/10.1140/epjb/e2008-00381-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1140/epjb/e2008-00381-8

PACS

Navigation