Pattern Induction and matching in polyphonic music and other multidimensional datasets


We present a new algorithm, SIA, which discovers maximal repeated patterns in any set of points in Cartesian spaces of any dimensionality. The worst-case running time of SIA is O(kn2 log2 n) for a k-dimensional dataset of size n. SIATEC is an extension of SIA that generates a set of translational equivalence classes (TECs). If the input represents a musical… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics