{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T19:41:31Z","timestamp":1772048491379,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,8,21]],"date-time":"2005-08-21T00:00:00Z","timestamp":1124582400000},"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":[[2005,8,21]]},"DOI":"10.1145\/1134271.1134280","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"58-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":117,"title":["Mining hidden community in heterogeneous social networks"],"prefix":"10.1145","author":[{"given":"Deng","family":"Cai","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Zheng","family":"Shao","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Xiaofei","family":"He","sequence":"additional","affiliation":[{"name":"University of Chicago"}]},{"given":"Xifeng","family":"Yan","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]}],"member":"320","published-online":{"date-parts":[[2005,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Xerox Parc","author":"Adamic L. A.","year":"2002","unstructured":"L. A. Adamic and E. Adar . Friends and neighbors on the web. Technical report , Xerox Parc , 2002 . L. A. Adamic and E. Adar. Friends and neighbors on the web. Technical report, Xerox Parc, 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775227"},{"key":"e_1_3_2_1_3_1","volume-title":"Linear Programming and Network Flows","author":"Bazaraa M.","year":"2004","unstructured":"M. Bazaraa , J. Jarvis , and H. Sherali . Linear Programming and Network Flows . Wiley , 3 rd edition edition, 2004 . M. Bazaraa, J. Jarvis, and H. Sherali. Linear Programming and Network Flows. Wiley, 3rd edition edition, 2004.","edition":"3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"Bjorck A.","year":"1996","unstructured":"A. Bjorck . Numerical Methods for Least Squares Problems . SIAM , 1996 . A. Bjorck. Numerical Methods for Least Squares Problems. SIAM, 1996."},{"key":"e_1_3_2_1_5_1","volume-title":"Computer Science Department, UIUC, UIUCDCS-R-2005-2538","author":"Cai D.","year":"2005","unstructured":"D. Cai , Z. Shao , X. He , X. Yan , and J. Han . Mining hidden community in heterogeneous social networks. Technical report , Computer Science Department, UIUC, UIUCDCS-R-2005-2538 , May , 2005 . D. Cai, Z. Shao, X. He, X. Yan, and J. Han. Mining hidden community in heterogeneous social networks. Technical report, Computer Science Department, UIUC, UIUCDCS-R-2005-2538, May, 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/294469.294486"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_1_8_1","volume-title":"Pattern Classification","author":"Duda R. O.","year":"2000","unstructured":"R. O. Duda , P. E. Hart , and D. G. Stork . Pattern Classification . Wiley-Interscience , Hoboken, NJ , 2 nd edition, 2000 . R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley-Interscience, Hoboken, NJ, 2nd edition, 2000.","edition":"2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347121"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/276627.276652"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245123"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"e_1_3_2_1_15_1","volume-title":"North Holland","author":"Lovasz L.","year":"1986","unstructured":"L. Lovasz and M. Plummer . Matching Theory. Akad\u00e9miai Kiad\u00f3 , North Holland , Budapest , 1986 . L. Lovasz and M. Plummer. Matching Theory. Akad\u00e9miai Kiad\u00f3, North Holland, Budapest, 1986."},{"key":"e_1_3_2_1_16_1","first-page":"60","article-title":"The small world problem","volume":"2","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The small world problem . Psychology Today , 2 : 60 -- 67 , 1967 . S. Milgram. The small world problem. Psychology Today, 2:60--67, 1967.","journal-title":"Psychology Today"},{"key":"e_1_3_2_1_17_1","volume-title":"The pagerank citation ranking: Bringing order to the web. Technical report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The pagerank citation ranking: Bringing order to the web. Technical report , Stanford University , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University, 1998."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/163381.163402"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"}],"event":{"name":"KDD05: The Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois","acronym":"KDD05"},"container-title":["Proceedings of the 3rd international workshop on Link discovery"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1134271.1134280","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1134271.1134280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:30Z","timestamp":1750259190000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1134271.1134280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8,21]]},"references-count":21,"alternative-id":["10.1145\/1134271.1134280","10.1145\/1134271"],"URL":"https:\/\/doi.org\/10.1145\/1134271.1134280","relation":{},"subject":[],"published":{"date-parts":[[2005,8,21]]},"assertion":[{"value":"2005-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}