{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:17Z","timestamp":1750308617042,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T00:00:00Z","timestamp":1328659200000},"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":[[2012,2,8]]},"DOI":"10.1145\/2124295.2124363","type":"proceedings-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T13:21:44Z","timestamp":1329225704000},"page":"553-562","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["On clustering heterogeneous social media objects with outlier links"],"prefix":"10.1145","author":[{"given":"Guo-Jun","family":"Qi","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Charu C.","family":"Aggarwal","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Hawthorne, NY, USA"}]},{"given":"Thomas S.","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,2,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2001.990994"},{"key":"e_1_3_2_1_2_1","author":"Blei D. M.","year":"2003","unstructured":"D. M. Blei , A. Y. Ng , and M. I. Jordan . Latent dirichlet allocation. Journal of Machine Learning Research, (3):993--1022 , January 2003 . D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. Journal of Machine Learning Research, (3):993--1022, January 2003.","journal-title":"Journal of Machine Learning Research, (3):993--1022"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027527.1027747"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150467"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.849770"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281212"},{"key":"e_1_3_2_1_7_1","volume-title":"Phys. Rev. E 70, 066111","author":"Clauset A.","year":"2004","unstructured":"A. Clauset , M. E. J. Newman , and C. Moore . Finding community structure in very large networks . In Phys. Rev. E 70, 066111 , 2004 . A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. In Phys. Rev. E 70, 066111, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133214"},{"key":"e_1_3_2_1_9_1","author":"Dempster A. P.","year":"1977","unstructured":"A. P. Dempster , N. M. Laird , and D. B. Rubin . Maximum-likelihood from incomplete data via the em algorithm. J. Royal Statist. Soc., B(39):1--38 , 1977 . A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum-likelihood from incomplete data via the em algorithm. J. Royal Statist. Soc., B(39):1--38, 1977.","journal-title":"Maximum-likelihood from incomplete data via the em algorithm. J. Royal Statist. Soc., B(39):1--38"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101149.1101167"},{"key":"e_1_3_2_1_11_1","volume-title":"Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association, (85(410)):398--409","author":"Gelfand A. E.","year":"1990","unstructured":"A. E. Gelfand and A. F. M. Smith . Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association, (85(410)):398--409 , 1990 . A. E. Gelfand and A. F. M. Smith. Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association, (85(410)):398--409, 1990."},{"key":"e_1_3_2_1_12_1","volume-title":"VLDB","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Discovering large dense subgraphs in massive graphs . In VLDB , 2005 . D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.860593"},{"key":"e_1_3_2_1_14_1","volume-title":"Algorithms for clustering data","author":"Jain A.","year":"1988","unstructured":"A. Jain and R. C. Dubes . Algorithms for clustering data . In Prentice Hall , 1988 . A. Jain and R. C. Dubes. Algorithms for clustering data. In Prentice Hall, 1988."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526934"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018430.1021397"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367541"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557101"},{"key":"e_1_3_2_1_19_1","volume-title":"August","author":"Shi J.","year":"2000","unstructured":"J. Shi and J. Malik . Normalized cuts and image segmentation , August 2000 . J. Shi and J. Malik. Normalized cuts and image segmentation, August 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/258525.258535"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557120"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277825"}],"event":{"name":"WSDM'12: Fifth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Seattle Washington USA","acronym":"WSDM'12"},"container-title":["Proceedings of the fifth ACM international conference on Web search and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2124295.2124363","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2124295.2124363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:33Z","timestamp":1750273653000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2124295.2124363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,8]]},"references-count":23,"alternative-id":["10.1145\/2124295.2124363","10.1145\/2124295"],"URL":"https:\/\/doi.org\/10.1145\/2124295.2124363","relation":{},"subject":[],"published":{"date-parts":[[2012,2,8]]},"assertion":[{"value":"2012-02-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}