Hyperbolic Representation Learning for Complex Networks

被引:0
|
作者
Wang Q. [1 ]
Jiang H. [1 ]
Yi S.-W. [1 ]
Yang L.-T. [2 ]
Nai H. [1 ]
Nie Q. [1 ]
机构
[1] Electronic Information School, Wuhan University, Wuhan
[2] College of Physical Science and Technology, Central China Normal University, Wuhan
来源
Ruan Jian Xue Bao/Journal of Software | 2021年 / 32卷 / 01期
基金
中国国家自然科学基金;
关键词
Complex networks; Hyperbolic space; Machine learning; Network embedding; Representation learning;
D O I
10.13328/j.cnki.jos.006092
中图分类号
学科分类号
摘要
Complex networks naturally exist in a wide diversity of real-world scenarios. Efficient complex network analysis technology has wide applications, such as community detection, link prediction, etc. However, most complex network analytics methods suffer high computation and space cost dealing with large-scale networks. Network representation learning is one of the most efficient methods to solve this problem. It converts high-dimensional sparse network information into low-dimensional dense real-valued vectors which can be easily exploited by machine learning algorithms. Simultaneously, it facilitates efficient computation for subsequent applications. The traditional network representation embeds the entity objects in the low dimensional Euclidean vector space, but recent work has shown that the appropriate isometric space for embedding complex networks with hierarchical or tree-like structures, power-law degree distributions and high clustering is the negatively curved hyperbolic space. This survey conducts a systematic introduction and review of the literature in hyperbolic representation learning for complex networks. © Copyright 2021, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:93 / 117
页数:24
相关论文
共 82 条
  • [31] Krioukov D, Papadopoulos F, Kitsak M, Vahdat A., Hyperbolic geometry of complex networks, Physical Review E, 82, 3, (2010)
  • [32] Papadopoulos F, Kitsak M, Serrano MA, Boguna M., Popularity versus similarity in growing networks, Nature, 489, 7417, (2012)
  • [33] Sarkar R., Low distortion Delaunay embedding of trees in hyperbolic plane, Proc. of the Int'l Symp. on Graph Drawing, pp. 355-366, (2011)
  • [34] De Sa C, Gu A, Re C, Sala F., Representation tradeoffs for hyperbolic embeddings, Proc. of Machine Learning Research, 80, (2018)
  • [35] Erdos P, Renyi A., On random graphs I, Publicationes Mathematicae Debrecen, 6, pp. 290-297, (1959)
  • [36] Watts DJ, Strogatz SH., Collective dynamics of 'small-world' networks, Nature, 393, 6684, pp. 440-442, (1998)
  • [37] Barabasi AL, Albert R., Emergence of scaling in random networks, Science, 286, 5439, pp. 509-512, (1999)
  • [38] Aldecoa R, Orsini C, Krioukov D., Hyperbolic graph generator, Computer Physics Communications, 196, pp. 492-496, (2015)
  • [39] Garcia-Perez G, Allard A, Serrano M, Boguna M., Mercator: Uncovering faithful hyperbolic embeddings of complex networks, (2019)
  • [40] Serrano MA, Krioukov D, Boguna M., Self-similarity of complex networks and hidden metric spaces, Physical Review Letters, 100, 7, (2008)