Distinguishing and Classifying from n-ary Properties

Pascal Préa (1, 2) , Monique Rolbert (3)

1 LIS - Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)
2 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle
3 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

We present a hierarchical classification based on n-ary relations of the entities. Starting from the finest partition that can be obtained from the attributes, we distinguish between entities having the same attributes by using relations between entities. The classification that we get is thus a refinement of this finest partition. It can be computed in O(n + m 2) space and O(n · p · m 5/2) time, where n is the number of entities, p the number of classes of the resulting hierarchy (p is the size of the output; p < 2n) and m the maximum number of relations an entity can have (usually, m n). So we can treat sets with millions of entities.

Mots clés: Classification; Data Analysis; Hierarchy; Ultrametric; Computa- tional Linguistics; Generation of Referring Expressions

Domaines: Combinatoire [math.CO]; Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]

Pascal Préa, Monique Rolbert. Distinguishing and Classifying from n-ary Properties. Journal of Classification, 2014, 31 (1), pp.28-48. ⟨10.1007/s00357-014-9151-1⟩. ⟨hal-02435796⟩