{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:09Z","timestamp":1750220649540,"version":"3.41.0"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T00:00:00Z","timestamp":1620432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["LP160100630 and DP180100966"],"award-info":[{"award-number":["LP160100630 and DP180100966"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"crossref","award":["IIS-1763452 and CNS-1828181"],"award-info":[{"award-number":["IIS-1763452 and CNS-1828181"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,8,31]]},"abstract":"<jats:p>Traditional network embedding primarily focuses on learning a continuous vector representation for each node, preserving network structure and\/or node content information, such that off-the-shelf machine learning algorithms can be easily applied to the vector-format node representations for network analysis. However, the learned continuous vector representations are inefficient for large-scale similarity search, which often involves finding nearest neighbors measured by distance or similarity in a continuous vector space. In this article, we propose a search efficient binary network embedding algorithm called BinaryNE to learn a binary code for each node, by simultaneously modeling node context relations and node attribute relations through a three-layer neural network. BinaryNE learns binary node representations using a stochastic gradient descent-based online learning algorithm. The learned binary encoding not only reduces memory usage to represent each node, but also allows fast bit-wise comparisons to support faster node similarity search than using Euclidean or other distance measures. Extensive experiments and comparisons demonstrate that BinaryNE not only delivers more than 25 times faster search speed, but also provides comparable or better search quality than traditional continuous vector based network embedding methods. The binary codes learned by BinaryNE also render competitive performance on node classification and node clustering tasks. The source code of the BinaryNE algorithm is available at https:\/\/github.com\/daokunzhang\/BinaryNE.<\/jats:p>","DOI":"10.1145\/3436892","type":"journal-article","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T11:08:45Z","timestamp":1620472125000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Search Efficient Binary Network Embedding"],"prefix":"10.1145","volume":"15","author":[{"given":"Daokun","family":"Zhang","sequence":"first","affiliation":[{"name":"The University of Sydney, Camperdown, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Yin","sequence":"additional","affiliation":[{"name":"The University of Sydney, Camperdown, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4129-9611","authenticated-orcid":false,"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Florida Atlantic University, Glades Road, Boca Raton, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengqi","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Broadway, Ultimo, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,5,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_2_1_2_1","volume-title":"Allgower and Kurt Georg","author":"Eugene","year":"2012","unstructured":"Eugene L. Allgower and Kurt Georg . 2012 . Numerical Continuation Methods: An Introduction . Vol. 13 . Springer Science & Business Media . Eugene L. Allgower and Kurt Georg. 2012. Numerical Continuation Methods: An Introduction. Vol. 13. Springer Science & Business Media."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0811511106"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_2_1_5_1","unstructured":"Shaosheng Cao Wei Lu and Qiongkai Xu. 2015. GraRep: Learning graph representations with global structural information. In CIKM. ACM 891\u2013900. Shaosheng Cao Wei Lu and Qiongkai Xu. 2015. GraRep: Learning graph representations with global structural information. In CIKM. ACM 891\u2013900."},{"volume-title":"Deep neural networks for learning graph representations","author":"Cao Shaosheng","key":"e_1_2_1_6_1","unstructured":"Shaosheng Cao , Wei Lu , and Qiongkai Xu. 2016. Deep neural networks for learning graph representations . In AAAI. AAAI Press , 1145\u20131152. Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2016. Deep neural networks for learning graph representations. In AAAI. AAAI Press, 1145\u20131152."},{"key":"e_1_2_1_7_1","unstructured":"Zhangjie Cao Mingsheng Long Jianmin Wang and S. Yu Philip. 2017. HashNet: Deep learning to hash by continuation. In ICCV. 5609\u20135618. Zhangjie Cao Mingsheng Long Jianmin Wang and S. Yu Philip. 2017. HashNet: Deep learning to hash by continuation. In ICCV. 5609\u20135618."},{"key":"e_1_2_1_8_1","volume-title":"Martin Renqiang Min, and Yizhou Sun","author":"Chen Ting","year":"2018","unstructured":"Ting Chen , Martin Renqiang Min, and Yizhou Sun . 2018 . Learning k-way d-dimensional discrete codes for compact embedding representations. In ICML. 854--863. Ting Chen, Martin Renqiang Min, and Yizhou Sun. 2018. Learning k-way d-dimensional discrete codes for compact embedding representations. In ICML. 854--863."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3047307"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In SIGKDD. ACM 855\u2013864. Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In SIGKDD. ACM 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2188396"},{"key":"e_1_2_1_13_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS. 1024\u20131034. Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS. 1024\u20131034."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Taher H. Haveliwala. 2002. Topic-sensitive pagerank. In WWW. ACM 517\u2013526. Taher H. Haveliwala. 2002. Topic-sensitive pagerank. In WWW. ACM 517\u2013526.","DOI":"10.1145\/511446.511513"},{"volume-title":"Nonlinear integer programming. In 50 Years of Integer Programming 1958-2008","author":"Hemmecke Raymond","key":"e_1_2_1_15_1","unstructured":"Raymond Hemmecke , Matthias K\u00f6ppe , Jon Lee , and Robert Weismantel . 2010. Nonlinear integer programming. In 50 Years of Integer Programming 1958-2008 . Springer , 561\u2013618. Raymond Hemmecke, Matthias K\u00f6ppe, Jon Lee, and Robert Weismantel. 2010. Nonlinear integer programming. In 50 Years of Integer Programming 1958-2008. Springer, 561\u2013618."},{"volume-title":"Accelerated attributed network embedding","author":"Huang Xiao","key":"e_1_2_1_16_1","unstructured":"Xiao Huang , Jundong Li , and Xia Hu. 2017. Accelerated attributed network embedding . In SDM. SIAM , 633\u2013641. Xiao Huang, Jundong Li, and Xia Hu. 2017. Accelerated attributed network embedding. In SDM. SIAM, 633\u2013641."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Xiao Huang Jundong Li and Xia Hu. 2017. Label informed attributed network embedding. In WSDM. ACM 731\u2013739. Xiao Huang Jundong Li and Xia Hu. 2017. Label informed attributed network embedding. In WSDM. ACM 731\u2013739.","DOI":"10.1145\/3018661.3018667"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2002. SimRank: A measure of structural-context similarity. In SIGKDD. ACM 538\u2013543. Glen Jeh and Jennifer Widom. 2002. SimRank: A measure of structural-context similarity. In SIGKDD. ACM 538\u2013543.","DOI":"10.1145\/775047.775126"},{"key":"e_1_2_1_19_1","unstructured":"Ruoming Jin Victor E. Lee and Hui Hong. 2011. Axiomatic ranking of network role similarity. In SIGKDD. ACM 922\u2013930. Ruoming Jin Victor E. Lee and Hui Hong. 2011. Axiomatic ranking of network role similarity. In SIGKDD. ACM 922\u2013930."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.5090140103"},{"key":"e_1_2_1_21_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2016","unstructured":"Thomas N. Kipf and Max Welling . 2016 . Semi-supervised classification with graph convolutional networks. In ICLR. Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. In ICLR."},{"volume-title":"Symmetric nonnegative matrix factorization for graph clustering","author":"Kuang Da","key":"e_1_2_1_22_1","unstructured":"Da Kuang , Chris Ding , and Haesun Park . 2012. Symmetric nonnegative matrix factorization for graph clustering . In SDM. SIAM , 106\u2013117. Da Kuang, Chris Ding, and Haesun Park. 2012. Symmetric nonnegative matrix factorization for graph clustering. In SDM. SIAM, 106\u2013117."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Mitsuru Kusumoto Takanori Maehara and Ken-ichi Kawarabayashi. 2014. Scalable similarity search for SimRank. In SIGMOD. ACM 325\u2013336. Mitsuru Kusumoto Takanori Maehara and Ken-ichi Kawarabayashi. 2014. Scalable similarity search for SimRank. In SIGMOD. ACM 325\u2013336.","DOI":"10.1145\/2588555.2610526"},{"key":"e_1_2_1_24_1","unstructured":"Quoc Le and Tomas Mikolov. 2014. Distributed representations of sentences and documents. In ICML. 1188\u20131196. Quoc Le and Tomas Mikolov. 2014. Distributed representations of sentences and documents. In ICML. 1188\u20131196."},{"volume-title":"On top-k structural similarity search","author":"Lee Pei","key":"e_1_2_1_25_1","unstructured":"Pei Lee , Laks V.S. Lakshmanan , and Jeffrey Xu Yu. 2012. On top-k structural similarity search . In ICDE. IEEE , 774\u2013785. Pei Lee, Laks V.S. Lakshmanan, and Jeffrey Xu Yu. 2012. On top-k structural similarity search. In ICDE. IEEE, 774\u2013785."},{"key":"e_1_2_1_26_1","unstructured":"Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization. In NIPS. 2177\u20132185. Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization. In NIPS. 2177\u20132185."},{"key":"e_1_2_1_27_1","volume-title":"Smola","author":"Li Aaron Q.","year":"2014","unstructured":"Aaron Q. Li , Amr Ahmed , Sujith Ravi , and Alexander J . Smola . 2014 . Reducing the sampling complexity of topic models. In SIGKDD. ACM , 891\u2013900. Aaron Q. Li, Amr Ahmed, Sujith Ravi, and Alexander J. Smola. 2014. Reducing the sampling complexity of topic models. In SIGKDD. ACM, 891\u2013900."},{"volume-title":"ACL.","author":"Li Juzheng","key":"e_1_2_1_28_1","unstructured":"Juzheng Li , Jun Zhu , and Bo Zhang . 2016. Discriminative deep random walk for network classification . In ACL. Vol. 1 . 1004\u20131013. Juzheng Li, Jun Zhu, and Bo Zhang. 2016. Discriminative deep random walk for network classification. In ACL. Vol. 1. 1004\u20131013."},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Defu Lian Kai Zheng Vincent W. Zheng Yong Ge Longbing Cao Ivor W. Tsang and Xing Xie. 2018. High-order proximity preserving information network hashing. In KDD. 1744\u20131753. Defu Lian Kai Zheng Vincent W. Zheng Yong Ge Longbing Cao Ivor W. Tsang and Xing Xie. 2018. High-order proximity preserving information network hashing. In KDD. 1744\u20131753.","DOI":"10.1145\/3219819.3220034"},{"key":"e_1_2_1_30_1","unstructured":"Wei Liu Cun Mu Sanjiv Kumar and Shih-Fu Chang. 2014. Discrete graph hashing. In NIPS. 3419\u20133427. Wei Liu Cun Mu Sanjiv Kumar and Shih-Fu Chang. 2014. Discrete graph hashing. In NIPS. 3419\u20133427."},{"key":"e_1_2_1_31_1","volume-title":"Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov , Kai Chen , Greg Corrado , and Jeffrey Dean . 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 ( 2013 ). Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Vinith Misra and Sumit Bhatia. 2018. Bernoulli embeddings for graphs. In AAAI. 3812\u20133819. Vinith Misra and Sumit Bhatia. 2018. Bernoulli embeddings for graphs. In AAAI. 3812\u20133819.","DOI":"10.1609\/aaai.v32i1.11733"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu269"},{"key":"e_1_2_1_34_1","unstructured":"Shirui Pan Jia Wu Xingquan Zhu Chengqi Zhang and Yang Wang. 2016. Tri-party deep network representation. In IJCAI. 1895\u20131901. Shirui Pan Jia Wu Xingquan Zhu Chengqi Zhang and Yang Wang. 2016. Tri-party deep network representation. In IJCAI. 1895\u20131901."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Bryan Perozzi Rami Al-Rfou and Steven Skiena. 2014. DeepWalk: Online learning of social representations. In SIGKDD. ACM 701\u2013710. Bryan Perozzi Rami Al-Rfou and Steven Skiena. 2014. DeepWalk: Online learning of social representations. In SIGKDD. ACM 701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_2_1_36_1","unstructured":"Lise Getoor Qing Lu. 2003. Link-based classification. In ICML. 496\u2013503. Lise Getoor Qing Lu. 2003. Link-based classification. In ICML. 496\u2013503."},{"key":"e_1_2_1_37_1","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying deepwalk line pte and node2vec. In WSDM. 459\u2013467. Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying deepwalk line pte and node2vec. In WSDM. 459\u2013467."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10559-017-9914-x"},{"volume-title":"Mining of Massive Datasets","author":"Rajaraman Anand","key":"e_1_2_1_39_1","unstructured":"Anand Rajaraman and Jeffrey David Ullman . 2011. Mining of Massive Datasets . Cambridge University Press . Anand Rajaraman and Jeffrey David Ullman. 2011. Mining of Massive Datasets. Cambridge University Press."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Xiaobo Shen Shirui Pan Weiwei Liu Yew-Soon Ong and Quan-Sen Sun. 2018. Discrete network embedding. In IJCAI. 3549\u20133555. Xiaobo Shen Shirui Pan Weiwei Liu Yew-Soon Ong and Quan-Sen Sun. 2018. Discrete network embedding. In IJCAI. 3549\u20133555.","DOI":"10.24963\/ijcai.2018\/493"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078187"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630240406"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.26636\/jtit.2016.2.725","article-title":"Similarity index based link prediction algorithms in social networks: A survey","volume":"2","author":"Srilatha Pulipati","year":"2016","unstructured":"Pulipati Srilatha and Ramakrishnan Manjula . 2016 . Similarity index based link prediction algorithms in social networks: A survey . Journal of Telecommunications and Information Technology 2 (2016), 87 \u2013 94 . Pulipati Srilatha and Ramakrishnan Manjula. 2016. Similarity index based link prediction algorithms in social networks: A survey. Journal of Telecommunications and Information Technology 2 (2016), 87\u201394.","journal-title":"Journal of Telecommunications and Information Technology"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244303321897735"},{"key":"e_1_2_1_45_1","first-page":"53","article-title":"What happens next? Prediction of disastrous links in covert networks","volume":"8","author":"Subbaraj Karthika","year":"2015","unstructured":"Karthika Subbaraj and Bose Sundan . 2015 . What happens next? Prediction of disastrous links in covert networks . Disaster Advances 8 , 4 (2015), 53 \u2013 60 . Karthika Subbaraj and Bose Sundan. 2015. What happens next? Prediction of disastrous links in covert networks. Disaster Advances 8, 4 (2015), 53\u201360.","journal-title":"Disaster Advances"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.836581"},{"key":"e_1_2_1_49_1","first-page":"1722","article-title":"CANE: Context-aware network embedding for relation modeling","volume":"1","author":"Tu Cunchao","year":"2017","unstructured":"Cunchao Tu , Han Liu , Zhiyuan Liu , and Maosong Sun . 2017 . CANE: Context-aware network embedding for relation modeling . In ACL , Vol. 1. 1722 \u2013 1731 . Cunchao Tu, Han Liu, Zhiyuan Liu, and Maosong Sun. 2017. CANE: Context-aware network embedding for relation modeling. In ACL, Vol. 1. 1722\u20131731.","journal-title":"ACL"},{"key":"e_1_2_1_50_1","volume-title":"et\u00a0al","author":"Tu Cunchao","year":"2016","unstructured":"Cunchao Tu , Weicheng Zhang , Zhiyuan Liu , Maosong Sun , et\u00a0al . 2016 . Max-margin DeepWalk: Discriminative learning of network representation. In IJCAI. 3889\u20133895. Cunchao Tu, Weicheng Zhang, Zhiyuan Liu, Maosong Sun, et\u00a0al. 2016. Max-margin DeepWalk: Discriminative learning of network representation. In IJCAI. 3889\u20133895."},{"key":"e_1_2_1_51_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2017. Graph attention networks. In ICLR. Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2017. Graph attention networks. In ICLR."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953039"},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In SIGKDD. ACM 1225\u20131234. Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In SIGKDD. ACM 1225\u20131234.","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Haoyu Wang Defu Lian and Yong Ge. 2019. Binarized collaborative filtering with distilling graph convolutional networks. In IJCAI. 4802\u20134808. Haoyu Wang Defu Lian and Yong Ge. 2019. Binarized collaborative filtering with distilling graph convolutional networks. In IJCAI. 4802\u20134808.","DOI":"10.24963\/ijcai.2019\/667"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Peng Cui Jing Wang Jian Pei Wenwu Zhu and Shiqiang Yang. 2017. Community preserving network embedding. In AAAI. 203\u2013209. Xiao Wang Peng Cui Jing Wang Jian Pei Wenwu Zhu and Shiqiang Yang. 2017. Community preserving network embedding. In AAAI. 203\u2013209.","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"e_1_2_1_56_1","unstructured":"Yair Weiss Antonio Torralba and Rob Fergus. 2009. Spectral hashing. In NIPS. 1753\u20131760. Yair Weiss Antonio Torralba and Rob Fergus. 2009. Spectral hashing. In NIPS. 1753\u20131760."},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2018. Efficient attributed network embedding via recursive randomized hashing. In IJCAI. 2861\u20132867. Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2018. Efficient attributed network embedding via recursive randomized hashing. In IJCAI. 2861\u20132867.","DOI":"10.24963\/ijcai.2018\/397"},{"key":"e_1_2_1_58_1","unstructured":"Cheng Yang Zhiyuan Liu Deli Zhao Maosong Sun and Edward Y Chang. 2015. Network representation learning with rich text information. In IJCAI. 2111\u20132117. Cheng Yang Zhiyuan Liu Deli Zhao Maosong Sun and Edward Y Chang. 2015. Network representation learning with rich text information. In IJCAI. 2111\u20132117."},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Dejian Yang Senzhang Wang Chaozhuo Li Xiaoming Zhang and Zhoujun Li. 2017. From properties to links: Deep network embedding on incomplete graphs. In CIKM. ACM 367\u2013376. Dejian Yang Senzhang Wang Chaozhuo Li Xiaoming Zhang and Zhoujun Li. 2017. From properties to links: Deep network embedding on incomplete graphs. In CIKM. ACM 367\u2013376.","DOI":"10.1145\/3132847.3132975"},{"volume-title":"Binarized attributed network embedding","author":"Yang Hong","key":"e_1_2_1_60_1","unstructured":"Hong Yang , Shirui Pan , Peng Zhang , Ling Chen , Defu Lian , and Chengqi Zhang . 2018. Binarized attributed network embedding . In ICDM. IEEE , 1476\u20131481. Hong Yang, Shirui Pan, Peng Zhang, Ling Chen, Defu Lian, and Chengqi Zhang. 2018. Binarized attributed network embedding. In ICDM. IEEE, 1476\u20131481."},{"key":"e_1_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Daokun Zhang Jie Yin Xingquan Zhu and Chengqi Zhang. 2016. Collective classification via discriminative matrix factorization on sparsely labeled networks. In CIKM. ACM 1563\u20131572. Daokun Zhang Jie Yin Xingquan Zhu and Chengqi Zhang. 2016. Collective classification via discriminative matrix factorization on sparsely labeled networks. In CIKM. ACM 1563\u20131572.","DOI":"10.1145\/2983323.2983754"},{"volume-title":"structure, and content augmented network representation learning","author":"Zhang Daokun","key":"e_1_2_1_62_1","unstructured":"Daokun Zhang , Jie Yin , Xingquan Zhu , and Chengqi Zhang . 2016. Homophily , structure, and content augmented network representation learning . In ICDM. IEEE , 609\u2013618. Daokun Zhang, Jie Yin, Xingquan Zhu, and Chengqi Zhang. 2016. Homophily, structure, and content augmented network representation learning. In ICDM. IEEE, 609\u2013618."},{"key":"e_1_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Daokun Zhang Jie Yin Xingquan Zhu and Chengqi Zhang. 2017. User profile preserving social network embedding. In IJCAI. 3378\u20133384. Daokun Zhang Jie Yin Xingquan Zhu and Chengqi Zhang. 2017. User profile preserving social network embedding. In IJCAI. 3378\u20133384.","DOI":"10.24963\/ijcai.2017\/472"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2018.2850013"},{"key":"e_1_2_1_65_1","volume-title":"SINE: Scalable incomplete network embedding","author":"Zhang Daokun","year":"2018","unstructured":"Daokun Zhang , Jie Yin , Xingquan Zhu , and Chengqi Zhang . 2018 . SINE: Scalable incomplete network embedding . In ICDM. IEEE. Daokun Zhang, Jie Yin, Xingquan Zhu, and Chengqi Zhang. 2018. SINE: Scalable incomplete network embedding. In ICDM. IEEE."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783267"},{"key":"e_1_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Kang Zhao Hongtao Lu and Jincheng Mei. 2014. Locality preserving hashing. In AAAI. Kang Zhao Hongtao Lu and Jincheng Mei. 2014. Locality preserving hashing. In AAAI.","DOI":"10.1145\/2647868.2654971"},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Peixiang Zhao Jiawei Han and Yizhou Sun. 2009. P-Rank: A comprehensive structural similarity measure over information networks. In CIKM. ACM 553\u2013562. Peixiang Zhao Jiawei Han and Yizhou Sun. 2009. P-Rank: A comprehensive structural similarity measure over information networks. In CIKM. ACM 553\u2013562.","DOI":"10.1145\/1645953.1646025"},{"key":"e_1_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Han Zhu Mingsheng Long Jianmin Wang and Yue Cao. 2016. Deep hashing network for efficient similarity retrieval. In AAAI. 2415\u20132421. Han Zhu Mingsheng Long Jianmin Wang and Yue Cao. 2016. Deep hashing network for efficient similarity retrieval. In AAAI. 2415\u20132421.","DOI":"10.1609\/aaai.v30i1.10235"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3436892","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3436892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:20Z","timestamp":1750197740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3436892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,8]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8,31]]}},"alternative-id":["10.1145\/3436892"],"URL":"https:\/\/doi.org\/10.1145\/3436892","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2021,5,8]]},"assertion":[{"value":"2019-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}