{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:22:59Z","timestamp":1774369379196,"version":"3.50.1"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:00:00Z","timestamp":1619568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:00:00Z","timestamp":1619568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["C6030-18GF"],"award-info":[{"award-number":["C6030-18GF"]}]},{"name":"Hong Kong Research Grants Council","award":["12201119"],"award-info":[{"award-number":["12201119"]}]},{"name":"Hong Kong Research Grants Council","award":["12201518"],"award-info":[{"award-number":["12201518"]}]},{"name":"QLUT Young Scholar Fund","award":["2018DB-SHZ005"],"award-info":[{"award-number":["2018DB-SHZ005"]}]},{"name":"Start-up Foundation of Hong Kong Baptist University","award":["162674"],"award-info":[{"award-number":["162674"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graphs have been widely used to represent complex data in many applications, such as e-commerce, social networks, and bioinformatics. Efficient and effective analysis of graph data is important for graph-based applications. However, most graph analysis tasks are combinatorial optimization (CO) problems, which are NP-hard. Recent studies have focused a lot on the potential of using machine learning (ML) to solve graph-based CO problems. Most recent methods follow the two-stage framework. The first stage is graph representation learning, which embeds the graphs into low-dimension vectors. The second stage uses machine learning to solve the CO problems using the embeddings of the graphs learned in the first stage. The works for the first stage can be classified into two categories, graph embedding methods and end-to-end learning methods. For graph embedding methods, the learning of the the embeddings of the graphs has its own objective, which may not rely on the CO problems to be solved. The CO problems are solved by independent downstream tasks. For end-to-end learning methods, the learning of the embeddings of the graphs does not have its own objective and is an intermediate step of the learning procedure of solving the CO problems. The works for the second stage can also be classified into two categories, non-autoregressive methods and autoregressive methods. Non-autoregressive methods predict a solution for a CO problem in one shot. A non-autoregressive method predicts a matrix that denotes the probability of each node\/edge being a part of a solution of the CO problem. The solution can be computed from the matrix using search heuristics such as beam search. Autoregressive methods iteratively extend a partial solution step by step. At each step, an autoregressive method predicts a node\/edge conditioned to current partial solution, which is used to its extension. In this survey, we provide a thorough overview of recent studies of the graph learning-based CO methods. The survey ends with several remarks on future research directions.<\/jats:p>","DOI":"10.1007\/s41019-021-00155-3","type":"journal-article","created":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T14:03:00Z","timestamp":1619618580000},"page":"119-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art"],"prefix":"10.1007","volume":"6","author":[{"given":"Yun","family":"Peng","sequence":"first","affiliation":[]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,28]]},"reference":[{"key":"155_CR1","unstructured":"Abe K, Xu Z, Sato I, Sugiyama M (2019) Solving np-hard problems on graphs with extended alphago zero. arXiv:1905.11623"},{"key":"155_CR2","doi-asserted-by":"crossref","unstructured":"Bai Y, Ding H, Bian S, Chen T, Sun Y, Wang W (2019) SimGNN: a neural network approach to fast graph similarity computation. In: Proceedings of the ACM international conference on web search and data mining (WSDM\u201919), pp 384\u2013392","DOI":"10.1145\/3289600.3290967"},{"key":"155_CR3","doi-asserted-by":"crossref","unstructured":"Bai Y, Ding H, Gu K, Sun Y, Wang W (2020) Learning-based efficient graph similarity computation via multi-scale convolutional set matching. In: Proceedings of the AAAI conference on artificial intelligence (AAAI\u201920), pp 3219\u20133226","DOI":"10.1609\/aaai.v34i04.5720"},{"key":"155_CR4","unstructured":"Bai Y, Xu D, Wang A, Gu K, Wu X, Marinovic A, Ro C, Sun Y, Wang W (2020) Fast detection of maximum common subgraph via deep Q-learning. arXiv:2002.03129"},{"key":"155_CR5","unstructured":"Bengio Y, Lodi A, Prouvost A (2018) Machine learning for combinatorial optimization: A methodological tour d\u2019horizon. arXiv:1811.06128"},{"issue":"3","key":"155_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s41019-019-0097-5","volume":"4","author":"S Bonner","year":"2019","unstructured":"Bonner S, Kureshi I, Brennan J, Theodoropoulos G, McGough AS, Obara B (2019) Exploring the semantic content of unsupervised graph embeddings: an empirical study. Data Sci Eng 4(3):269\u2013289","journal-title":"Data Sci Eng"},{"issue":"09","key":"155_CR7","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang K (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(09):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"155_CR8","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2015) GraRep: learning graph representations with global structural information. In: Proceedings of ACM international on conference on information and knowledge management (CIKM\u201915), pp 891\u2013900","DOI":"10.1145\/2806416.2806512"},{"key":"155_CR9","unstructured":"Chami I, Abu-El-Haija S, Perozzi B, R\u00e9 C, Murphy K (2020) Machine learning on graphs: a model and comprehensive taxonomy. arXiv:2005.03675"},{"key":"155_CR10","doi-asserted-by":"crossref","unstructured":"Chang L (2019) Efficient maximum clique computation over large sparse graphs. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201919), pp 529\u2013538","DOI":"10.1145\/3292500.3330986"},{"key":"155_CR11","doi-asserted-by":"publisher","first-page":"e15","DOI":"10.1017\/ATSIP.2020.13","volume":"9","author":"F Chen","year":"2020","unstructured":"Chen F, Wang YC, Wang B, Kuo CCJ (2020) Graph representation learning: a survey. APSIPA Trans Signal Inf Process 9:e15","journal-title":"APSIPA Trans Signal Inf Process"},{"key":"155_CR12","doi-asserted-by":"crossref","unstructured":"Chen H, Yin H, Chen T, Nguyen QVH, Peng W, Li X (2019) Exploiting centrality information with graph convolutions for network representation learning. In: IEEE international conference on data engineering (ICDE\u201919), pp 590\u2013601","DOI":"10.1109\/ICDE.2019.00059"},{"issue":"5","key":"155_CR13","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2019","unstructured":"Cui P, Wang X, Pei J, Zhu W (2019) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"155_CR14","unstructured":"Dai H, Khalil EB, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. In: Proceedings of international conference on neural information processing systems (NIPS\u201917), pp 6351\u20136361"},{"key":"155_CR15","doi-asserted-by":"crossref","unstructured":"Dareddy MR, Das M, Yang H (2019) Motif2Vec: Motif aware node representation learning for heterogeneous networks. In: 2019 IEEE international conference on big data (Big Data\u201919), pp 1052\u20131059","DOI":"10.1109\/BigData47090.2019.9005670"},{"issue":"2","key":"155_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s41019-019-0092-x","volume":"4","author":"VS Dave","year":"2019","unstructured":"Dave VS, Zhang B, Chen PY, Al Hasan M (2019) Neural-brane: neural bayesian personalized ranking for attributed network embedding. Data Sci Eng 4(2):119\u2013131","journal-title":"Data Sci Eng"},{"key":"155_CR17","doi-asserted-by":"crossref","unstructured":"Deudon M, Cournut P, Lacoste A, Adulyasak Y, Rousseau LM (2018) Learning heuristics for the TSP by policy gradient. In: International conference on the integration of constraint programming, artificial intelligence, and operations research, pp 170\u2013181","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"155_CR18","first-page":"4171","volume":"1","author":"J Devlin","year":"2019","unstructured":"Devlin J, Chang MW, Lee K, Toutanova K (2019) BERT: Pre-training of deep bidirectional transformers for language understanding. Proc Conf N Am Chapter Assoc Comput Linguist Hum Lang Technol 1:4171\u20134186","journal-title":"Proc Conf N Am Chapter Assoc Comput Linguist Hum Lang Technol"},{"key":"155_CR19","doi-asserted-by":"crossref","unstructured":"Du X, Yan J, Zha H (2019) Joint link prediction and network alignment via cross-graph embedding. In: Proceedings of international joint conference on artificial intelligence, IJCAI\u201919, pp 2251\u20132257","DOI":"10.24963\/ijcai.2019\/312"},{"key":"155_CR20","first-page":"2224","volume":"28","author":"DK Duvenaud","year":"2015","unstructured":"Duvenaud DK, Maclaurin D, Iparraguirre J, Bombarell R, Hirzel T, Aspuru-Guzik A, Adams RP (2015) Convolutional networks on graphs for learning molecular fingerprints. Adv Neural Inf Process Syst 28:2224\u20132232","journal-title":"Adv Neural Inf Process Syst"},{"key":"155_CR21","doi-asserted-by":"crossref","unstructured":"Fan W, Ma Y, Li Q, He Y, Zhao E, Tang J, Yin D (2019) Graph neural networks for social recommendation. In: The world wide web conference, pp 417\u2013426","DOI":"10.1145\/3308558.3313488"},{"issue":"4","key":"155_CR22","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TSC.2013.42","volume":"7","author":"Z Fan","year":"2014","unstructured":"Fan Z, Peng Y, Choi B, Xu J, Bhowmick SS (2014) Towards efficient authenticated subgraph query service in outsourced graph databases. IEEE Trans Serv Comput 7(4):696\u2013713","journal-title":"IEEE Trans Serv Comput"},{"issue":"6","key":"155_CR23","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145","journal-title":"J ACM"},{"key":"155_CR24","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) Node2Vec: Scalable feature learning for networks. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201916), pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"155_CR25","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of international conference on neural information processing systems (NIPS\u201917), pp 1025\u20131035"},{"key":"155_CR26","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. IEEE Data Eng Bull"},{"issue":"1","key":"155_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J (1999) Clique is hard to approximate within $$n^{1-\\varepsilon }$$. Acta Math 182(1):105\u2013142","journal-title":"Acta Math"},{"key":"155_CR28","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J Hopfield","year":"1985","unstructured":"Hopfield J, Tank D (1985) Neural computation of decisions in optimisation problems. Biol Cybern 52:141\u2013152","journal-title":"Biol Cybern"},{"key":"155_CR29","unstructured":"Huang J, Patwary MMA, Diamos GF (2019) Coloring big graphs with alphagozero. CoRR arXiv:1902.10162"},{"key":"155_CR30","unstructured":"Huang W, Zhang T, Rong Y, Huang J (2018) Adaptive sampling towards fast graph representation learning. In: Proceedings of international conference on neural information processing systems (NIPS\u201918), pp 4563\u20134572"},{"key":"155_CR31","doi-asserted-by":"publisher","DOI":"10.2200\/S00928ED1V01Y201906DTM061","volume-title":"Community search over big graphs","author":"X Huang","year":"2019","unstructured":"Huang X, Lakshmanan LV, Xu J (2019) Community search over big graphs. Morgan & Claypool Publishers, New York"},{"key":"155_CR32","first-page":"2323","volume":"80","author":"W Jin","year":"2018","unstructured":"Jin W, Barzilay R, Jaakkola T (2018) Junction tree variational autoencoder for molecular graph generation. Proc Int Conf Mach Learn 80:2323\u20132332","journal-title":"Proc Int Conf Mach Learn"},{"key":"155_CR33","unstructured":"Joshi CK, Cappart Q, Rousseau LM, Laurent T, Bresson X (2020) Learning TSP requires rethinking generalization. arXiv:2006.07054"},{"key":"155_CR34","unstructured":"Joshi CK, Laurent T, Bresson X (2019) An efficient graph convolutional network technique for the travelling salesman problem. CoRR arXiv:1906.01227"},{"key":"155_CR35","doi-asserted-by":"crossref","unstructured":"Khot S (2001) Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proceedings IEEE symposium on foundations of computer science, pp 600\u2013609","DOI":"10.1109\/SFCS.2001.959936"},{"key":"155_CR36","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International conference on learning representations (ICLR\u201917)"},{"key":"155_CR37","unstructured":"Kool W, van Hoof H, Welling M (2019) Attention, learn to solve routing problems! In: International conference on learning representations"},{"key":"155_CR38","doi-asserted-by":"crossref","unstructured":"Lamb LC, Garcez AD, Gori M, Prates MO, Avelar PH, Vardi MY (2020) Graph neural networks meet neural-symbolic computing: a survey and perspective. In: Proceedings of international joint conference on artificial intelligence (IJCAI\u201920), pp 4877\u20134884","DOI":"10.24963\/ijcai.2020\/679"},{"key":"155_CR39","unstructured":"Le Q, Mikolov T (2014) Distributed representations of sentences and documents. In: Proceedings of international conference on international conference on machine learning, vol 32, ICML\u201914, pp II\u20131188\u2013II\u20131196"},{"key":"155_CR40","doi-asserted-by":"crossref","unstructured":"Lemos H, Prates MOR, Avelar PHC, Lamb LC (2019) Graph colouring meets deep learning: Effective graph neural network models for combinatorial problems. CoRR arXiv:1903.04598","DOI":"10.1109\/ICTAI.2019.00125"},{"key":"155_CR41","unstructured":"Li Y, Gu C, Dullien T, Vinyals O, Kohli P (2019) Graph matching networks for learning the similarity of graph structured objects. In: Proceedings of international conference on machine learning (ICML\u201919), pp 3835\u20133845"},{"key":"155_CR42","doi-asserted-by":"crossref","unstructured":"Li Z, Chen Q, Koltun V (2018) Combinatorial optimization with graph convolutional networks and guided tree search. In: Proceedings of international conference on neural information processing systems (NIPS\u201918), pp 537\u2013546","DOI":"10.1007\/978-3-030-04221-9_48"},{"key":"155_CR43","unstructured":"Mazyavkina N, Sviridov S, Ivanov S, Burnaev E (2020) Reinforcement learning for combinatorial optimization: a survey. arXiv:2003.03600"},{"key":"155_CR44","unstructured":"Meng L, Zhang J (2019) IsoNN: Isomorphic neural network for graph representation learning and classification. CoRR arXiv:1907.09495"},{"key":"155_CR45","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado G, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Proceedings of the 26th international conference on neural information processing systems (NIPS\u201913), pp 3111\u20133119"},{"key":"155_CR46","doi-asserted-by":"crossref","unstructured":"Milan A, Rezatofighi SH, Garg R, Dick A, Reid I (2017) Data-driven approximations to np-hard problems. In: Thirty-first AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v31i1.10750"},{"issue":"7540","key":"155_CR47","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G et al (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"155_CR48","unstructured":"Narayanan A, Chandramohan M, Chen L, Liu Y, Saminathan S, Subgraph2Vec: learning distributed representations of rooted sub-graphs from large graphs"},{"key":"155_CR49","unstructured":"Nazi A, Hang W, Goldie A, Ravi S, Mirhoseini A (2019) GAP : Generalizable approximate graph partitioning framework. URL ICLR workshop"},{"key":"155_CR50","unstructured":"Nguyen H, Murata T (2017) Motif-aware graph embeddings. In: Proceedings of international joint conference on artificial intelligence (IJCAI\u201917), pp 1\u20131"},{"key":"155_CR51","doi-asserted-by":"crossref","unstructured":"Nowak A, Villar S, Bandeira AS, Bruna J (2017) A note on learning algorithms for quadratic assignment with graph neural networks. In: Proceeding of international conference on machine learning (ICML\u201917), pp 22\u201322","DOI":"10.1109\/DSW.2018.8439919"},{"key":"155_CR52","doi-asserted-by":"crossref","unstructured":"Ou M, Cui P, Pei J, Zhang Z, Zhu W (2016) Asymmetric transitivity preserving graph embedding. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201916), pp 1105\u20131114","DOI":"10.1145\/2939672.2939751"},{"issue":"1","key":"155_CR53","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00493-006-0008-z","volume":"26","author":"CH Papadimitriou","year":"2006","unstructured":"Papadimitriou CH, Vempala S (2006) On the approximability of the traveling salesman problem. Combinatorica 26(1):101\u2013120","journal-title":"Combinatorica"},{"key":"155_CR54","doi-asserted-by":"crossref","unstructured":"Peng Y, Choi B, He B, Zhou S, Xu R, Yu X (2016) VColor: A practical vertex-cut based approach for coloring large graphs. In: IEEE international conference on data engineering (ICDE\u201916), pp 97\u2013108","DOI":"10.1109\/ICDE.2016.7498232"},{"issue":"7","key":"155_CR55","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1109\/TKDE.2014.2316818","volume":"27","author":"Y Peng","year":"2015","unstructured":"Peng Y, Fan Z, Choi B, Xu J, Bhowmick SS (2015) Authenticated subgraph similarity searchin outsourced graph databases. IEEE Trans Knowl Data Eng 27(7):1838\u20131860","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"155_CR56","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) DeepWalk: Online learning of social representations. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201914), pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"155_CR57","doi-asserted-by":"crossref","unstructured":"Prates M, Avelar P, Lemos H, Lamb L, Vardi M (2019) Learning to solve NP-Complete problems - a graph neural network for decision TSP. In: Proceedings of AAAI conference on artificial intelligence (AAAI\u201919), pp 4731\u20134738","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"155_CR58","doi-asserted-by":"crossref","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR (2017) Struc2Vec: Learning node representations from structural identity. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201917), pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"key":"155_CR59","unstructured":"Sato R, Yamada M, Kashima H (2019) Approximation ratios of graph neural networks for combinatorial problems. In: Proceedings of the neural information processing systems (NIPS\u201919)"},{"key":"155_CR60","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"K Smith-Miles","year":"1999","unstructured":"Smith-Miles K (1999) Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J Comput 11:15\u201334","journal-title":"INFORMS J Comput"},{"key":"155_CR61","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction. MIT Press, Cambridge"},{"key":"155_CR62","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Mei Q (2015) PTE: Predictive text embedding through large-scale heterogeneous text networks. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201915), pp 1165\u20131174","DOI":"10.1145\/2783258.2783307"},{"key":"155_CR63","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: Large-scale information network embedding. In: Proceedings of international conference on world wide web (WWW\u201915), pp 1067\u20131077","DOI":"10.1145\/2736277.2741093"},{"key":"155_CR64","doi-asserted-by":"crossref","unstructured":"Tsitsulin A, Mottin D, Karras P, M\u00fcller E (2018) VERSE: Versatile graph embeddings from similarity measures. In: Proceedings of world wide web conference (WWW\u201918), pp 539\u2013548","DOI":"10.1145\/3178876.3186120"},{"key":"155_CR65","doi-asserted-by":"crossref","unstructured":"Tu K, Cui P, Wang X, Yu PS, Zhu W (2018) Deep recursive network embedding with regular equivalence. In: Proceedings of ACM SIGKDD international conference on knowledge discovery & data mining (KDD\u201918), pp 2357\u20132366","DOI":"10.1145\/3219819.3220068"},{"key":"155_CR66","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2018) Graph Attention Networks. In: International conference on learning representations (ICLR)"},{"key":"155_CR67","first-page":"2692","volume":"28","author":"O Vinyals","year":"2015","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. Adv Neural Inf Process Syst 28:2692\u20132700","journal-title":"Adv Neural Inf Process Syst"},{"key":"155_CR68","doi-asserted-by":"crossref","unstructured":"Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of ACM SIGKDD International conference on knowledge discovery and data mining (KDD\u201916), pp 1225\u20131234","DOI":"10.1145\/2939672.2939753"},{"key":"155_CR69","doi-asserted-by":"crossref","unstructured":"Wang R, Yan J, Yang X (2019) Learning combinatorial embedding networks for deep graph matching. In: Proceedings of the IEEE international conference on computer vision (ICCV\u201919), pp 3056\u20133065","DOI":"10.1109\/ICCV.2019.00315"},{"key":"155_CR70","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K et al (1994) Social network analysis: methods and applications, vol 8. Cambridge University Press, Cambridge"},{"key":"155_CR71","unstructured":"Wu Y, Song W, Cao Z, Zhang J, Lim A (2019) Learning improvement heuristics for solving the travelling salesman problem. CoRR arXiv:1912.05784"},{"key":"155_CR72","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS (2019) A comprehensive survey on graph neural networks. CoRR arXiv:1901.00596"},{"key":"155_CR73","doi-asserted-by":"crossref","unstructured":"Yanardag P, Vishwanathan S (2015) Deep graph kernels. In: Proceedings of ACM sigkdd international conference on knowledge discovery and data mining (KDD\u201915), pp 1365\u20131374","DOI":"10.1145\/2783258.2783417"},{"key":"155_CR74","doi-asserted-by":"crossref","unstructured":"Yang Y, Wang X, Song M, Yuan J, Tao D (2019) SPAGAN: Shortest path graph attention network. In: Proceedings of international joint conference on artificial intelligence (IJCAI\u201919), pp 4099\u20134105","DOI":"10.24963\/ijcai.2019\/569"},{"key":"155_CR75","doi-asserted-by":"crossref","unstructured":"Yu Y, Lu Z, Liu J, Zhao G, Wen J (2019) RUM: Network representation learning using motifs. In: IEEE international conference on data engineering (ICDE\u201919), pp 1382\u20131393","DOI":"10.1109\/ICDE.2019.00125"},{"issue":"4","key":"155_CR76","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1093\/bioinformatics\/btz718","volume":"36","author":"X Yue","year":"2019","unstructured":"Yue X, Wang Z, Huang J, Parthasarathy S, Moosavinasab S, Huang Y, Lin SM, Zhang W, Zhang P, Sun H (2019) Graph embedding on biomedical networks: methods, applications and evaluations. Bioinformatics 36(4):1241\u20131251","journal-title":"Bioinformatics"},{"issue":"1","key":"155_CR77","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TBDATA.2018.2850013","volume":"6","author":"D Zhang","year":"2020","unstructured":"Zhang D, Yin J, Zhu X, Zhang C (2020) Network representation learning: a survey. IEEE Trans Big Data 6(1):3\u201328","journal-title":"IEEE Trans Big Data"},{"key":"155_CR78","doi-asserted-by":"crossref","unstructured":"Zhang F, Yuan NJ, Lian D, Xie X, Ma WY (2016) Collaborative knowledge base embedding for recommender systems. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201916), pp 353\u2013362","DOI":"10.1145\/2939672.2939673"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00155-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-021-00155-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00155-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T17:54:18Z","timestamp":1724954058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-021-00155-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,28]]},"references-count":78,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s41019-021-00155-3","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,28]]},"assertion":[{"value":"21 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}