{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T04:59:52Z","timestamp":1664427592542},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T00:00:00Z","timestamp":1587772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T00:00:00Z","timestamp":1587772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00574-4","type":"journal-article","created":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T05:03:03Z","timestamp":1587790983000},"page":"1995-2028","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite communities via spectral partitioning"],"prefix":"10.1007","volume":"44","author":[{"given":"Kelly B.","family":"Yancey","sequence":"first","affiliation":[]},{"given":"Matthew P.","family":"Yancey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,25]]},"reference":[{"key":"574_CR1","doi-asserted-by":"crossref","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 U.S. election: divided they blog. In: Proceedings of the 3rd international workshop on link discovery (New York, NY, USA), LinkKDD \u201905. ACM, pp\u00a036\u201343","DOI":"10.1145\/1134271.1134277"},{"issue":"5","key":"574_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2775105","volume":"62","author":"S Arora","year":"2015","unstructured":"Arora S, Barak B, Steurer D (2015) Subexponential algorithms for unique games and related problems. J ACM 62(5):25 Art. 42","journal-title":"J ACM"},{"key":"574_CR3","unstructured":"Atay FM, Liu S (2014) Cheeger constants, structural balance, and spectral clustering analysis for signed graphs. Max Planck Institute for Mathematics in the Sciences (preprint)"},{"issue":"1","key":"574_CR4","doi-asserted-by":"publisher","first-page":"160168","DOI":"10.1112\/S0025579312001064","volume":"59","author":"K Ball","year":"2013","unstructured":"Ball K, Barthe F, Bednorz W, Oleszkiewicz K, Wolff P (2013) L1-smoothing for the ornsteinuhlenbeck semigroup. Mathematika 59(1):160168","journal-title":"Mathematika"},{"issue":"4","key":"574_CR5","doi-asserted-by":"publisher","first-page":"787","DOI":"10.4310\/CAG.2013.v21.n4.a2","volume":"21","author":"F Bauer","year":"2013","unstructured":"Bauer F, Jost J (2013) Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplace operator. Commun Anal Geom 21(4):787\u2013845","journal-title":"Commun Anal Geom"},{"issue":"8","key":"574_CR6","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1101\/gr.117176.110","volume":"21","author":"J Bellay","year":"2011","unstructured":"Bellay J, Atluri G, Sing TL, Toufighi K, Costanzo M, Ribeiro PSM, Pandey G, Baller J, VanderSluis B, Michaut M, Han S, Kim P, Brown GW, Andrews BJ, Boone C, Kumar V, Myers CL (2011) Putting genetic interactions in context through a global modular decomposition. Genome Res 21(8):1375\u20131387","journal-title":"Genome Res"},{"key":"574_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms1063","volume":"1","author":"M Bogun\u00e1","year":"2010","unstructured":"Bogun\u00e1 M, Papadopoulos F, Krioukov D (2010) Sustaining the internet with hyperbolic mapping. Nat Commun 1:1\u20138","journal-title":"Nat Commun"},{"key":"574_CR8","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7 A, Henning M, Ilya S, Peter S, Christian S (2016) Recent advances in graph partitioning, algorithm engineering. Lecture notes in computer science, vol 9220. Springer, Cham, pp\u00a0117\u2013158","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"574_CR9","doi-asserted-by":"crossref","unstructured":"Charikar M, Chekuri C, Goel A, Guha S, Plotkin S (1998) Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th annual symposium on foundations of computer science (Washington, DC, USA), FOCS \u201998. IEEE Computer Society, p\u00a0379","DOI":"10.1109\/SFCS.1998.743488"},{"key":"574_CR10","unstructured":"Chung F (2007) Four cheeger-type inequalities for graph partitioning algorithms. In: Proceedings of ICCM, pp 751\u2013772"},{"issue":"5964","key":"574_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1126\/science.1180823","volume":"327","author":"M Costanzo","year":"2010","unstructured":"Costanzo M, Baryshnikova A, Bellay J, Kim Y, Spear ED, Sevier CS, Ding H, Koh JLY, Toufighi K, Mostafavi S, Prinz J, Robert PS, Onge BVS, Makhnevych T, Vizeacoumar FJ, Alizadeh S, Bahr S, Brost RL, Chen Y, Cokol M, Deshpande R, Li Z, Lin Z-Y, Liang W, Marback M, Paw J, Luis B-JS, Shuteriqi E, Tong AHY, van Dyk N, Wallace IM, Whitney JA, Weirauch MT, Zhong G, Zhu H, Houry WA, Brudno M, Ragibizadeh S, Papp B, P\u00e1l C, Roth FP, Giaever G, Nislow C, Troyanskaya OG, Bussey H, Bader GD, Gingras A-C, Morris QD, Kim PM, Kaiser CA, Myers CL, Andrews BJ, Boone C (2010) The genetic landscape of a cell. Science 327(5964):425\u2013431","journal-title":"Science"},{"key":"574_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.gs.2008.001","volume":"1","author":"R De Wolf","year":"2008","unstructured":"De Wolf R (2008) A brief introduction to Fourier analysis on the Boolean cube. Theor Comput Graduate Surv 1:1\u201320. https:\/\/doi.org\/10.4086\/toc.gs.2008.001","journal-title":"Theor Comput Graduate Surv"},{"key":"574_CR13","unstructured":"Gallier J (2016) Spectral theory of unsigned and signed graphs. Applications to graph clustering: a survey. ArXiv e-prints"},{"key":"574_CR14","doi-asserted-by":"crossref","unstructured":"Gharan SO, Trevisan L (2014) Partitioning into expanders. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. ACM, New York, pp\u00a01256\u20131266","DOI":"10.1137\/1.9781611973402.93"},{"issue":"5","key":"574_CR15","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604\u2013632","journal-title":"J ACM"},{"key":"574_CR16","unstructured":"Kolev P, Mehlhorn K (2016) A note on spectral clustering. In: 24th annual European symposium on algorithms, LIPIcs. Leibniz Int. Proc. Inform., vol\u00a057, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, p.\u00a0Art. No. 57, 14"},{"key":"574_CR17","doi-asserted-by":"crossref","unstructured":"Lee JR, Gharan SO, Trevisan L (2012) Multi-way spectral partitioning and higher-order Cheeger inequalities. In: STOC\u201912\u2014proceedings of the 2012 ACM symposium on theory of computing. ACM, New York, pp\u00a01117\u20131130","DOI":"10.1145\/2213977.2214078"},{"key":"574_CR18","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data. Accessed 2014"},{"key":"574_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining (New York, NY, USA), KDD \u201905. ACM, pp\u00a0177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"574_CR20","doi-asserted-by":"crossref","unstructured":"Li A, Peng P (2013) Detecting and characterizing small dense bipartite-like subgraphs by the bipartiteness ratio measure, algorithms and computation. Lecture notes in computer science, vol 8283. Springer, Heidelberg, pp\u00a0655\u2013665","DOI":"10.1007\/978-3-642-45030-3_61"},{"issue":"12","key":"574_CR21","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/TKDE.2007.190660","volume":"19","author":"J Li","year":"2007","unstructured":"Li J, Liu G, Li H, Wong L (2007) Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans Knowl Data Eng 19(12):1625\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"574_CR22","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.aim.2014.09.023","volume":"268","author":"S Liu","year":"2015","unstructured":"Liu S (2015) Multi-way dual Cheeger constants and spectral bounds of graphs. Adv Math 268:306\u2013338","journal-title":"Adv Math"},{"issue":"4","key":"574_CR23","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.ipm.2012.12.009","volume":"49","author":"D Lo","year":"2013","unstructured":"Lo D, Surian D, Prasetyo PK, Zhang K, Lim EP (2013) Mining direct antagonistic communities in signed social networks. Inf Process Manag 49(4):773\u2013791","journal-title":"Inf Process Manag"},{"key":"574_CR24","doi-asserted-by":"crossref","unstructured":"Louis A, Raghavendra P, Tetali P, Vempala S (2012) Many sparse cuts via higher eigenvalues. In: STOC\u201912\u2014proceedings of the 2012 ACM symposium on theory of computing. ACM, New York, pp\u00a01131\u20131140","DOI":"10.1145\/2213977.2214079"},{"issue":"2","key":"574_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejor.2010.08.012","volume":"211","author":"MCV Nascimento","year":"2011","unstructured":"Nascimento MCV, de Carvalho ACPLF (2011) Spectral methods for graph clustering\u2013a survey. Eur J Oper Res 211(2):221\u2013231","journal-title":"Eur J Oper Res"},{"key":"574_CR26","unstructured":"Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Proceedings of the 14th international conference on neural information processing systems: natural and synthetic (Cambridge, MA, USA), NIPS\u201901. MIT Press, pp\u00a0849\u2013856"},{"key":"574_CR27","unstructured":"O\u2019Donnell R (2007) course notes scribed by Ryan Williams and Ryan O\u2019Donnel. Lectures 15 and 16. http:\/\/www.cs.cmu.edu\/~odonnell\/boolean-analysis\/"},{"key":"574_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell R (2014) Analysis of Boolean functions. Cambridge University Press, New York"},{"issue":"2","key":"574_CR29","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/15M1047209","volume":"46","author":"R Peng","year":"2017","unstructured":"Peng R, Sun H, Zanetti L (2017) Partitioning well-clustered graphs: spectral clustering works!. SIAM J Comput 46(2):710\u2013743","journal-title":"SIAM J Comput"},{"key":"574_CR30","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-13672-6_42","volume-title":"Advances in knowledge discovery and data mining","author":"BA Prakash","year":"2010","unstructured":"Prakash BA, Sridharan A, Seshadri M, Machiraju S, Faloutsos C (2010) Eigenspokes: surprising patterns and scalable community chipping in large graphs. In: Zaki MJ, Yu JX, Ravindran B, Pudi V (eds) Advances in knowledge discovery and data mining. Springer, Berlin, pp 435\u2013448"},{"issue":"4","key":"574_CR31","doi-asserted-by":"publisher","first-page":"1878","DOI":"10.1214\/11-AOS887","volume":"39","author":"K Rohe","year":"2011","unstructured":"Rohe K, Chatterjee S, Bin Y (2011) Spectral clustering and the high-dimensional stochastic blockmodel. Ann Stat 39(4):1878\u20131915","journal-title":"Ann Stat"},{"issue":"6","key":"574_CR32","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1137\/090773714","volume":"41","author":"L Trevisan","year":"2012","unstructured":"Trevisan L (2012) Max cut and the smallest eigenvalue. SIAM J Comput 41(6):1769\u20131786","journal-title":"SIAM J Comput"},{"key":"574_CR33","unstructured":"Verma D, Meila M (2003) A comparison of spectral clustering algorithms. Technical report, University of Washington CSE"},{"key":"574_CR34","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-13657-3_10","volume-title":"Advances in knowledge discovery and data mining","author":"K Zhang","year":"2010","unstructured":"Zhang K, Lo D, Lim EP (2010) Mining antagonistic communities from social networks. In: Zaki MJ, Yu JX, Ravindran B, Pudi V (eds) Advances in knowledge discovery and data mining. Springer, Berlin, pp 68\u201380"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00574-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00574-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00574-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:47:43Z","timestamp":1664354863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00574-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,25]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["574"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00574-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,25]]},"assertion":[{"value":"25 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}