{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:08Z","timestamp":1750220768847,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,6]]},"DOI":"10.1145\/3384943.3409438","type":"proceedings-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T16:11:41Z","timestamp":1602000701000},"page":"198-203","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Network Embedding Based On Structural Information Entropy"],"prefix":"10.1145","author":[{"given":"Bo","family":"Yan","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Zhong","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiping","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland , New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyi","family":"Su","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273503"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367618"},{"key":"e_1_3_2_1_3_1","first-page":"496","volume-title":"ICML","volume":"3","author":"Lu Q.","year":"2003","unstructured":"Q. Lu , L. Getoor , Link-based classification , in: ICML , Vol. 3 , 2003 , pp. 496 -- 503 . Q. Lu, L. Getoor, Link-based classification, in: ICML, Vol. 3, 2003, pp. 496-- 503."},{"key":"e_1_3_2_1_4_1","volume-title":"Impr. Corbaz","author":"Jaccard P.","year":"1901","unstructured":"P. Jaccard , Etude comparative de la distribution florale dans une portion des Alpes et du Jura , Impr. Corbaz , 1901 . P. Jaccard, Etude comparative de la distribution florale dans une portion des Alpes et du Jura, Impr. Corbaz, 1901."},{"key":"e_1_3_2_1_5_1","first-page":"203","article-title":"Community preserving network embedding,?","author":"Wang X.","year":"2017","unstructured":"X. Wang , P. Cui , J. Wang , J. Pei , W. Zhu , and S. Yang , ' Community preserving network embedding,? in AAAI , 2017 , pp. 203 -- 209 . X.Wang, P. Cui, J.Wang, J. Pei,W. Zhu, and S. Yang, 'Community preserving network embedding,? in AAAI, 2017, pp. 203--209.","journal-title":"AAAI"},{"key":"e_1_3_2_1_6_1","first-page":"2422","article-title":"large graph embedding,?","author":"Nie F.","year":"2017","unstructured":"F. Nie , W. Zhu , and X. Li , ?Unsupervised large graph embedding,? in AAAI , 2017 , pp. 2422 -- 2428 . F. Nie, W. Zhu, and X. Li, ?Unsupervised large graph embedding,? in AAAI, 2017, pp. 2422--2428.","journal-title":"AAAI"},{"key":"e_1_3_2_1_7_1","first-page":"2942","article-title":"Scalable graph embedding for asymmetric proximity,?","author":"Zhou C.","year":"2017","unstructured":"C. Zhou , Y. Liu , X. Liu , Z. Liu , and J. Gao , ' Scalable graph embedding for asymmetric proximity,? in AAAI , 2017 , pp. 2942 -- 2948 . C. Zhou, Y. Liu, X. Liu, Z. Liu, and J. Gao, 'Scalable graph embedding for asymmetric proximity,? in AAAI, 2017, pp. 2942-- 2948.","journal-title":"AAAI"},{"key":"e_1_3_2_1_8_1","first-page":"1611","article-title":"view link prediction by learning noise-resilient representation consensus,?","author":"Wei X.","year":"2017","unstructured":"X. Wei , L. Xu , B. Cao , and P. S. Yu , ?Cross view link prediction by learning noise-resilient representation consensus,? in WWW , 2017 , pp. 1611 -- 1619 . X. Wei, L. Xu, B. Cao, and P. S. Yu, ?Cross view link prediction by learning noise-resilient representation consensus,? in WWW, 2017, pp. 1611--1619.","journal-title":"WWW"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_10_1","first-page":"475","volume-title":"Local graph partitioning using PageRank vectors","author":"Andersen R.","year":"2006","unstructured":"R. Andersen , F. Chung , K. Lang , Local graph partitioning using PageRank vectors , 2006 , pp. 475 -- 486 . R. Andersen, F. Chung, K. Lang, Local graph partitioning using PageRank vectors, 2006, pp. 475--486."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2015.05.039"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.10.082"},{"key":"e_1_3_2_1_14_1","first-page":"701","volume-title":"Deepwalk: online learning of social representations. Knowledge Discovery and Data mining","author":"Perozzi Bryan","year":"2014","unstructured":"Bryan Perozzi , Rami Alrfou , and Steven Skiena . Deepwalk: online learning of social representations. Knowledge Discovery and Data mining , pages 701 -- 710 , 2014 . Bryan Perozzi, Rami Alrfou, and Steven Skiena. Deepwalk: online learning of social representations. Knowledge Discovery and Data mining, pages 701-- 710, 2014."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"e_1_3_2_1_16_1","first-page":"585","volume-title":"NIPS","volume":"14","author":"Belkin M.","year":"2001","unstructured":"M. Belkin , P. Niyogi, Laplacian eigenmaps and spectral techniques for embedding and clustering , in: NIPS , Vol. 14 , 2001 , pp. 585 -- 591 . M. Belkin, P. Niyogi, Laplacian eigenmaps and spectral techniques for embedding and clustering, in: NIPS, Vol. 14, 2001, pp. 585--591."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553494"},{"volume-title":"Skiena","author":"Chen H.","key":"e_1_3_2_1_18_1","unstructured":"H. Chen , B. Perozzi , Y. Hu , S. Skiena , Harp : Hierarchical representation learning for networks, arXiv preprint arXiv:1706.07845. H. Chen, B. Perozzi, Y. Hu, S. Skiena, Harp: Hierarchical representation learning for networks, arXiv preprint arXiv:1706.07845."},{"volume-title":"Skiena","author":"Chen H.","key":"e_1_3_2_1_19_1","unstructured":"H. Chen , B. Perozzi , Y. Hu , S. Skiena , Harp : Hierarchical representation learning for networks, arXiv preprint arXiv:1706.07845. H. Chen, B. Perozzi, Y. Hu, S. Skiena, Harp: Hierarchical representation learning for networks, arXiv preprint arXiv:1706.07845."},{"issue":"1","key":"e_1_3_2_1_20_1","first-page":"105","article-title":"lattice theory of information,?","volume":"1","author":"Shannon C.","year":"1953","unstructured":"C. Shannon , 'The lattice theory of information,? IEEE Trans. Inf. Theory , vol. 1 , no. 1 , pp. 105 -- 107 , Feb. 1953 . C. Shannon, 'The lattice theory of information,? IEEE Trans. Inf. Theory, vol. 1, no. 1, pp. 105--107, Feb. 1953.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2011.566458"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129511000570"},{"key":"e_1_3_2_1_24_1","first-page":"3889","volume-title":"IJCAI","author":"Tu C.","year":"2016","unstructured":"C. Tu , W. Zhang , Z. Liu , M. Sun , Max-margin deepwalk : Discriminative learning of network representation ., in: IJCAI , 2016 , pp. 3889 -- 3895 . C. Tu,W. Zhang, Z. Liu, M. Sun, Max-margin deepwalk: Discriminative learning of network representation., in: IJCAI, 2016, pp. 3889--3895."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"}],"event":{"name":"ASIA CCS '20: The 15th ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"ASIA CCS '20"},"container-title":["Proceedings of the 2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384943.3409438","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3384943.3409438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:13Z","timestamp":1750200073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384943.3409438"}},"subtitle":["Network embedding"],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":25,"alternative-id":["10.1145\/3384943.3409438","10.1145\/3384943"],"URL":"https:\/\/doi.org\/10.1145\/3384943.3409438","relation":{},"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"2020-10-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}