{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:49Z","timestamp":1750220329723,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["19H04117"],"award-info":[{"award-number":["19H04117"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,10,26]]},"DOI":"10.1145\/3459637.3482258","type":"proceedings-article","created":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T18:34:11Z","timestamp":1635618851000},"page":"504-513","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast and Accurate Anchor Graph-based Label Prediction"],"prefix":"10.1145","author":[{"given":"Yasuhiro","family":"Fujiwara","sequence":"first","affiliation":[{"name":"NTT Communication Science Laboratories, Kanagawa, Japan"}]},{"given":"Yasutoshi","family":"Ida","sequence":"additional","affiliation":[{"name":"NTT Computer and Data Science Laboratories, Tokyo, Japan"}]},{"given":"Atsutoshi","family":"Kumagai","sequence":"additional","affiliation":[{"name":"NTT Computer and Data Science Laboratories, Tokyo, Japan"}]},{"given":"Sekitoshi","family":"Kanai","sequence":"additional","affiliation":[{"name":"NTT Computer and Data Science Laboratories, Tokyo, Japan"}]},{"given":"Naonori","family":"Ueda","sequence":"additional","affiliation":[{"name":"NTT Communication Science Laboratories, Kyoto, Japan"}]}],"member":"320","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1273496.1273503"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.5555\/1248547.1248632"},{"volume-title":"Pattern Recognition and Machine Learning","author":"Bishop Christopher M.","key":"e_1_3_2_1_3_1"},{"volume-title":"Blitzstein and Jessica Hwang","year":"2014","author":"Joseph","key":"e_1_3_2_1_4_1"},{"unstructured":"James W. Demmel. 2017. Applied Numerical Linear Algebra. Orient Blackswan.  James W. Demmel. 2017. Applied Numerical Linear Algebra. Orient Blackswan.","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1390156.1390191"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/TPAMI.2013.57"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.5555\/2984093.2984152"},{"volume-title":"FLAG: Faster Learning on Anchor Graph with Label Predictor Optimization","year":"2017","author":"Fu W.","key":"e_1_3_2_1_9_1"},{"volume-title":"Fast Similarity Computation for t-SNE","author":"Fujiwara Yasuhiro","doi-asserted-by":"crossref","key":"e_1_3_2_1_10_1","DOI":"10.1109\/ICDE51399.2021.00149"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.14778\/3447689.3447696"},{"doi-asserted-by":"crossref","unstructured":"Yasuhiro Fujiwara Atsutoshi Kumagai Sekitoshi Kanai Yasutoshi Ida and Naonori Ueda. 2020. Efficient Algorithm for the b-Matching Graph. In KDD. ACM 187--197.  Yasuhiro Fujiwara Atsutoshi Kumagai Sekitoshi Kanai Yasutoshi Ida and Naonori Ueda. 2020. Efficient Algorithm for the b-Matching Graph. In KDD. ACM 187--197.","key":"e_1_3_2_1_12_1","DOI":"10.1145\/3394486.3403061"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1137\/090771806"},{"volume-title":"Kipf and Max Welling","year":"2017","author":"Thomas","key":"e_1_3_2_1_14_1"},{"unstructured":"Branislav Kveton Michal Valko Ali Rahimi and Ling Huang. 2010. Semi-Supervised Learning with Max-Margin Graph Cuts. In AISTATS. 421--428.  Branislav Kveton Michal Valko Ali Rahimi and Ling Huang. 2010. Semi-Supervised Learning with Max-Margin Graph Cuts. In AISTATS. 421--428.","key":"e_1_3_2_1_15_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/3104322.3104409"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/JPROC.2012.2197809"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.5555\/3104482.3104483"},{"volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov Yurii","doi-asserted-by":"crossref","key":"e_1_3_2_1_19_1","DOI":"10.1007\/978-1-4419-8853-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/1403886"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1504\/IJDMMM.2019.098969"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5555\/1007752"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/s11222-007-9033-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1109\/TKDE.2007.190672"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/TKDE.2017.2654445"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1109\/TKDE.2016.2535367"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/3097983.3098142"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/TNNLS.2014.2315526"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.5555\/2981345.2981386"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.5555\/3041838.3041953"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.5555\/1717872"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"CIKM '21","name":"CIKM '21: The 30th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Queensland Australia"},"container-title":["Proceedings of the 30th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459637.3482258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3459637.3482258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:12Z","timestamp":1750191132000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459637.3482258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":31,"alternative-id":["10.1145\/3459637.3482258","10.1145\/3459637"],"URL":"https:\/\/doi.org\/10.1145\/3459637.3482258","relation":{},"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"2021-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}