Skip to main content
SpringerLink
Log in

Clustering of one-dimensional ordered data

Algorithmus. Klassifizierung eindimensionaler geordneter Daten

  • Algorithm
  • Published:
Computing Aims and scope Submit manuscript

Abstract

A set ofn ordered real numbers is partitioned by complete enumeration intok clusters such that the sum of the sum of squared deviations from the mean-value within each cluster is minimized.

Zusammenfassung

Eine Menge vonn geordneten reellen Zahlen wird mittels vollständiger Enumeration ink Teilmengen (Cluster) derart zerlegt, daß die Summe der Summe der Abweichungsquadrate vom Mittelwert innerhalb jeder Teilmenge minimiert wird.

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

Author information

Authors and Affiliations

  1. ORG+DV Operations Research, Großversandhaus Quelle, Wandererstraße 159, D-8500, Nürnberg, Bundesrepublik Deutschland

    H. Späth

Authors
  1. H. Späth
    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

Späth, H. Clustering of one-dimensional ordered data. Computing 11, 175–177 (1973). https://doi.org/10.1007/BF02252907

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation