%0 Conference Paper %1 tu_deep_2018 %A Tu, Ke %A Cui, Peng %A Wang, Xiao %A Yu, Philip S. %A Zhu, Wenwu %B Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining %C London United Kingdom %D 2018 %I ACM %K imported %P 2357--2366 %R 10.1145/3219819.3220068 %T Deep Recursive Network Embedding with Regular Equivalence %U http://dl.acm.org/doi/10.1145/3219819.3220068 %X Network embedding aims to preserve vertex similarity in an embedding space. Existing approaches usually define the similarity by direct links or common neighborhoods between nodes, i.e. structural equivalence. However, vertexes which reside in different parts of the network may have similar roles or positions, i.e. regular equivalence, which is largely ignored by the literature of network embedding. Regular equivalence is defined in a recursive way that two regularly equivalent vertexes have network neighbors which are also regularly equivalent. Accordingly, we propose a new approach named Deep Recursive Network Embedding (DRNE) to learn network embeddings with regular equivalence. More specifically, we propose a layer normalized LSTM to represent each node by aggregating the representations of their neighborhoods in a recursive way. We theoretically prove that some popular and typical centrality measures which are consistent with regular equivalence are optimal solutions of our model. This is also demonstrated by empirical results that the learned node representations can well predict the indexes of regular equivalence and related centrality scores. Furthermore, the learned node representations can be directly used for end applications like structural role classification in networks, and the experimental results show that our method can consistently outperform centrality-based methods and other state-of-the-art network embedding methods. %@ 978-1-4503-5552-0

@inproceedings{tu_deep_2018, abstract = {Network embedding aims to preserve vertex similarity in an embedding space. Existing approaches usually define the similarity by direct links or common neighborhoods between nodes, i.e. structural equivalence. However, vertexes which reside in different parts of the network may have similar roles or positions, i.e. regular equivalence, which is largely ignored by the literature of network embedding. Regular equivalence is defined in a recursive way that two regularly equivalent vertexes have network neighbors which are also regularly equivalent. Accordingly, we propose a new approach named Deep Recursive Network Embedding (DRNE) to learn network embeddings with regular equivalence. More specifically, we propose a layer normalized LSTM to represent each node by aggregating the representations of their neighborhoods in a recursive way. We theoretically prove that some popular and typical centrality measures which are consistent with regular equivalence are optimal solutions of our model. This is also demonstrated by empirical results that the learned node representations can well predict the indexes of regular equivalence and related centrality scores. Furthermore, the learned node representations can be directly used for end applications like structural role classification in networks, and the experimental results show that our method can consistently outperform centrality-based methods and other state-of-the-art network embedding methods.}, added-at = {2020-02-21T16:09:44.000+0100}, address = {London United Kingdom}, author = {Tu, Ke and Cui, Peng and Wang, Xiao and Yu, Philip S. and Zhu, Wenwu}, biburl = {https://www.bibsonomy.org/bibtex/279fbad85728e8ef0999bdb21a2f4d66b/tschumacher}, booktitle = {Proceedings of the 24th {ACM} {SIGKDD} {International} {Conference} on {Knowledge} {Discovery} \& {Data} {Mining}}, doi = {10.1145/3219819.3220068}, file = {Tu et al - Deep Recursive Network Embedding with Regular Equivalence.pdf:C\:\\Users\\Admin\\Documents\\Research\\_Paperbase\\Graph Embeddings\\Tu et al - Deep Recursive Network Embedding with Regular Equivalence.pdf:application/pdf}, interhash = {263cf3b8711ee16c0483cdb0ee799d72}, intrahash = {79fbad85728e8ef0999bdb21a2f4d66b}, isbn = {978-1-4503-5552-0}, keywords = {imported}, language = {en}, month = jul, pages = {2357--2366}, publisher = {ACM}, timestamp = {2020-02-21T16:09:44.000+0100}, title = {Deep {Recursive} {Network} {Embedding} with {Regular} {Equivalence}}, url = {http://dl.acm.org/doi/10.1145/3219819.3220068}, urldate = {2020-02-02}, year = 2018 }