{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:45:12Z","timestamp":1759938312801,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"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":[[2010,6,13]]},"DOI":"10.1145\/1810617.1810627","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"45-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Speak the same language with your friends"],"prefix":"10.1145","author":[{"given":"Kaipeng","family":"Liu","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China"}]},{"given":"Binxing","family":"Fang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China & Chinese Academic of Sciences, Beijing, China"}]},{"given":"Weizhe","family":"Zhang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Generalized cores. CoRR, cs.DS\/0202039","author":"Batagelj V.","year":"2002","unstructured":"V. Batagelj and M. Zaversnik . Generalized cores. CoRR, cs.DS\/0202039 , 2002 . V. Batagelj and M. Zaversnik. Generalized cores. CoRR, cs.DS\/0202039, 2002."},{"issue":"9","key":"e_1_3_2_1_2_1","first-page":"1505","article-title":"The matrix-forest theorem and measuring relations in small social groups","volume":"58","author":"Chebotarev P.","year":"1997","unstructured":"P. Chebotarev and E. Shamis . The matrix-forest theorem and measuring relations in small social groups . Automation and Remote Control , 58 ( 9 ): 1505 -- 1514 , 1997 . P. Chebotarev and E. Shamis. The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control, 58(9):1505--1514, 1997.","journal-title":"Automation and Remote Control"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242686"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11762256_31"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74976-9_52"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1487691.1487696"},{"key":"e_1_3_2_1_9_1","volume-title":"Paul Eos is Eighty, 2:1--46","author":"Laszlo L.","year":"1993","unstructured":"L. Laszlo . Random walks on graphs: A survey. Combinatorics , Paul Eos is Eighty, 2:1--46 , 1993 . L. Laszlo. Random walks on graphs: A survey. Combinatorics, Paul Eos is Eighty, 2:1--46, 1993."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78246-9_63"},{"key":"e_1_3_2_1_11_1","volume-title":"Generalized inverse of a matrix and its applications","author":"Rao C.","year":"1971","unstructured":"C. Rao and S. Mitra . Generalized inverse of a matrix and its applications . John Wiley and Sons , 1971 . C. Rao and S. Mitra. Generalized inverse of a matrix and its applications. John Wiley and Sons, 1971."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557100"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390423"}],"event":{"name":"HT '10: 21st ACM Conference on Hypertext and Hypermedia","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Toronto Ontario Canada","acronym":"HT '10"},"container-title":["Proceedings of the 21st ACM conference on Hypertext and hypermedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810617.1810627","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810617.1810627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:24Z","timestamp":1750245804000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810617.1810627"}},"subtitle":["augmenting tag recommenders with social relations"],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":13,"alternative-id":["10.1145\/1810617.1810627","10.1145\/1810617"],"URL":"https:\/\/doi.org\/10.1145\/1810617.1810627","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}