{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:17Z","timestamp":1750306397555,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T00:00:00Z","timestamp":1439164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF (CAREER award)","award":["CCF-1149756"],"award-info":[{"award-number":["CCF-1149756"]}]},{"name":"NSF","award":["CCF-1117055","CCF-1320746"],"award-info":[{"award-number":["CCF-1117055","CCF-1320746"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,10]]},"DOI":"10.1145\/2783258.2783398","type":"proceedings-article","created":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T15:38:27Z","timestamp":1438961907000},"page":"427-436","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming"],"prefix":"10.1145","author":[{"given":"Yangyang","family":"Hou","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joyce Jiyoung","family":"Whang","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inderjit S.","family":"Dhillon","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,8,10]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Mulan: A Java Library for Multi-Label Learning. http:\/\/mulan.sourceforge.net\/datasets.html.  Mulan: A Java Library for Multi-Label Learning. http:\/\/mulan.sourceforge.net\/datasets.html."},{"key":"e_1_3_2_2_2_1","unstructured":"Rat brains are basically wired up like miniature internets. www.engadget.com\/2015\/04\/09\/rat-brains-are-basically-wired-up-like-miniature-internets\/.  Rat brains are basically wired up like miniature internets. www.engadget.com\/2015\/04\/09\/rat-brains-are-basically-wired-up-like-miniature-internets\/."},{"key":"e_1_3_2_2_3_1","first-page":"1027","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arthur D.","year":"2007","unstructured":"D. Arthur and S. Vassilvitskii . K-means++: The advantages of careful seeding . In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages 1027 -- 1035 , 2007 . D. Arthur and S. Vassilvitskii. K-means++: The advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1027--1035, 2007."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081932"},{"key":"e_1_3_2_2_5_1","first-page":"37","article-title":"Learning multi-label scene classification","author":"Boutell M. R.","year":"2004","unstructured":"M. R. Boutell , J. Luo , X. Shen , and C. M. Brown . Learning multi-label scene classification . Pattern Recognition , 37 , 2004 . M. R. Boutell, J. Luo, X. Shen, and C. M. Brown. Learning multi-label scene classification. Pattern Recognition, 37, 2004.","journal-title":"Pattern Recognition"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"key":"e_1_3_2_2_8_1","volume-title":"Structural Holes: The Social Structure of Competition","author":"Burt R.","year":"1995","unstructured":"R. Burt . Structural Holes: The Social Structure of Competition . Harvard University Press , 1995 . R. Burt. Structural Holes: The Social Structure of Competition. Harvard University Press, 1995."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0916069"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2008.4761079"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339630"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_3_2_2_13_1","first-page":"681","volume-title":"Neural Information Processing Systems","author":"Elisseeff A.","year":"2001","unstructured":"A. Elisseeff and J. Weston . A kernel method for multi-labelled classification . In Neural Information Processing Systems , pages 681 -- 687 , 2001 . A. Elisseeff and J. Weston. A kernel method for multi-labelled classification. In Neural Information Processing Systems, pages 681--687, 2001."},{"key":"e_1_3_2_2_14_1","unstructured":"M. Grant and S. Boyd. CVX: Matlab software for disciplined convex programming version 2.1. http:\/\/cvxr.com\/cvx March 2014.  M. Grant and S. Boyd. CVX: Matlab software for disciplined convex programming version 2.1. http:\/\/cvxr.com\/cvx March 2014."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"e_1_3_2_2_16_1","first-page":"745","volume-title":"Proceedings of the 28th International Conference on Machine Learning","author":"Hocking T.","year":"2011","unstructured":"T. Hocking , J. Vert , A. Joulin , and F. R. Bach . Clusterpath: an algorithm for clustering using convex fusion penalties . In Proceedings of the 28th International Conference on Machine Learning , pages 745 -- 752 , 2011 . T. Hocking, J. Vert, A. Joulin, and F. R. Bach. Clusterpath: an algorithm for clustering using convex fusion penalties. In Proceedings of the 28th International Conference on Machine Learning, pages 745--752, 2011."},{"key":"e_1_3_2_2_17_1","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth D. E.","year":"1993","unstructured":"D. E. Knuth . The Stanford GraphBase: A Platform for Combinatorial Computing . Addison-Wesley , 1993 . D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, 1993."},{"key":"e_1_3_2_2_18_1","first-page":"235","volume-title":"International Conference on Artifical Intelligence and Statistics","author":"Kulis B.","year":"2007","unstructured":"B. Kulis , A. C. Surendran , and J. C. Platt . Fast low-rank semidefinite programming for embedding and clustering . In International Conference on Artifical Intelligence and Statistics , pages 235 -- 242 , 2007 . B. Kulis, A. C. Surendran, and J. C. Platt. Fast low-rank semidefinite programming for embedding and clustering. In International Conference on Artifical Intelligence and Statistics, pages 235--242, 2007."},{"key":"e_1_3_2_2_19_1","volume-title":"Finding statistically significant communities in networks. PLOS ONE, 6(4)","author":"Lancichinetti A.","year":"2011","unstructured":"A. Lancichinetti , F. Radicchi , J. Ramasco , and S. Fortunato . Finding statistically significant communities in networks. PLOS ONE, 6(4) , 2011 . A. Lancichinetti, F. Radicchi, J. Ramasco, and S. Fortunato. Finding statistically significant communities in networks. PLOS ONE, 6(4), 2011."},{"key":"e_1_3_2_2_20_1","first-page":"715","volume-title":"Advances in Neural Information Processing Systems","author":"Lang K.","year":"2005","unstructured":"K. Lang . Fixing two weaknesses of the spectral method . In Advances in Neural Information Processing Systems , pages 715 -- 722 , 2005 . K. Lang. Fixing two weaknesses of the spectral method. In Advances in Neural Information Processing Systems, pages 715--722, 2005."},{"key":"e_1_3_2_2_21_1","unstructured":"J. Leskovec. Stanford Network Analysis Project. http:\/\/snap.stanford.edu\/.  J. Leskovec. Stanford Network Analysis Project. http:\/\/snap.stanford.edu\/."},{"key":"e_1_3_2_2_22_1","volume-title":"Link\u00f6pings universitet","author":"Lindsten F.","year":"2011","unstructured":"F. Lindsten , H. Ohlsson , and L. Ljung . Just relax and come clustering! a convexification of k-means clustering. Technical report , Link\u00f6pings universitet , 2011 . F. Lindsten, H. Ohlsson, and L. Ljung. Just relax and come clustering! a convexification of k-means clustering. Technical report, Link\u00f6pings universitet, 2011."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2012.16"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"e_1_3_2_2_26_1","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006","unstructured":"J. Nocedal and S. J. Wright . Numerical Optimization . Springer , 2006 . J. Nocedal and S. J. Wright. Numerical Optimization. Springer, 2006."},{"key":"e_1_3_2_2_27_1","volume-title":"Advanced Optimization Laboratory","author":"Peng J.","year":"2005","unstructured":"J. Peng . 0--1 semidefinite programming for spectral clustering : Modeling and approximation. Technical report , Advanced Optimization Laboratory , McMaster University , 2005 . J. Peng. 0--1 semidefinite programming for spectral clustering: Modeling and approximation. Technical report, Advanced Optimization Laboratory, McMaster University, 2005."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/050641983"},{"key":"e_1_3_2_2_29_1","first-page":"325","volume-title":"International Conference on Music Information Retrieval","author":"Trohidis K.","year":"2008","unstructured":"K. Trohidis , G. Tsoumakas , G. Kalliris , and I. P. Vlahavas . Multi-label classification of music into emotions . In International Conference on Music Information Retrieval , pages 325 -- 330 , 2008 . K. Trohidis, G. Tsoumakas, G. Kalliris, and I. P. Vlahavas. Multi-label classification of music into emotions. In International Conference on Music Information Retrieval, pages 325--330, 2008."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.105"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505535"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/ng906"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433471"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/946247.946658"}],"event":{"name":"KDD '15: The 21th 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":"Sydney NSW Australia","acronym":"KDD '15"},"container-title":["Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2783258.2783398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:23Z","timestamp":1750223243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2783258.2783398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,10]]},"references-count":34,"alternative-id":["10.1145\/2783258.2783398","10.1145\/2783258"],"URL":"https:\/\/doi.org\/10.1145\/2783258.2783398","relation":{},"subject":[],"published":{"date-parts":[[2015,8,10]]},"assertion":[{"value":"2015-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}