Group-Based Dependence-Free Clustering
Dependence-free clustering of data structures with affine dependences can be
regarded as a non-rectangular generalization of alignment. Because affine
dependences (in their infinite extension) are unions of finitely many cosets
of subgroups of Z to the power of n, we use group-theoretic techniques to
perform the clustering. All the computations can be done efficiently on basis
of the Hermite normal form.
Further info and related paper(s):