Préa, Pascal; Rolbert, Monique - In: Journal of Classification 31 (2014) 1, pp. 28-48
We present a hierarchical classification based on n-ary relations of the entities. Starting from the finest partition … between entities. The classification that we get is thus a refinement of this finest partition. It can be computed in O(n + m … entity can have (usually, m ≪ n). So we can treat sets with millions of entities. Copyright Classification Society of North …