Judith Hermanns
Skip Abstract Section
Abstract
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Some solutions assume that auxiliary information on known matches or node or edge attributes is available, or utilize arbitrary graph features. Such methods fare poorly in the pure form of the problem, in which only graph structures are given. Other proposals translate the problem to one of aligning node embeddings, yet, by doing so, provide only a single-scale view of the graph.
In this article, we transfer the shape-analysis concept of functional maps from the continuous to the discrete case, and treat the graph alignment problem as a special case of the problem of finding a mapping between functions on graphs. We present GRASP, a method that first establishes a correspondence between functions derived from Laplacian matrix eigenvectors, which capture multiscale structural characteristics, and then exploits this correspondence to align nodes. We enhance the basic form of GRASP by altering two of its components, namely the embedding method and the assignment procedure it employs, leveraging its modular, hence adaptable design. Our experimental study, featuring noise levels higher than anything used in previous studies, shows that the enhanced form of GRASP outperforms scalable state-of-the-art methods for graph alignment across noise levels and graph types, and performs competitively with respect to the best non-scalable ones. We include in our study another modular graph alignment algorithm, CONE, which is also adaptable thanks to its modular nature, and show it can manage graphs with skewed power-law degree distributions.
- [1] . 1998. Parallel Algorithms for Labeled Graph Matching. Ph.D. Dissertation. Colorado School of Mines.Google Scholar
Digital Library
- [2] . 2007. Trust-region methods on Riemannian manifolds. Foundations of Computational Mathematics 7, 3 (2007), 303–330.Google ScholarCross Ref
- [3] . 2013. SPINAL: Scalable protein interaction network alignment. Bioinformatics 29, 7 (2013), 917–924.Google ScholarDigital Library
- [4] . 2013. Message-passing algorithms for sparse network alignment. Transactions on Knowledge Discovery from Data 7, 1 (2013), 3:1–3:31.Google Scholar
- [5] . 2006. Convergence of Laplacian eigenmaps. In Proceedings of the 19th International Conference on Neural Information Processing Systems. 129–136.Google ScholarDigital Library
- [6] . 1992. A method for registration of 3-D shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence 14, 2 (1992), 239–256.Google ScholarDigital Library
- [7] . 2020. CONE-align: Consistent network alignment with proximity-preserving node embedding. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 1985–1988.Google ScholarDigital Library
- [8] . 2019. Cross-network embedding for multi-network alignment. In Proceedings of the World Wide Web Conference. 273–284.Google ScholarDigital Library
- [9] . 1997. Spectral Graph Theory. Vol. 92. American Mathematical Soc.Google Scholar
- [10] . 2018. Approximating the spectrum of a graph. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1263–1271.Google ScholarDigital Library
- [11] . 2015. Spatial analyses of wildlife contact networks. Journal of the Royal Society Interface 12, 102 (2015). .Google ScholarCross Ref
- [12] . 2021. Deep adversarial network alignment. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 352–361.Google ScholarDigital Library
- [13] . 2015. \(k\)-anonymization by freeform generalization. In Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security. 519–530.Google ScholarDigital Library
- [14] . 2020. Spectral graph matching and regularized quadratic relaxations: Algorithm and theory. In Proceedings of the 37th International Conference on Machine Learning. 2985–2995.Google ScholarDigital Library
- [15] . 2020. Spectral alignment of graphs. IEEE Transactions on Network Science and Engineering 7, 3 (2020), 1182–1197.Google ScholarCross Ref
- [16] . 2014. Contact patterns among high school students. PloS One 9, 9 (2014), e107878.Google ScholarCross Ref
- [17] . 1990. Riemannian Geometry. Springer.Google ScholarCross Ref
- [18] . 2021. Unsupervised graph alignment with Wasserstein distance discriminator. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 426–435.Google ScholarDigital Library
- [19] . 2020. Graph representation learning. Synthesis Lectures on Artifical Intelligence and Machine Learning 14, 3 (2020), 1–159.Google ScholarCross Ref
- [20] . 2018. REGAL: Representation learning-based graph alignment. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 117–126.Google ScholarDigital Library
- [21] . 2021. GRASP: Graph alignment through spectral signatures. In Proceedings of the Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data.Google ScholarDigital Library
- [22] . 1987. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38, 4 (1987), 325–340.Google ScholarDigital Library
- [23] . 2021. Joint graph embedding and alignment with spectral pivot. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 851–859.Google ScholarDigital Library
- [24] . 2008. Hierarchical synopses with optimal error guarantees. ACM Transactions on Database Systems 33, 3 (2008), 18:1–18:53.Google ScholarDigital Library
- [25] . 2015. Growing a graph matching from a handful of seeds. Proceedings of the VLDB Endowment 8, 10 (2015), 1010–1021.Google ScholarDigital Library
- [26] . 2009. A new graph-based method for pairwise global network alignment. BMC Bioinformatics 10, S-1 (2009). .Google ScholarCross Ref
- [27] . 2009. Inexact matching of large and sparse graphs using Laplacian eigenvectors. In Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition. Vol. 5534, Springer, 144–153.Google ScholarDigital Library
- [28] . 2012. The Graph Isomorphism Problem: Its Structural Complexity. Springer Science & Business Media.Google Scholar
- [29] . 2013. A fast approach to global alignment of protein-protein interaction networks. BMC Research Notes 6, 1 (2013), 35.Google ScholarCross Ref
- [30] . 2016. Faster spectral sparsification and numerical algorithms for SDD matrices. ACM Transactions on Algorithms 12, 2 (2016), 17:1–17:16.Google ScholarDigital Library
- [31] . 2013. BIG-ALIGN: Fast bipartite graph alignment. In Proceedings of the 2013 IEEE 13th International Conference on Data Mining. 389–398.Google ScholarCross Ref
- [32] . 2013. Coupled quasi-harmonic bases. Computer Graphics Forum 32, 2 (2013), 439–448.Google ScholarCross Ref
- [33] . 2013. KONECT – The Koblenz network collection. In Proceedings of the 22nd International Conference on World Wide Web. 1343–1350.Google ScholarDigital Library
- [34] . 2021. Boosting graph alignment algorithms. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 3166–3170.Google ScholarDigital Library
- [35] . 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved 06 October 2022 from http://snap.stanford.edu/data.Google Scholar
- [36] . 2009. IsoRankN: Spectral methods for global alignment of multiple protein networks. Bioinformatics 25, 12 (2009), i253–i258.Google ScholarDigital Library
- [37] . 2017. Fully spectral partial shape matching. Computer Graphics Forum 36, 2 (2017), 247–258.Google ScholarDigital Library
- [38] . 2016. Aligning users across social networks using network embedding. In Proceedings of the 25th International Joint Conference on Artificial Intelligence. 1774–1780.Google ScholarDigital Library
- [39] . 2017. Active network alignment: A matching-based approach. In Proceedings of the 2017 ACM International Conference on Information and Knowledge Management. 1687–1696.Google ScholarDigital Library
- [40] . 2016. Predict anchor links across social networks via an embedding approach. In Proceedings of the 25th International Joint Conference on Artificial Intelligence. IJCAI/AAAI Press, 1823–1829.Google ScholarDigital Library
- [41] . 2018. Low rank spectral network alignment. In Proceedings of the 2018 World Wide Web Conference. 619–628.Google ScholarDigital Library
- [42] . 2003. The structure and function of complex networks. SIAM Review 45, 2 (2003), 167–256.Google ScholarDigital Library
- [43] . 2005. Power laws, pareto distributions and Zipf’s law. Contemporary Physics 46, 5 (2005), 323–351.Google ScholarCross Ref
- [44] . 2014. \(L\)-opacity: Linkage-aware graph anonymization. In Proceedings of the 17th International Conference on Extending Database Technology. 583–594.Google Scholar
- [45] . 2012. Functional maps: A flexible representation of maps between shapes. ACM Transactions on Graphics 31, 4 (2012), 30:1–30:11.Google ScholarDigital Library
- [46] . 1999. The PageRank Citation Ranking: Bringing Order to the Web.
Technical Report . Stanford InfoLab.Google Scholar - [47] . 2014. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 701–710.Google ScholarDigital Library
- [48] . 2018. Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec. In Proceedings of the 11th ACM International Conference on Web Search and Data Mining. 459–467.Google ScholarDigital Library
- [49] . 2017. struc2vec: Learning node representations from structural identity. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 385–394.Google ScholarDigital Library
- [50] . 1928. Flowers and Insects: Lists of Visitors to Four Hundred and Fifty-Three Flowers. n.p., Carlinville, Ill.Google Scholar
- [51] . 2019. Personalized knowledge graph summarization: From the cloud to your pocket. In Proceedings of the 2019 IEEE International Conference on Data Mining. 528–537.Google ScholarCross Ref
- [52] . 1966. A generalized solution of the orthogonal procrustes problem. Psychometrika 31, 1 (1966), 1–10.Google ScholarCross Ref
- [53] . 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 8 (2000), 888–905.Google ScholarDigital Library
- [54] . 2008. Global alignment of multiple protein interaction networks with application to functional orthology detection. Proceedings of the National Academy of Sciences of the United States of America 105, 35 (2008), 12763–12768.Google ScholarCross Ref
- [55] . 2018. NetLSD: Hearing the shape of a graph. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2347–2356.Google ScholarDigital Library
- [56] . 2018. VERSE: Versatile graph embeddings from similarity measures. In Proceedings of the 2018 World Wide Web Conference. 539–548.Google ScholarDigital Library
- [57] . 2021. FREDE: Anytime graph embeddings. Proceedings of the VLDB Endowment 14, 6 (2021), 1102–1110.Google ScholarDigital Library
- [58] . 1988. An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence 10, 5 (1988), 695–703.Google ScholarDigital Library
- [59] . 2018. Multiple network alignment via MultiMAGNA++. IEEE/ACM Transactions on Computational Biology and Bioinformatics 15, 5 (2018), 1669–1682.Google ScholarDigital Library
- [60] . 2021. Contrastive multi-view multiplex network embedding with applications to robust network alignment. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 1913–1923.Google ScholarDigital Library
- [61] . 2019. Scalable Gromov-Wasserstein learning for graph partitioning and matching. In Proceedings of the 33rd International Conference on Neural Information Processing Systems. 3046–3056.Google Scholar
- [62] . 2019. Gromov-Wasserstein learning for graph matching and node embedding. In Proceedings of the International Conference on Machine Learning. 6932–6941.Google Scholar
- [63] . 2012. Delineating social network data anonymization via random edge perturbation. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management. 475–484.Google ScholarDigital Library
- [64] . 2021. BRIGHT: A Bridging algorithm for network alignment. In Proceedings of the Web Conference. 3907–3917.Google ScholarDigital Library
- [65] . 2013. On the performance of percolation graph matching. In Proceedings of the 1st ACM Conference on Online Social Networks. 119–130.Google ScholarDigital Library
- [66] . 2018. An iterative global structure-assisted labeled network aligner. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2614–2623.Google ScholarDigital Library
- [67] . 2016. FINAL: Fast attributed network alignment. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1345–1354.Google ScholarDigital Library
- [68] . 2021. Balancing consistency and disparity in network alignment. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 2212–2222.Google ScholarDigital Library
- [69] . 2018. Deeplink: A deep learning approach for user identity linkage. In Proceedings of the IEEE Conference on Computer Communications. 1313–1321.Google ScholarDigital Library
- [70] . 2021. Attent: Active attributed network alignment. In Proceedings of the Web Conference. 3896–3906.Google ScholarDigital Library
- [71] . 2021. Robust network alignment via attack signal scaling and adversarial perturbation elimination. In Proceedings of the Web Conference. 3884–3895.Google ScholarDigital Library
Index Terms
- GRASP: Scalable Graph Alignment by Spectral Corresponding Functions
Recommendations
Boosting Graph Alignment Algorithms
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge ManagementThe problem of graph alignment is to find corresponding nodes between a pair of graphs. Past work has treated the problem in a monolithic fashion, with the graph as input and the alignment as output, offering limited opportunities to adapt the algorithm ...
An Iterative Global Structure-Assisted Labeled Network Aligner
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningIntegrating data from heterogeneous sources is often modeled as merging graphs. Given two or more "compatible'', but not-isomorphic graphs, the first step is to identify a graph alignment, where a potentially partial mapping of vertices between two ...
GRASP: Graph Alignment Through Spectral Signatures
Web and Big DataAbstractWhat is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Existing solutions either require auxiliary information ...
Comments