Skip to content
master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 

Graph Matching Tutorial

This repository contains some of code associated with the tutorial presented at the 2019 Open Data Science Conference (ODSC) in Boston.

The slides can be found at http://www.jbento.info/slides/GM_Tutorial_ODSC_2019.pdf

The tutorial covers several methods to compare graphs. Some methods can only compare two graphs. Other methods can compare multiple graphs.

The focus of the tutorial are on methods that result in comparison scores that are a metric, or a generalized metric for n obects, and that align the nodes between the graphs in a meaninful way.

This repository contains small snipets of code that illustrate some of the methods discussed in the tutorial.

Please cite this tutorial using the following references.

@article{safavi2018admmtutorial, title={How should we (correctly) compare n networks?}, note={Open Data Science Conference}, author={Safavi, Sam and Bento, Jos{\’e}}, year={2019} }

@article{safavi2018admmtutorial, title={Graph metric spaces}, note={SDM Tutorials}, author={Bento, Jos{\’e} and Eliassi-Rad, Tina and Ioannidis, Stratis and Torres, Leo}, year={2019} }

@inproceedings{bento2018family, title={A family of tractable graph distances}, author={Bento, Jose and Ioannidis, Stratis}, booktitle={Proceedings of the 2018 SIAM International Conference on Data Mining}, pages={333--341}, year={2018}, organization={SIAM} }

@inproceedings{safavi2019tractable, title={Tractable n-Metrics for Multiple Graphs}, author={Safavi, Sam and Bento, Jose}, booktitle={International Conference on Machine Learning}, pages={5568--5578}, year={2019} }

About

No description, website, or topics provided.

Resources

Releases

No releases published

Packages

No packages published

Languages