Skip to content
/ PATENet Public

Pairwise Alignment of Time Evolving Networks

Notifications You must be signed in to change notification settings

S-Gur/PATENet

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

PATENet: Pairwise Alignment of Time Evolving Networks

Overview

PATENet finds the best local alignment between two [temporal] sequences of objects (e.g. ordered sequences of networks) based on provided similarity measure between the objects comprising the sequences (e.g. networks), a monotone transform function, and an object-match threshold.

This is a python implementation of PATENet as described in

Gur, S., & Honavar, V. G. (2018, July). PATENet: Pairwise Alignment of Time Evolving Networks. In International Conference on Machine Learning and Data Mining in Pattern Recognition (pp. 85-98). Springer, Cham.

Please cite this paper if you use this code.

This implementation requires python>=3.6.

References

Gur, S., & Honavar, V. G. (2018, July). PATENet: Pairwise Alignment of Time Evolving Networks. In International Conference on Machine Learning and Data Mining in Pattern Recognition (pp. 85-98). Springer, Cham.

About

Pairwise Alignment of Time Evolving Networks

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages