模式识别聚类算法精读.ppt

HIERARCHICAL CLUSTERING ALGORITHMS They produce a hierarchy of (hard) clusterings instead of a single clustering. Applications in: Social sciences Biological taxonomy Modern biology Medicine Archaeology Computer science and engineering Let X={x1,…,xN}, xi=[xi1,…,xil]T. Recall that: In hard clustering each vector belongs exclusively to a single cluster. An m-(hard) clustering of X, ?, is a partition of X into m sets (clusters) C1,…,Cm , so that: By the definition: ?={Cj, j=1,…m} Definition: A clustering ?1 containing k clusters is said to be nested in the clustering ?2 containin