PINE: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions
- 23 February 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 44 (2) , 770-782
Abstract
Graph node embedding aims at learning a vector representation for all nodes given a graph. It is a central problem in many machine learning tasks (e.g., node classification, recommendation, community detection). The key problem in graph node embedding lies in how to define the dependence to neighbors Existing approaches specify (either explicitly or implicitly) certain dependencies on neighbors, which may lead to loss of subtle but important structural information within the graph and other dependence among neighbors. This intrigues us to ask the question: can we design a model to give the adaptive flexibility of dependencies to each node's neighborhood. In this paper, we propose a novel graph node embedding method (named PINE) via a novel notion of partial permutation invariant set function, to capture any possible dependence. Our method 1) can learn an arbitrary form of the representation function from the neighborhood, without losing any potential dependence structures, and 2) is applicable to both homogeneous and heterogeneous graph embedding, the latter of which is challenged by the diversity of node types. Furthermore, we provide theoretical guarantee for the representation capability of our method for general homogeneous and heterogeneous graphs.Keywords
All Related Versions
This publication has 48 references indexed in Scilit:
- Node Classification in Social Networks2011
- Leveraging social media networks for classificationData Mining and Knowledge Discovery, 2011
- Community detection in graphsPhysics Reports, 2010
- Graph Regularized Transductive Classification on Heterogeneous Information Networks2010
- The link‐prediction problem for social networksJournal of the American Society for Information Science and Technology, 2007
- Graph evolutionACM Transactions on Knowledge Discovery From Data, 2007
- Approximation capabilities of multilayer feedforward networksNeural Networks, 1991
- Approximation by superpositions of a sigmoidal functionMathematics of Control, Signals, and Systems, 1989
- The Generalized Weierstrass Approximation TheoremMathematics Magazine, 1948
- Applications of the Theory of Boolean Rings to General TopologyTransactions of the American Mathematical Society, 1937