Relative Hausdorff distance for network analysis

Abstract Similarity measures are used extensively in machine learning and data science algorithms. The newly proposed graph Relative Hausdorff (RH) distance is a lightweight yet nuanced similarity measure for quantifying the closeness of two graphs. In this work we study the effectiveness of RH dist...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sinan G. Aksoy, Kathleen E. Nowak, Emilie Purvine, Stephen J. Young
Format: Artigo
Sprache:Inglês
Veröffentlicht: SpringerOpen 2019-10-01
Schriftenreihe:Applied Network Science
Schlagworte:
Relative Hausdorff distance
Graph similarity measure
Cyber anomaly detection
Temporal graphs
Online Zugang:http://link.springer.com/article/10.1007/s41109-019-0198-0
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

Ähnliche Einträge