Continuous Ordinal Clustering; A Mystery Story - Archive ouverte HAL Accéder directement au contenu
Ouvrages Année : 2004

Continuous Ordinal Clustering; A Mystery Story

Résumé

Cluster analysis may be considered as an aid to decision theory because of its ability to group the various alternatives. There are often errors in the data that lead one to wish to use algorithms that are in some sense continuous or at least robust with respect to these errors. Known characterizations of continuity are order theoretic in nature even for data that has numerical significance. Reasons for this are given and arguments presented for considering an ordinal form of robustness with respect to errors in the input data. The work is preliminary and some open questions are posed.

Domaines

Fichier principal
Vignette du fichier
AN3LAMSADE_215-221.pdf (54.77 Ko) Télécharger le fichier

Dates et versions

hal-00018427 , version 1 (02-02-2006)

Identifiants

  • HAL Id : hal-00018427 , version 1

Citer

Melvin F. Janowitz. Continuous Ordinal Clustering; A Mystery Story. pp.6, 2004. ⟨hal-00018427⟩
44 Consultations
27 Téléchargements

Partager

Gmail Facebook X LinkedIn More