{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:09Z","timestamp":1750308789478,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T00:00:00Z","timestamp":1279929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["OTKA NK 72845NKFP-07-A2 TEXTREND"],"award-info":[{"award-number":["OTKA NK 72845NKFP-07-A2 TEXTREND"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,24]]},"DOI":"10.1145\/1830252.1830261","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"62-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["An efficient block model for clustering sparse graphs"],"prefix":"10.1145","author":[{"given":"\u00c1d\u00e1m","family":"Gyenge","sequence":"first","affiliation":[{"name":"Computer and Automation Research Institute, Hungarian Academy of Sciences"}]},{"given":"Janne","family":"Sinkkonen","sequence":"additional","affiliation":[{"name":"Xtract Ltd., Helsinki, Finland"}]},{"given":"Andr\u00e1s A.","family":"Bencz\u00far","sequence":"additional","affiliation":[{"name":"Computer and Automation Research Institute, Hungarian Academy of Sciences"}]}],"member":"320","published-online":{"date-parts":[[2010,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134283"},{"key":"e_1_3_2_1_2_1","volume-title":"On Smoothing and Inference for Topic Models. In UAI 2009: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence","author":"Asuncion A.","year":"2009","unstructured":"A. Asuncion , M. Welling , P. Smyth , and Y. W. Teh . On Smoothing and Inference for Topic Models. In UAI 2009: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence , 2009 . A. Asuncion, M. Welling, P. Smyth, and Y. W. Teh. On Smoothing and Inference for Topic Models. In UAI 2009: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, 2009."},{"key":"e_1_3_2_1_3_1","volume-title":"Bayesian clustering of huge friendship networks. Master's thesis","author":"Aukia J.","year":"2007","unstructured":"J. Aukia . Bayesian clustering of huge friendship networks. Master's thesis , Helsinki University of Technology , 2007 . J. Aukia. Bayesian clustering of huge friendship networks. Master's thesis, Helsinki University of Technology, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1451983.1451991"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_6_1","volume-title":"LDA: Collapsed Gibbs sampling methods for topic models","author":"Chang J.","year":"2010","unstructured":"J. Chang . LDA: Collapsed Gibbs sampling methods for topic models , 2010 . R package version 1.2. J. Chang. LDA: Collapsed Gibbs sampling methods for topic models, 2010. R package version 1.2."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0362-2"},{"key":"e_1_3_2_1_9_1","volume-title":"Geographically organized small communities and the hardness of clustering social networks. Annals of Information Systems - Data Mining for Social Network Analyis, to appear.","author":"Kurucz M.","year":"2010","unstructured":"M. Kurucz and A. A. Bencz\u00far . Geographically organized small communities and the hardness of clustering social networks. Annals of Information Systems - Data Mining for Social Network Analyis, to appear. Available at http:\/\/datamining.sztaki.hu\/files\/AoIS.pdf, 2010 . M. Kurucz and A. A. Bencz\u00far. Geographically organized small communities and the hardness of clustering social networks. Annals of Information Systems - Data Mining for Social Network Analyis, to appear. Available at http:\/\/datamining.sztaki.hu\/files\/AoIS.pdf, 2010."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of SNAKDD","author":"Kurucz M.","year":"2008","unstructured":"M. Kurucz , A. A. Bencz\u00far , and A. Pereszl\u00e9nyi . Large-scale principal component analysis on LiveJournal friends network . Proceedings of SNAKDD , 2008 . M. Kurucz, A. A. Bencz\u00far, and A. Pereszl\u00e9nyi. Large-scale principal component analysis on LiveJournal friends network. Proceedings of SNAKDD, 2008."},{"key":"e_1_3_2_1_11_1","first-page":"715","volume-title":"Fixing two weaknesses of the spectral method","author":"Lang Kevin","year":"2006","unstructured":"Kevin Lang . Fixing two weaknesses of the spectral method . In Y. Weiss, B. Sch\u00f6lkopf, and J. Platt, editors, NIPS '05: Advances in Neural Information Processing Systems 18, pages 715 -- 722 , Cambridge, MA, 2006 . MIT Press . Kevin Lang. Fixing two weaknesses of the spectral method. In Y. Weiss, B. Sch\u00f6lkopf, and J. Platt, editors, NIPS '05: Advances in Neural Information Processing Systems 18, pages 715--722, Cambridge, MA, 2006. MIT Press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.118703"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102424"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401957"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00124-y"},{"key":"e_1_3_2_1_17_1","volume-title":"MLG 2009, The 7th International Workshop on Mining and Learning with Graphs","author":"Parkkinen J.","year":"2009","unstructured":"J. Parkkinen , A. Gyenge , J. Sinkkonen , and S. Kaski . A block model suitable for sparse graphs . In MLG 2009, The 7th International Workshop on Mining and Learning with Graphs , 2009 . J. Parkkinen, A. Gyenge, J. Sinkkonen, and S. Kaski. A block model suitable for sparse graphs. In MLG 2009, The 7th International Workshop on Mining and Learning with Graphs, 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401960"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281262"},{"key":"e_1_3_2_1_20_1","volume-title":"Working Notes of the 5th International Workshop on Mining and Learning with Graphs (MLG'07)","author":"Sinkkonen J.","year":"2007","unstructured":"J. Sinkkonen , J. Aukia , and S. Kaski . Inferring vertex properties from topology in large networks . In Working Notes of the 5th International Workshop on Mining and Learning with Graphs (MLG'07) , 2007 . J. Sinkkonen, J. Aukia, and S. Kaski. Inferring vertex properties from topology in large networks. In Working Notes of the 5th International Workshop on Mining and Learning with Graphs (MLG'07), 2007."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISI.2007.379553"}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Washington, D.C.","acronym":"KDD '10"},"container-title":["Proceedings of the Eighth Workshop on Mining and Learning with Graphs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830252.1830261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830252.1830261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:52Z","timestamp":1750278172000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830252.1830261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,24]]},"references-count":21,"alternative-id":["10.1145\/1830252.1830261","10.1145\/1830252"],"URL":"https:\/\/doi.org\/10.1145\/1830252.1830261","relation":{},"subject":[],"published":{"date-parts":[[2010,7,24]]},"assertion":[{"value":"2010-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}