{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:56:17Z","timestamp":1768348577478,"version":"3.49.0"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062046"],"award-info":[{"award-number":["62062046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61462050"],"award-info":[{"award-number":["61462050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3067901","type":"journal-article","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T20:22:09Z","timestamp":1616444529000},"page":"45163-45174","source":"Crossref","is-referenced-by-count":7,"title":["Graph Embedding via Graph Summarization"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9571-457X","authenticated-orcid":false,"given":"Jingyanning","family":"Yang","sequence":"first","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9118-3775","authenticated-orcid":false,"given":"Jinguo","family":"You","sequence":"additional","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1313-6321","authenticated-orcid":false,"given":"Xiaorong","family":"Wan","sequence":"additional","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0468-8"},{"key":"ref13","article-title":"Affinity propagation, and other data clustering techniques","author":"redmond","year":"2011"},{"key":"ref14","author":"zhe","year":"2014","journal-title":"Mahout in Action Algorithm and Cases"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164143"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31865-1_25"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"},{"key":"ref18","article-title":"Word2vec explained: Deriving Mikolov’s negative sampling word embedding method","author":"goldberg","year":"2014"},{"key":"ref19","first-page":"585","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","volume":"14","author":"belkin","year":"2002","journal-title":"Advances in Neural Information Processing System"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref6","first-page":"2953","article-title":"Faster graph embeddings via coarsening","author":"fahrbach","year":"2020","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref5","first-page":"2127","article-title":"HARP: Hierarchical representation learning for networks","author":"chen","year":"2017","journal-title":"Proc AAAI"},{"key":"ref8","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"arXiv 1310 4546"},{"key":"ref7","article-title":"Research on graph aggregation algorithm based on structural consistency","author":"yimin","year":"2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557109"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"ref20","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"arXiv 1706 02216"},{"key":"ref22","article-title":"HyperGCN: A new method of training graph convolutional networks on hypergraphs","author":"yadati","year":"2019","journal-title":"arXiv 1809 02589 [cs]"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380214"},{"key":"ref24","first-page":"426","article-title":"Structural deep embedding for hyper-networks","author":"tu","year":"0","journal-title":"Proc AAAI"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/366"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-0092-x"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09382981.pdf?arnumber=9382981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:07:19Z","timestamp":1662667639000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9382981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3067901","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}