{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T00:11:37Z","timestamp":1773360697004,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["HKSAR, GRF No. 615113"],"award-info":[{"award-number":["HKSAR, GRF No. 615113"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098063","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"635-644","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":462,"title":["Meta-Graph Based Recommendation Fusion over Heterogeneous Information Networks"],"prefix":"10.1145","author":[{"given":"Huan","family":"Zhao","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Quanming","family":"Yao","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Jianda","family":"Li","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Yangqiu","family":"Song","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Dik Lun","family":"Lee","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835799"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.598228"},{"key":"e_1_3_2_2_3_1","volume-title":"Mining electronic health records in the genomics era. PLoS Computational Biology, 8(12)","author":"J. C. D.","year":"2012","unstructured":"J. C. D. Chapter 13 : Mining electronic health records in the genomics era. PLoS Computational Biology, 8(12) , 2012 . J. C. D. Chapter 13: Mining electronic health records in the genomics era. PLoS Computational Biology, 8(12), 2012."},{"key":"e_1_3_2_2_4_1","first-page":"91","volume-title":"WSDM","author":"Deepak A.","year":"2010","unstructured":"A. Deepak and B. Chen . fLDA: Matrix factorization through latent dirichlet allocation . In WSDM , pages 91 -- 100 , 2010 . A. Deepak and B. Chen. fLDA: Matrix factorization through latent dirichlet allocation. In WSDM, pages 91--100, 2010."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623623"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498247"},{"key":"e_1_3_2_2_7_1","volume-title":"Librec: A Java library for recommender systems","author":"Guo G.","year":"2015","unstructured":"G. Guo , J. Zhang , Z. Sun , and N. Yorke-Smith . Librec: A Java library for recommender systems ., 2015 . G. Guo, J. Zhang, Z. Sun, and N. Yorke-Smith. Librec: A Java library for recommender systems., 2015."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433467"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939815"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959134"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487577"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505531"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5205-8"},{"key":"e_1_3_2_2_17_1","first-page":"379","volume-title":"NIPS","author":"Li H.","year":"2015","unstructured":"H. Li and Z. Lin . Accelerated proximal gradient methods for nonconvex programming . In NIPS , pages 379 -- 387 , 2015 . H. Li and Z. Lin. Accelerated proximal gradient methods for nonconvex programming. In NIPS, pages 379--387, 2015."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983730"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645728"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507163"},{"key":"e_1_3_2_2_22_1","first-page":"1257","volume-title":"NIPS","author":"Mnih A.","year":"2007","unstructured":"A. Mnih and R. Salakhutdinov . Probabilistic matrix factorization . In NIPS , pages 1257 -- 1264 , 2007 . A. Mnih and R. Salakhutdinov. Probabilistic matrix factorization. In NIPS, pages 1257--1264, 2007."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"e_1_3_2_2_24_1","volume-title":"Sojka. Software Framework for Topic Modelling with Large Corpora","author":"R.","year":"2010","unstructured":"R. v Rehr uv rek and P . Sojka. Software Framework for Topic Modelling with Large Corpora , May 2010 . R. v Rehr uv rek and P. Sojka. Software Framework for Topic Modelling with Large Corpora, May 2010."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168752.2168771"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718498"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297920"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247618"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806528"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2481244.2481248"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124373"},{"issue":"11","key":"e_1_3_2_2_32_1","first-page":"992","article-title":"Meta path-based top-k similarity search in heterogeneous information networks","volume":"4","author":"Sun Y.","year":"2011","unstructured":"Y. Sun , J. Han , X. Yan , P. S. Yu , and T. Wu. PathSim : Meta path-based top-k similarity search in heterogeneous information networks . VLDB , 4 ( 11 ): 992 -- 1003 , 2011 . Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu. PathSim: Meta path-based top-k similarity search in heterogeneous information networks. VLDB, 4(11):992--1003, 2011.","journal-title":"VLDB"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513092.2500492"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959160"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783374"},{"key":"e_1_3_2_2_36_1","first-page":"4002","volume-title":"AAAI","author":"Yao Q.","year":"2015","unstructured":"Q. Yao and J. Kwok . Accelerated inexact soft-impute for fast large-scale matrix completion . In AAAI , pages 4002 -- 4008 , 2015 . Q. Yao and J. Kwok. Accelerated inexact soft-impute for fast large-scale matrix completion. In AAAI, pages 4002--4008, 2015."},{"key":"e_1_3_2_2_37_1","first-page":"2645","volume-title":"ICML","author":"Yao Q.","year":"2016","unstructured":"Q. Yao and J. Kwok . Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity . In ICML , pages 2645 -- 2654 , 2016 . Q. Yao and J. Kwok. Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity. In ICML, pages 2645--2654, 2016."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009962"},{"key":"e_1_3_2_2_39_1","first-page":"27","article-title":"Collaborative filtering with entity similarity regularization in heterogeneous information networks","author":"Yu X.","year":"2013","unstructured":"X. Yu , X. Ren , Q. Gu , Y. Sun , and J. Han . Collaborative filtering with entity similarity regularization in heterogeneous information networks . IJCAI HINA , 27 , 2013 . X. Yu, X. Ren, Q. Gu, Y. Sun, and J. Han. Collaborative filtering with entity similarity regularization in heterogeneous information networks. IJCAI HINA, 27, 2013.","journal-title":"IJCAI HINA"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556259"},{"key":"e_1_3_2_2_41_1","first-page":"352","volume-title":"NIPS","author":"Yuan L.","year":"2011","unstructured":"L. Yuan , J. Liu , and J. Ye . Efficient methods for overlapping group lasso . In NIPS , pages 352 -- 360 , 2011 . L. Yuan, J. Liu, and J. Ye. Efficient methods for overlapping group lasso. In NIPS, pages 352--360, 2011."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623645"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098063","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:26Z","timestamp":1750217426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":43,"alternative-id":["10.1145\/3097983.3098063","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098063","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}