Efficient component-hypertree construction based on hierarchy of partitions - Université de Reims Champagne-Ardenne Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Letters Année : 2020

Efficient component-hypertree construction based on hierarchy of partitions

Résumé

The component-hypertree is a data structure that generalizes the concept of component-tree to multiple (increasing) neighborhoods. However, construction of a component-hypertree is costly because it needs to process a high number of neighbors. In this article, we present some properties used to obtain optimized neighborhoods for component-hypertree computation. Using these properties, we explore a new strategy to obtain neighboring elements based on hierarchy of partitions, leading to a more efficient algorithm with the drawback of a slight loss of precision on the distance of merged nodes.
Fichier principal
Vignette du fichier
Morimitsu PRL 2020.pdf (365.23 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02157050 , version 1 (28-02-2020)

Identifiants

Citer

Alexandre Morimitsu, Nicolas Passat, Wonder Alves, Ronaldo F. Hashimoto. Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recognition Letters, 2020, 135, pp.30-37. ⟨10.1016/j.patrec.2020.02.032⟩. ⟨hal-02157050⟩

Collections

URCA CRESTIC GDMM
72 Consultations
94 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More