Associative Clustering (AC): Technical Details

This report contains derivations which did not fit into the paper [3]. Associative clustering (AC) is a method for separately clustering two data sets when one-to-one associations between the sets, implying statistical dependency, are available. AC finds Voronoi partitionings that maximize the visibility of the dependency on the cluster level. The main content of this paper are technical results related to the algorithm: A Bayes factor interpretation of AC, derivation of gradients for optimizing AC with a smoothing trick, and the connection of AC objective to mutual information.

[1]  Samuel Kaski,et al.  Associative Clustering , 2004, ECML.

[2]  Samuel Kaski,et al.  Associative clustering for exploring dependencies between functional genomics data sets , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[3]  Samuel Kaski,et al.  Regularized discriminative clustering , 2003, 2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718).

[4]  I. Good.  On the Application of Symmetric Dirichlet Distributions and their Mixtures to Contingency Tables , 1976 .

[5]  Samuel Kaski,et al.  Discriminative clustering , 2005, Neurocomputing.

[6]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.