Skip to main content
SpringerLink
Log in

Choosing ther-dimension for the FCV family of clustering algorithms

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A strategy is given for selecting the dimensionr of the linear variety which is used to define the criterion functionalJ vrm and which determines the shape of the data clusters detected by the correspondingc-Varieties (FCV) clustering algorithms.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Bezdek, R. Gunderson, et al.,Detection and characterization of cluster substructure, SIAM J. on Applied Mathematics, Vol. 40, No. 2, April 1981.

  2. F. R. Gantmacher,The Theory of Matrices, Vol. I, Chelsea, 1959.

  3. R. O. Duda and P. E. Hart,Pattern classification and scene analysis, Wiley-Interscience, New York, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Oslo, Blindern, Oslo 3, Norge

    Robert W. Gunderson

  2. Department of Mathematics, Utah State University, 84322, Logan, Utah

    Robert W. Gunderson

Authors
  1. Robert W. Gunderson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gunderson, R.W. Choosing ther-dimension for the FCV family of clustering algorithms. BIT 22, 140–149 (1982). https://doi.org/10.1007/BF01944473

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01944473

Keywords

Search

Navigation