**A Family of Tractable Graph Distances**
Stratis Ioannidis

*04 July 2018, 10h30*
Salle/Bat : 465/PCRI-N

Contact :

**Activités de recherche : **Gestion de données du Web

**Résumé :**
Important data mining problems such as nearest-neighbour search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquitous, and clustering and classification over graphs arise in diverse areas, including, e.g., image processing and social networks. Unfortunately, popular distance scores used in these applications that scale over large graphs are not metrics and thus come with no guarantees. Classic graph distances such as, e.g., the chemical distance and the Chartrand-Kubiki-Shultz (CKS) distance are arguably natural and intuitive, and are indeed metrics; however, these distances are intractable and their computation does not scale to large graphs. We define a broad family of graph distances, that includes both the chemical and the CKS distance, and prove that these are all metrics. Crucially, we show that our family includes metrics that are tractable. Moreover, we extend these distances by incorporating auxiliary node attributes, which is important in practice, while maintaining both the metric property and tractability.

*Pour en savoir plus : *