Distinguishing and Classifying from n-ary Properties

Abstract : 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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02435796
Contributor : Pascal Préa <>
Submitted on : Monday, January 13, 2020 - 9:27:23 AM
Last modification on : Wednesday, January 15, 2020 - 11:09:33 AM

File

DistClassif.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

32

Files downloads

5