Sylvester Tensor Equation for Multi-Way Association

How can we identify the same or similar users from a collection of social network platforms (e.g., Facebook, Twitter, LinkedIn, etc.)? Which restaurant shall we recommend to a given user at the right time at the right location? Given a disease, which genes and drugs are most relevant? Multi-way association, which identifies strongly correlated node sets from multiple input networks, is the key to answering these questions. Despite its importance, very few multi-way association methods exist due to its high complexity. In this paper, we formulate multi-way association as a convex optimization problem, whose optimal solution can be obtained by a Sylvester tensor equation. Furthermore, we propose two fast algorithms to solve the Sylvester tensor equation, with a linear time and space complexity. We further provide theoretic analysis in terms of the sensitivity of the Sylvester tensor equation solution. Empirical evaluations demonstrate the efficacy of the proposed method.

[1]  Hanghang Tong,et al.  MrMine: Multi-resolution Multi-network Embedding , 2019, CIKM.

[2]  Hanghang Tong,et al.  FASTEN: Fast Sylvester Equation Solver for Graph Mining , 2018, KDD.

[3]  Hanghang Tong,et al.  FINAL: Fast Attributed Network Alignment , 2016, KDD.

[4]  Rui Zhang,et al.  Cross-Network Skip-Gram Embedding for Joint Network Alignment and Link Prediction , 2020, IEEE Transactions on Knowledge and Data Engineering.

[5]  Hanghang Tong,et al.  Replacing the Irreplaceable: Fast Algorithms for Team Member Recommendation , 2014, WWW.

[6]  Mark Heimann,et al.  REGAL: Representation Learning-based Graph Alignment , 2018, CIKM.

[7]  Philip S. Yu,et al.  Multiple Anonymized Social Networks Alignment , 2015, 2015 IEEE International Conference on Data Mining.

[8]  Daniel Kressner,et al.  Krylov Subspace Methods for Linear Systems with Tensor Product Structure , 2010, SIAM J. Matrix Anal. Appl..

[9]  Xavier Bresson,et al.  Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks , 2017, NIPS.

[10]  Philip S. Yu,et al.  COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency , 2015, KDD.

[11]  Junchi Yan,et al.  Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning , 2020, NeurIPS.

[12]  Nitesh V. Chawla,et al.  Neural Tensor Factorization , 2018, WSDM 2019.

[13]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.

[14]  Hanghang Tong,et al.  ADMIRING: Adversarial Multi-network Mining , 2019, 2019 IEEE International Conference on Data Mining (ICDM).

[15]  Jingrui He,et al.  A Local Algorithm for Structure-Preserving Graph Cut , 2017, KDD.

[16]  Jingrui He,et al.  Multi-task Crowdsourcing via an Optimization Framework , 2019, ACM Trans. Knowl. Discov. Data.

[17]  Jingping Bi,et al.  Cross-Network Embedding for Multi-Network Alignment , 2019, WWW.

[18]  Linzhang Lu,et al.  A projection method and Kronecker product preconditioner for solving Sylvester tensor equations , 2012 .

[19]  Philip S. Yu,et al.  Integrated Anchor and Social Link Predictions across Social Networks , 2015, IJCAI.

[20]  Feng Xu,et al.  Dual-Regularized One-Class Collaborative Filtering , 2014, CIKM.

[21]  Yiming Yang,et al.  Cross-Graph Learning of Multi-Relational Associations , 2016, ICML.

[22]  Gang Chen,et al.  Semi-supervised Multi-label Learning by Solving a Sylvester Equation , 2008, SDM.

[23]  Li Liu,et al.  Aligning Users across Social Networks Using Network Embedding , 2016, IJCAI.

[24]  Valeria Simoncini,et al.  Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations , 2009, SIAM J. Numer. Anal..

[25]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[26]  Daniel Kressner,et al.  Recursive blocked algorithms for linear systems with Kronecker product structure , 2019, Numerical Algorithms.

[27]  Lei Xie,et al.  FASCINATE: Fast Cross-Layer Dependency Inference on Multi-layered Networks , 2016, KDD.

[28]  Danai Koutra,et al.  BIG-ALIGN: Fast Bipartite Graph Alignment , 2013, 2013 IEEE 13th International Conference on Data Mining.

[29]  Hanghang Tong,et al.  FIRST: Fast Interactive Attributed Subgraph Matching , 2017, KDD.

[30]  Yanning Zhang,et al.  Tensor Power Iteration for Multi-graph Matching , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[31]  Xiao Liu,et al.  Co-Regularized Deep Multi-Network Embedding , 2018, WWW.

[32]  Marc Plantevit,et al.  Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors , 2013, IEEE Transactions on Knowledge and Data Engineering.

[33]  Meng Xu,et al.  NetAlign: a web-based tool for comparison of protein interaction networks , 2006, Bioinform..

[34]  T. R. Anderson.  DISTRIBUTION STATEMENT A Approved for Public Release Distribution Unlimited , 1999 .

[35]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[36]  Evren Körpeoglu,et al.  PURE: Positive-Unlabeled Recommendation with Generative Adversarial Network , 2021, KDD.

[37]  Fei Wang,et al.  Social recommendation across multiple relational domains , 2012, CIKM.

[38]  Hongyuan Zha,et al.  Multi-Graph Matching via Affinity Optimization with Graduated Consistency Regularization , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[39]  Bonnie Berger,et al.  Global alignment of multiple protein interaction networks with application to functional orthology detection , 2008, Proceedings of the National Academy of Sciences.