- medoid
-
A mathematically representative object in a set of objects; it has the smallest average dissimilarity to all other objects in the set
Wikipedia foundation.
medoid
Look at other dictionaries:
Medoid — Medoids are representative objects of a data set or a cluster with a data set whose average dissimilarity to all the objects in the cluster is minimal [1] . Medoids are similar in concept to means or centroids, but medoids are always members of… … Wikipedia
K-medoids — The K medoids algorithm is a clustering algorithm related to the K means algorithm and the medoidshift algorithm. Both the K means and K medoids algorithms are partitional (breaking the dataset up into groups) and both attempt to minimize squared … Wikipedia
Clustering high-dimensional data — is the cluster analysis of data with anywhere from a few dozen to many thousands of dimensions. Such high dimensional data spaces are often encountered in areas such as medicine, where DNA microarray technology can produce a large number of… … Wikipedia
Median — This article is about the statistical concept. For other uses, see Median (disambiguation). In probability theory and statistics, a median is described as the numerical value separating the higher half of a sample, a population, or a probability… … Wikipedia
Shape context — is the term given by Serge Belongie and Jitendra Malik to the feature descriptor they first proposed in their paper Matching with Shape Contexts in 2000cite conference author = S. Belongie and J. Malik title = Matching with Shape Contexts url =… … Wikipedia
k-means clustering — In statistics and data mining, k means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results into a partitioning of… … Wikipedia
Hierarchische Clusteranalyse — Als Hierarchische Clusteranalyse bezeichnet man eine bestimmte Familie von distanzbasierten Verfahren zur Clusteranalyse (Strukturentdeckung in Datenbeständen). Cluster bestehen hierbei aus Objekten, die zueinander eine geringere Distanz (oder… … Deutsch Wikipedia
Silhouettenkoeffizient — Die Silhouette gibt für eine Beobachtung an, wie gut die Zuordnung zu den beiden nächstgelegenen Clustern ist. Der Silhouettenkoeffizient gibt ein von der Cluster Anzahl unabhängige Maßzahl für die Qualität eines Clusterings an. Der… … Deutsch Wikipedia
