{"type":"ScholarlyArticle","title":"Recent Developments in Boolean Matrix Factorization","authors":[{"name":"Pauli Miettinen","slug":"pauli-miettinen","given":"Pauli","family":"Miettinen","affiliation":"University of Eastern Finland , Kuopio , Finland"},{"name":"Stefan Neumann","slug":"stefan-neumann","given":"Stefan","family":"Neumann","affiliation":"University of Vienna , Vienna , Austria"}],"abstract":"The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra. While the problem is computationally hard, it is also attractive because the binary nature of the factor matrices makes them highly interpretable.  In the last decade, BMF has received a considerable amount of attention in the data mining and formal concept analysis communities and, more recently, the machine learning and the theory communities also started studying BMF. In this survey, we give a concise summary of the efforts of all of these communities and raise some open questions which in our opinion require further investigation.","doi":"10.24963/ijcai.2020/685","url":"https://ijcai.org/proceedings/2020/685","pdf":"https://ijcai.org/proceedings/2020/0685.pdf","markdown":"https://ijcai.org/proceedings/2020/685.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/685","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Survey track","track":"Survey track","number":685,"pages":{"first":4922,"last":4928},"keywords":["Machine Learning: general"],"videos":[],"references":[{"position":1,"raw":"[Ban et al., 2019] Frank Ban, Vijay Bhattiprolu, Karl Bring- mann, Pavel Kolev, Euiwoong Lee, and David P. Woodruff. A PTAS for ℓ p -low rank approximation. In SODA, pages 747-766, 2019.","title":"A PTAS for ℓ p -low rank approximation","authors":"Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P Woodruff","year":"2019","venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bělohlávek and Trnecka, 2015] Radim Bělohlávek and Mar- tin Trnecka. From-below approximations in Boolean matrix factorization: Geometry and new algorithm. J. Comput. Syst. Sci., 81(8):1678-1697, 2015.","title":"Radim Bělohlávek and Martin Trnecka. From-below approximations in Boolean matrix factorization: Geometry and new algorithm","authors":"Trnecka Bělohlávek","year":"2015","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bělohlávek and Trnecka, 2018] Radim Bělohlávek and Mar- tin Trnecka. A new algorithm for Boolean matrix factor- ization which admits overcovering. Discrete Appl. Math., 249:36-52, 2018.","title":"Radim Bělohlávek and Martin Trnecka. A new algorithm for Boolean matrix factorization which admits overcovering","authors":"Trnecka Bělohlávek","year":"2018","venue":"Discrete Appl. Math","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bělohlávek and Vychodil, 2010] Radim Bělohlávek and Vilém Vychodil. Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comput. Syst. Sci., 76(1):3-20, 2010.","title":"Radim Bělohlávek and Vilém Vychodil. Discovery of optimal factors in binary data via a novel method of matrix decomposition","authors":"Vychodil Bělohlávek","year":"2010","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bhattacharya et al., 2019] Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, and Amit Kumar. Streaming PTAS for binary ℓ 0 -low rank approximation. CoRR, abs/1909.11744, 2019.","title":"Streaming PTAS for binary ℓ 0 -low rank approximation","authors":"Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chandran et al., 2016] L. Sunil Chandran, Davis Issac, and Andreas Karrenbauer. On the parameterized complexity of biclique cover and partition. In IPEC, pages 11:1-11:13, 2016.","title":"On the parameterized complexity of biclique cover and partition","authors":"L Sunil Chandran, Davis Issac, Andreas Karrenbauer","year":"2016","venue":"IPEC","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Davenport et al., 2014] Mark A. Davenport, Yaniv Plan, Ewout van den Berg, and Mary Wootters. 1-bit matrix completion. Inf. Inference, 3(3):189-223, 2014.","title":"1-bit matrix completion","authors":"Mark A Davenport, Yaniv Plan, Ewout Van Den, Mary Berg, Wootters","year":"2014","venue":"Inf. Inference","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dhillon, 2001] Inderjit S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, pages 269-274, 2001.","title":"Co-clustering documents and words using bipartite spectral graph partitioning","authors":"S Inderjit, Dhillon","year":"2001","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Ene et al., 2008] Alina Ene, William Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, and Robert E Tarjan. Fast exact and heuristic methods for role minimization problems. In SACMAT, pages 1-10, 2008.","title":"Fast exact and heuristic methods for role minimization problems","authors":"Alina Ene, William Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert E Tarjan","year":"2008","venue":"SACMAT","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Erdős and Miettinen, 2013] Dóra Erdős and Pauli Miettinen. Walk'n'Merge: A scalable algorithm for Boolean tensor factorization. In ICDM, pages 1037-1042, 2013.","title":"Walk'n'Merge: A scalable algorithm for Boolean tensor factorization","authors":"Miettinen Erdős, Dóra Erdős, Pauli Miettinen","year":"2013","venue":"ICDM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fomin et al., 2019] Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh. Approximation schemes for low-rank binary matrix approx- imation problems. ACM Trans. Algorithms, 16(1):12:1- 12:39, 2019.","title":"Approximation schemes for low-rank binary matrix approximation problems","authors":"V Fedor, Petr A Fomin, Daniel Golovach, Fahad Lokshtanov, Saket Panolan, Saurabh","year":"2019","venue":"ACM Trans. Algorithms","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fomin et al., 2020] Fedor V. Fomin, Petr A. Golovach, and Fahad Panolan. Parameterized low-rank binary matrix ap- proximation. Data Min. Knowl. Discov., 34(2):478-532, 2020.","title":"Parameterized low-rank binary matrix approximation","authors":"V Fedor, Petr A Fomin, Fahad Golovach, Panolan","year":"2020","venue":"Data Min. Knowl. Discov","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Frolov et al., 2014] Alexander A. Frolov, Dušan Húsek, and Pavel Y. Polyakov. Two expectation-maximization al- gorithms for Boolean factor analysis. Neurocomputing, 130:83-97, 2014.","title":"Two expectation-maximization algorithms for Boolean factor analysis","authors":"Alexander A Frolov, Dušan Húsek, Pavel Y Polyakov","year":"2014","venue":"Neurocomputing","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Ganter and Wille, 1999] Bernhard Ganter and Rudolf Wille. Formal Concept Analysis: Mathematical Foundations. Springer, Berlin, 1999.","title":"Formal Concept Analysis: Mathematical Foundations","authors":"Wille Ganter, Bernhard Ganter, Rudolf Wille","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gramm et al., 2008] Jens Gramm, Jiong Guo, Falk Hüffner, and Rolf Niedermeier. Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics, 13, 2008.","title":"Data reduction and exact algorithms for clique cover","authors":"Gramm","year":"2008","venue":"ACM J. Exp. Algorithmics","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Haddad et al., 2018] Ali Haddad, Foroogh Shamsi, Li Zhu, and Laleh Najafizadeh. Identifying dynamics of brain func- tion via Boolean matrix factorization. In ACSSC, pages 661-665, 2018.","title":"Identifying dynamics of brain function via Boolean matrix factorization","authors":"Ali Haddad, Foroogh Shamsi, Li Zhu, Laleh Najafizadeh","year":"2018","venue":"ACSSC","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hashemi et al., 2018] Soheil Hashemi, Hokchhay Tann, and Sherief Reda. BLASYS: approximate logic synthesis using Boolean matrix factorization. In DAC, pages 55:1-55:6, 2018.","title":"BLASYS: approximate logic synthesis using Boolean matrix factorization","authors":"Soheil Hashemi, Hokchhay Tann, Sherief Reda","year":"2018","venue":"DAC","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Hess and Morik, 2017] Sibylle Hess and Katharina Morik. C-SALT: Mining class-specific alterations in Boolean ma- trix factorization. In ECMLPKDD, pages 547-563, 2017.","title":"C-SALT: Mining class-specific alterations in Boolean matrix factorization","authors":"Morik Hess, Sibylle Hess, Katharina Morik","year":"2017","venue":"ECMLPKDD","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hess et al., 2017] Sibylle Hess, Katharina Morik, and Nico Piatkowski. The PRIMPING routine-Tiling through prox- imal alternating linearized minimization. Data Min. Knowl. Discov., 31(4):1090-1131, 2017.","title":"The PRIMPING routine-Tiling through proximal alternating linearized minimization","authors":"Sibylle Hess, Katharina Morik, Nico Piatkowski","year":"2017","venue":"Data Min. Knowl. Discov","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hess et al., 2018] Sibylle Hess, Nico Piatkowski, and Katha- rina Morik. The trustworthy pal: Controlling the false discovery rate in Boolean matrix factorization. In SDM, pages 405-413, 2018.","title":"The trustworthy pal: Controlling the false discovery rate in Boolean matrix factorization","authors":"Sibylle Hess, Nico Piatkowski, Katharina Morik","year":"2018","venue":"SDM","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Karaev et al., 2015] Sanjar Karaev, Pauli Miettinen, and Jilles Vreeken. Getting to know the unknown unknowns: Destructive-noise resistant Boolean matrix factorization. In SDM, pages 325-333, 2015.","title":"Getting to know the unknown unknowns: Destructive-noise resistant Boolean matrix factorization","authors":"Karaev","year":"2015","venue":"SDM","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kim, 1982] Ki Hang Kim. Boolean matrix theory and appli- cations. Marcel Dekker, New York, 1982.","title":"Boolean matrix theory and applications","authors":"Ki Hang, Kim","year":"1982","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kocayusufoglu et al., 2018] Furkan Kocayusufoglu, Minh X. Hoang, and Ambuj K. Singh. Summarizing network processes with network-constrained Boolean matrix factorization. In ICDM, pages 237-246, 2018.","title":"Summarizing network processes with network-constrained Boolean matrix factorization","authors":"Furkan Kocayusufoglu, Minh X Hoang, Ambuj K Singh","year":"2018","venue":"ICDM","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Kumar et al., 2019] Ravi Kumar, Rina Panigrahy, Ali Rahimi, and David P. Woodruff. Faster algorithms for binary matrix factorization. In ICML, pages 3551-3559, 2019.","title":"Faster algorithms for binary matrix factorization","authors":"Ravi Kumar, Rina Panigrahy, Ali Rahimi, David P Woodruff","year":"2019","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Liang and Lu, 2019] Lifan Liang and Songjian Lu. Noisy and incomplete boolean matrix factorization via expectation maximization. CoRR, abs/1905.12766, 2019.","title":"Noisy and incomplete boolean matrix factorization via expectation maximization","authors":"Lu ; ] Lifan Liang, Songjian Liang, Lu","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Liang et al., 2020] Lifan Liang, Kunju Zhu, and Songjian Lu. BEM: Mining coregulation patterns in transcriptomics via Boolean matrix factorization. Bioinformatics, 2020.","title":"BEM: Mining coregulation patterns in transcriptomics via Boolean matrix factorization","authors":"Lifan Liang, Kunju Zhu, Songjian Lu","year":"2020","venue":"Bioinformatics","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Lim et al., 2015] Shiau Hong Lim, Yudong Chen, and Huan Xu. A convex optimization framework for bi-clustering. In ICML, pages 1679-1688, 2015.","title":"A convex optimization framework for bi-clustering","authors":"Hong Shiau, Yudong Lim, Huan Chen, Xu","year":"2015","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Lucchese et al., 2013] Claudio Lucchese, Salvatore Orlando, and Raffaele Perego. A unifying framework for mining approximate top-k binary patterns. IEEE Trans. Knowl. Data Eng., 26(12):2900-2913, 2013.","title":"A unifying framework for mining approximate top-k binary patterns","authors":"Claudio Lucchese, Salvatore Orlando, Raffaele Perego","year":"2013","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Miettinen and Vreeken, 2014] Pauli Miettinen and Jilles Vreeken. MDL4BMF: Minimum description length for Boolean matrix factorization. ACM Trans. Knowl. Discov. Data, 8(4), 2014.","title":"MDL4BMF: Minimum description length for Boolean matrix factorization","authors":"Vreeken Miettinen, Pauli Miettinen, Jilles Vreeken","year":"2014","venue":"ACM Trans. Knowl. Discov. Data","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Miettinen et al., 2006] Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, and Heikki Mannila. The discrete basis problem. In PKDD, page 335-346, 2006.","title":"The discrete basis problem","authors":"Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila","year":"2006","venue":"PKDD","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Miettinen et al., 2008] Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, and Heikki Mannila. The discrete basis problem. IEEE Trans. Knowl. Data Eng., 20(10):1348-1362, 2008.","title":"The discrete basis problem","authors":"Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila","year":"2008","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Miettinen, 2009] Pauli Miettinen. Matrix Decomposition Methods for Data Mining: Computational Complexity and Algorithms. PhD thesis, University of Helsinki, 2009.","title":"Matrix Decomposition Methods for Data Mining: Computational Complexity and Algorithms","authors":"Pauli Miettinen","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Miettinen, 2011] Pauli Miettinen. Boolean tensor factoriza- tions. In ICDM, pages 447-456, 2011.","title":"Boolean tensor factorizations","authors":"Pauli Miettinen","year":"2011","venue":"ICDM","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Miettinen, 2012] Pauli Miettinen. On finding joint subspace Boolean matrix factorizations. In SDM, pages 954-965, 2012.","title":"On finding joint subspace Boolean matrix factorizations","authors":"Pauli Miettinen","year":"2012","venue":"SDM","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Monson et al., 1995] Sylvia D. Monson, Norman J. Pullman, and Rolf Rees. A survey of clique and biclique coverings and factorizations of (0,1)-matrices. Bull. ICA, 14:17-86, 1995.","title":"A survey of clique and biclique coverings and factorizations of (0,1)-matrices","authors":"Sylvia D Monson, Norman J Pullman, Rolf Rees","year":"1995","venue":"Bull. ICA","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Ndaoud et al., 2019] Mohamed Ndaoud, Suzanne Sigalla, and Alexandre B. Tsybakov. Improved clustering algo- rithms for the bipartite stochastic block model. CoRR, abs/1911.07987, 2019.","title":"Improved clustering algorithms for the bipartite stochastic block model","authors":"Mohamed Ndaoud, Suzanne Sigalla, Alexandre B Tsybakov","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Neumann, 2018] Stefan Neumann. Bipartite stochastic block models with tiny clusters. In NeurIPS, pages 3871-3881, 2018.","title":"Bipartite stochastic block models with tiny clusters","authors":"Stefan Neumann","year":"2018","venue":"NeurIPS","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Orlin, 1977] James Orlin. Contentment in graph theory: Cov- ering graphs with cliques. Indag. Math., 80(5):406-424, 1977.","title":"Contentment in graph theory: Covering graphs with cliques","authors":"James Orlin","year":"1977","venue":"Indag. Math","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Ravanbakhsh et al., 2016] Siamak Ravanbakhsh, Barnabás Póczos, and Russell Greiner. Boolean matrix factorization and noisy completion via message passing. In ICML, pages 945-954, 2016.","title":"Boolean matrix factorization and noisy completion via message passing","authors":"Siamak Ravanbakhsh, Barnabás Póczos, Russell Greiner","year":"2016","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Rissanen, 1978] Jorma Rissanen. Modeling by shortest data description. Automatica, 14(5):465-471, 1978.","title":"Modeling by shortest data description","authors":"Jorma Rissanen","year":"1978","venue":"Automatica","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Rukat et al., 2017a] Tammo Rukat, Christopher C. Holmes, Michalis K. Titsias, and Christopher Yau. Bayesian Boolean matrix factorisation. In ICML, pages 2969-2978, 2017.","title":"Bayesian Boolean matrix factorisation","authors":"Rukat","year":"2017","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Rukat et al., 2017b] Tammo Rukat, Dustin Lange, and Cédric Archambeau. An interpretable latent variable model for attribute applicability in the Amazon catalogue. In NIPS Symp. Interpret. ML, 2017.","title":"An interpretable latent variable model for attribute applicability in the Amazon catalogue","authors":"Rukat","year":"2017","venue":"NIPS Symp. Interpret. ML","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Rukat et al., 2018] Tammo Rukat, Christopher C. Holmes, and Christopher Yau. Probabilistic Boolean tensor decom- position. In ICML, pages 4410-4419, 2018.","title":"Probabilistic Boolean tensor decomposition","authors":"Tammo Rukat, Christopher C Holmes, Christopher Yau","year":"2018","venue":"ICML","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Siblini et al., 2019] Wissam Siblini, Pascale Kuntz, and Frank Meyer. A review on dimensionality reduction for multi-label classification. IEEE Trans. Knowl. Data Eng., pages 1-1, 2019.","title":"A review on dimensionality reduction for multi-label classification","authors":"Siblini","year":"2019","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Tatti and Miettinen, 2019] Nikolaj Tatti and Pauli Miettinen. Boolean matrix factorization meets consecutive ones prop- erty. In SDM, pages 729-737, 2019.","title":"Boolean matrix factorization meets consecutive ones property","authors":"Miettinen Tatti, Nikolaj Tatti, Pauli Miettinen","year":"2019","venue":"SDM","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Tyukin et al., 2014] Andrey Tyukin, Stefan Kramer, and Jörg Wicker. BMaD -A Boolean matrix decomposition framework. In ECML PKDD, pages 481-484, 2014.","title":"BMaD -A Boolean matrix decomposition framework","authors":"Andrey Tyukin, Stefan Kramer, Jörg Wicker","year":"2014","venue":"ECML PKDD","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Vaidya et al., 2007] Jaideep Vaidya, Vijayalakshmi Atluri, and Qi Guo. The role mining problem: Finding a minimal descriptive set of roles. In SACMAT, pages 175-184, 2007.","title":"The role mining problem: Finding a minimal descriptive set of roles","authors":"Jaideep Vaidya, Vijayalakshmi Atluri, Qi Guo","year":"2007","venue":"SACMAT","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[van den Broeck and Darwiche, 2013] Guy van den Broeck and Adnan Darwiche. On the complexity and approxima- tion of binary evidence in lifted inference. In NIPS, pages 2868-2876, 2013.","title":"On the complexity and approximation of binary evidence in lifted inference","authors":"Broeck Van Den, Darwiche ; Guy Van Den Broeck, Adnan Darwiche","year":"2013","venue":"NIPS","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[Wicker et al., 2012] Jörg Wicker, Bernhard Pfahringer, and Stefan Kramer. Multi-label classification using Boolean matrix decomposition. In SAC, pages 179-186, 2012.","title":"Multi-label classification using Boolean matrix decomposition","authors":"Wicker","year":"2012","venue":"SAC","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Xu et al., 2014] Jiaming Xu, Rui Wu, Kai Zhu, Bruce E. Hajek, R. Srikant, and Lei Ying. Jointly clustering rows and columns of binary matrices: Agorithms and trade-offs. In SIGMETRICS, pages 29-41, 2014.","title":"Jointly clustering rows and columns of binary matrices: Agorithms and trade-offs","authors":"Jiaming Xu, Rui Wu, Kai Zhu, Bruce E Hajek, R Srikant, Lei Ying","year":"2014","venue":"SIGMETRICS","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Zha et al., 2001] Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming Gu, and Horst D. Simon. Bipartite graph partitioning and data clustering. In CIKM, pages 25-32, 2001.","title":"Bipartite graph partitioning and data clustering","authors":"Hongyuan Zha, Xiaofeng He, H Q Chris, Ming Ding, Horst D Gu, Simon","year":"2001","venue":"CIKM","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Zhou and Amini, 2018] Zhixin Zhou and Arash A. Amini. Optimal bipartite network clustering. CoRR, abs/1803.06031, 2018.","title":"Optimal bipartite network clustering","authors":"Zhixin Zhou, Arash A Amini","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Zhou and Amini, 2019] Zhixin Zhou and Arash A. Amini. Analysis of spectral clustering algorithms for community detection: The general bipartite setting. J. Mach. Learn. Res., 20:47:1-47:47, 2019.","title":"Analysis of spectral clustering algorithms for community detection: The general bipartite setting","authors":"Zhixin Zhou, Arash A Amini","year":"2019","venue":"J. Mach. Learn. Res","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}