Abstract (EN)

Cluster analysis and seriation are basic data mining techniques. We consider here clustering structures that enable us to achieve both a clustering and a seriation, namely the hierarchical, pyramidal, and prepyramidal clustering structures. Cluster collections of these types determine seriations of any data set by providing compatible orders, i.e., total rankings of the whole data set for which the objects within each cluster are consecutive. Moreover, the dissimilarity measures induced from such cluster collections are Robinsonian; in other words, the more distant the objects in a compatible order, the higher the induced dissimilarity value. It results in a one‐to‐one correspondence between weakly indexed pyramids and the class of Robinsonian dissimilarities, which holds still in a general setting where undistinguishable objects can be detected, and, as shown in this paper, extends, to prepyramids, which are not required to contain arbitrary intersections of clusters.