{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T10:24:59Z","timestamp":1778840699415,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Army Research Laboratory","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3358163","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"2113-2116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Similarity-Aware Network Embedding with Self-Paced Learning"],"prefix":"10.1145","author":[{"given":"Chao","family":"Huang","sequence":"first","affiliation":[{"name":"University of Notre Dame, South Bend, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoxu","family":"Shi","sequence":"additional","affiliation":[{"name":"LinkedIn, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuchao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Notre Dame, South Bend, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitesh V.","family":"Chawla","sequence":"additional","affiliation":[{"name":"University of Notre Dame, South Bend, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Yoshua Bengio J\u00e9r\u00f4me Louradour Ronan Collobert and Jason Weston. 2009. Curriculum learning. In ICML. ACM 41--48.  Yoshua Bengio J\u00e9r\u00f4me Louradour Ronan Collobert and Jason Weston. 2009. Curriculum learning. In ICML. ACM 41--48.","DOI":"10.1145\/1553374.1553380"},{"key":"e_1_3_2_1_2_1","series-title":"Series B (methodological)","volume-title":"Maximum likelihood from incomplete data via the EM algorithm. Journal of the royal statistical society","author":"Dempster Arthur P","year":"1977","unstructured":"Arthur P Dempster , Nan M Laird , and Donald B Rubin . 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the royal statistical society . Series B (methodological) ( 1977 ), 1--38. Arthur P Dempster, Nan M Laird, and Donald B Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the royal statistical society. Series B (methodological) (1977), 1--38."},{"key":"e_1_3_2_1_3_1","volume-title":"JMLR","volume":"9","author":"Fan Rong-En","year":"2008","unstructured":"Rong-En Fan , Kai-Wei Chang , Cho-Jui Hsieh , and etc. 2008 . LIBLINEAR: A library for large linear classification . JMLR , Vol. 9 , Aug (2008), 1871--1874. Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, and etc. 2008. LIBLINEAR: A library for large linear classification. JMLR , Vol. 9, Aug (2008), 1871--1874."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. ACM 855--864.  Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. ACM 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_5_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik","year":"2014","unstructured":"Diederik Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_6_1","unstructured":"M Pawan Kumar Benjamin Packer and Daphne Koller. 2010. Self-paced learning for latent variable models. In NIPS. 1189--1197.  M Pawan Kumar Benjamin Packer and Daphne Koller. 2010. Self-paced learning for latent variable models. In NIPS. 1189--1197."},{"key":"e_1_3_2_1_7_1","unstructured":"Daniel D Lee and H Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In NIPS. 556--562.  Daniel D Lee and H Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In NIPS. 556--562."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_9_1","volume-title":"Online Learning of Multi-scale Network Embeddings","author":"Perozzi Bryan","unstructured":"Bryan Perozzi , Vivek Kulkarni , and etc. 2017. Don't Walk , Skip! : Online Learning of Multi-scale Network Embeddings . In ASONAM. ACM\/IEEE , 258--265. Bryan Perozzi, Vivek Kulkarni, and etc. 2017. Don't Walk, Skip!: Online Learning of Multi-scale Network Embeddings. In ASONAM. ACM\/IEEE, 258--265."},{"key":"e_1_3_2_1_10_1","volume-title":"BPR: Bayesian personalized ranking from implicit feedback","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle , Christoph Freudenthaler , and etc. 2009 . BPR: Bayesian personalized ranking from implicit feedback . In UAI. AUAI Press , 452--461. Steffen Rendle, Christoph Freudenthaler, and etc. 2009. BPR: Bayesian personalized ranking from implicit feedback. In UAI. AUAI Press, 452--461."},{"key":"e_1_3_2_1_11_1","unstructured":"Yizhou Sun Jiawei Han and etc. 2012. When will it happen?: relationship prediction in heterogeneous information networks. In WSDM . ACM 663--672.  Yizhou Sun Jiawei Han and etc. 2012. When will it happen?: relationship prediction in heterogeneous information networks. In WSDM . ACM 663--672."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","location":"Beijing China","acronym":"CIKM '19","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358163","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3358163","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3358163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:11Z","timestamp":1750202591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":12,"alternative-id":["10.1145\/3357384.3358163","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3358163","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}