Skip to main content
SpringerLink
Log in

AENEA: A novel autoencoder-based network embedding algorithm

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Network embedding aims to represent vertices in the network with low-dimensional dense real number vectors, so that the attained vertices can acquire the ability of representation and inference in vector space. With the expansion of the scale of complex networks, how to make the high-dimensional network represented in low-dimensional vector space through network becomes an important issue. The typical algorithms of current autoencoder-based network embedding methods include DNGR and SDNE. DNGR method trains the Positive Pointwise Mutual Information (PPMI) matrix with the Stacked Denosing Autoencoder (SDAE), which is lacking in depth thereby attaining less satisfactory representation of network. Besides, SDNE used a semi-supervised autoencoder for embedding the adjacency matrix, whose sparsity may generate more cost in the learning process. In order to solve these problems, we propose a novel Autoencoder-based Network Embedding Algorithm (AENEA). AENEA is mainly divided into three steps. First, the random surfing model is used to process the original network to obtain the Probabilistic Co-occurrence (PCO) matrix between the nodes. Secondly, the Probabilistic Co-occurrence (PCO) matrix is processed to generate the corresponding Positive Pointwise Mutual Information (PPMI) matrix. Finally, the PPMI matrix is used to learn the representation of vertices in the network by using a semi-supervised autoencoder. We implemented a series of experiments to test the performance of AENEA, DNGR, SDNE and so on, on the standardized datasets 20-NewsGroup and Wine. The experimental results show that the performance of AENEA is obviously superior to the existing algorithms in clustering, classification and visualization tasks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Daokun Z, Jie Y, Xingquan Z, Chengqi Z (2020) Network representation learning: a survey. IEEE Trans Big Data 6(1):3–28

    Article  Google Scholar 

  2. Tang J, Liu J, Zhang M, Mei Q (2016) Visualizing large-scale and high-dimensional data. In: Proceedings of the 25th international conference on world wide web, pp. 287–297. https://doi.org/10.1145/2872427.2883041

  3. Gao H, Huang W, Duan Y (2020) The cloud-edge based dynamic reconfiguration to service work ow for mobile ecommerce environments: a QoS prediction perspective. ACM Trans Internet Technol. https://doi.org/10.1145/3391198

  4. Ma G, He L, Lu CT, Shao W, Yu PS, Leow AD, Ragin AB (2017) Multi-view clustering with graph embedding for connectome analysis. In: Proceedings of the 2017 ACM Conference on Information and Knowledge Management, pp. 127–136. https://doi.org/10.1145/3132847.3132909

  5. Li J, Zhu J, Zhang B (2016) Discriminative deep random walk for network classification. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, pp. 1004–1013. https://www.aclweb.org/anthology/P16-1095

  6. Gao H, Kuang L, Yin Y, Guo B, Dou K (2020) Mining consuming behaviors with temporal evolution for personalized recommendation in mobile marketing apps. Mob Netw Appl 25(4):1233–1248

    Article  Google Scholar 

  7. Li H, Wang H, Yang Z, Odagaki M (2017) Variation autoencoder based network representation learning for classication. In: Proceedings of ACL 2017 Student Research Workshop, pp. 56–61. https://www.aclweb.org/anthology/P17-3010

  8. Wang H, Zhang F, Hou M, Xie X, Guo M, Liu Q (2018) Shine: Signed heterogeneous information network embedding for sentiment link prediction. In: Proceedings of the 11th ACM International Conference on Web Search and Data Mining, pp. 592–600. https://doi.org/10.1145/3159652.3159666

  9. Ma X, Gao H, Xu H, Bian M (2019) An iot-based task scheduling optimization scheme considering the deadline and cost-aware scientific workflow for cloud computing. EURASIP J Wirel Commun Netw 2019(1):249

    Article  Google Scholar 

  10. Chen H, Yin H, Wang W, Wang H, Nguyen QVH, Li X (2018) Pme: projected metric embedding on heterogeneous networks for link prediction. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1177–1186. https://doi.org/10.1145/3219819.3219986

  11. Xu L, Wei X, Cao J, Yu PS (2018) On exploring semantic meanings of links for embedding social networks. In: Proceedings of the 2018 World Wide Web Conference, pp. 479–488. https://doi.org/10.1145/3178876.3186114

  12. Wei JN, Duvenaud D, Aspuru-Guzik A (2016) Neural networks for the prediction of organic chemistry reactions. ACS Central Sci 2(10):725–732

    Article  Google Scholar 

  13. Ying R, He R, Chen K, Eksombatchai P, Hamilton WL, Leskovec J (2018) Graph convolutional neural networks for web-scale recommender systems. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 974–983. https://doi.org/10.1145/3219819.3219890

  14. Yang X, Zhou S, Cao M (2019) An approach to alleviate the sparsity problem of hybrid collaborative filtering based recommendations: The product-attribute perspective from user reviews. Mob Netw Appl 1–15. https://doi.org/10.1007/s11036-019-01246-2

  15. Tu C, Zeng X, Wang H, Zhang Z, Liu Z, Sun M, Zhang B, Lin L (2018) A unified framework for community detection and network representation learning. IEEE Trans Knowl Data Eng 31(6):1051–1065

    Article  Google Scholar 

  16. Gao H, Qin X, Barroso RJD, Hussain W, Xu Y, Yin Y (2020) Collaborative learning-based industrial IoT API recommendation for software-defined devices: The implicit knowledge discovery perspective. IEEE Transactions on Emerging Topics in Computational Intelligence, pp. 1–11. https://doi.org/10.1109/TETCI.2020.3023155

  17. Gao H, Liu C, Li Y, Yang X (2020) V2VR: Reliable hybrid-network-oriented V2V data transmission and routing considering RSUs and connectivity probability. IEEE Transactions on Intelligent Transportation Systems pp. 1–14. https://doi.org/10.1109/TITS.2020.2983835

  18. Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326

    Article  Google Scholar 

  19. Belkin M, Niyogi P (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. Adv Neural Inf Proces Syst 14:585–591

    Google Scholar 

  20. Ahmed A, Shervashidze N, Narayanamurthy S, Josifovski V, Smola AJ (2013) Distributed large-scale natural graph factorization. In: Proceedings of the 22nd international conference on World Wide Web, pp. 37–48. https://doi.org/10.1145/2488388.2488393

  21. Cao S, Lu W, Xu Q (2015) Grarep: Learning graph representations with global structural information. In: Proceedings of the 24th ACM international on conference on information and knowledge management, pp. 891–900. https://doi.org/10.1145/2806416.2806512

  22. Ou M, Cui P, Pei J, Zhang Z, Zhu W (2016) Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1105–1114. https://doi.org/10.1145/2939672.2939751

  23. Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 701–710. https://doi.org/10.1145/2623330.2623732

  24. Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp. 855–864. https://doi.org/10.1145/2939672.2939754

  25. Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1225–1234. https://doi.org/10.1145/2939672.2939753

  26. Cao S, Lu W, Xu Q (2016) Deep neural networks for learning graph representations. In: Proceedings of the 30th AAAI conference on artificial intelligence, pp. 1145–1152. https://doi.org/10.5555/3015812.3015982

  27. Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907. https://doi.org/10.5555/3015812.3015982

  28. Chen J, Ma T, Xiao C (2018) Fastgcn: fast learning with graph convolutional networks via importance sampling. In: International Conference on Learning Representations. https://openreview.net/forum?id=rytstxWAW&noteId=rytstxWAW

  29. Church K, Hanks P (1990) Word association norms, mutual information, and lexicography. Comput Linguist 16(1):22–29

    Google Scholar 

  30. Bullinaria JA, Levy JP (2007) Extracting semantic representations from word co-occurrence statistics: a computational study. Behav Res Methods 39(3):510–526

    Article  Google Scholar 

  31. Levy O, Goldberg Y (2014) Neural word embedding as implicit matrix factorization. In: Advances in neural information processing systems, pp. 2177–2185. https://doi.org/10.5555/2969033.2969070

  32. Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: Large-scale information network embedding. In: Proceedings of the 24th international conference on world wide web, pp. 1067–1077. https://doi.org/10.1145/2736277.2741093

  33. Asuncion A, Newman D (2007) UCI machine learning repository. http://ci.nii.ac.jp/naid/20001247967

  34. Strehl A, Ghosh J (2002) Cluster ensembles|a knowledgereuse framework for combining multiple partitions. J Mach Learn Res 3(12):583–617

    MATH  Google Scholar 

  35. Arthur D, Vassilvitskii S (2007) k-means++: The advantages of careful seeding. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027–1035. https://doi.org/10.5555/1283383.1283494

  36. Maaten Lvd, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9:2579–2605

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu, China

    Xiaolong Xu

  2. Jiangsu Key Laboratory of Big Data Security & Intelligent Processing, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu, China

    Haoyan Xu & Yang Wang

  3. Faculty of Business Information, Shanghai Business School, Shanghai, China

    Jing Zhang

Authors
  1. Xiaolong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haoyan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jing Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jing Zhang.

Additional information

This article is part of the Topical Collection: Special Issue on P2P Computing for Deep Learning

Guest Editors: Ying Li, R.K. Shyamasundar, Yuyu Yin, Mohammad S. Obaidat

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, X., Xu, H., Wang, Y. et al. AENEA: A novel autoencoder-based network embedding algorithm. Peer-to-Peer Netw. Appl. 14, 1829–1840 (2021). https://doi.org/10.1007/s12083-020-01043-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-020-01043-9

Keywords

Search

Navigation