cf. C. M. Procopiuc, M. Jones, Pankaj K. Agarwal and T. M. Murali. A monte carlo algorithm for fast projective clustering.

Input Ports

The database the algorithm should work on.

Output Ports

A table containing all subspace clusters and how each dimension is relevant to them.
A table containing an entry for each object-to-cluster relation, so an object that belongs to many clusters will occur multiple times.

Best Friends (Incoming)