Chapter

Discovery Science

Volume 4265 of the series Lecture Notes in Computer Science pp 197-208

Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts

  • Jan PolandAffiliated withDivision of Computer Science, Hokkaido University
  • , Thomas ZeugmannAffiliated withDivision of Computer Science, Hokkaido University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clustering algorithms. In contrast, algorithms working with the pairwise distance matrix have been studied rarely for clustering. This is surprising, as in many applications, distances are directly given, and computing similarities involves another step that is error-prone, since the kernel has to be chosen appropriately, albeit computationally cheap. This paper proposes a clustering algorithm based on the SDP relaxation of the max-k-cut of the graph of pairwise distances, based on the work of Frieze and Jerrum. We compare the algorithm with Yu and Shi’s algorithm based on spectral relaxation of a norm-k-cut. Moreover, we propose a simple heuristic for dealing with missing data, i.e., the case where some of the pairwise distances or similarities are not known. We evaluate the algorithms on the task of clustering natural language terms with the Google distance, a semantic distance recently introduced by Cilibrasi and Vitányi, using relative frequency counts from WWW queries and based on the theory of Kolmogorov complexity.