Open Peer Review. Open Publishing. Open Access. Open Discussion. Open Directory. Open Recommendations. Open API. Open Source.
Network Embedding using Hierarchical Feature Aggregation
Ujjawal Soni, Mohan Bhambhani, Mitesh M. Khapra
Feb 12, 2018 (modified: Jun 04, 2018)ICLR 2018 Workshop Submissionreaders: everyoneShow Bibtex
Abstract:Graph convolutional networks and its variants are the state-of-the-art methods for learning node embeddings in a graph-structured data. However, these existing approaches fail to capture the neighborhood information efficiently beyond a certain depth from the node. In this work, we propose a novel hierarchical feature aggregation approach which explictly aggregates the feature information from different depths of a node's neighborhood using an LSTM model. Proposed model gives promising results on four real-world datasets as compared to state-of-the-art methods.
Keywords:Graph Learning, Networks, Representation Learning, Deep Learning
Enter your feedback below and we'll get back to you as soon as possible.