Pattern analysis: ordinal-invariant pattern-clustering

New algorithms of patterns analysis based on methods of ordinal-fixed and ordinal-invariant pattern clustering are developed. The definition of the proposed methods as well as the evaluation of the computational complexity is given. We provide some examples that demonstrate features of these clustering procedures and explain their operation. We also formulate and prove the theorem on the interconnection of clusters obtained by the use of ordinal-invariant pattern-clustering with complete weighted digraphs. These results allow to apply graph theory for the study of properties of obtained clusters.