{"volume":"abs/1903.10326","citation":{"ieee":"A. Amer Desouki, M. Röder, and A.-C. Ngonga Ngomo, “topFiberM: Scalable and Efficient Boolean Matrix Factorization,” <i>CoRR</i>, vol. abs/1903.10326, 2019.","apa":"Amer Desouki, A., Röder, M., &#38; Ngonga Ngomo, A.-C. (2019). topFiberM: Scalable and Efficient Boolean Matrix Factorization. <i>CoRR</i>, <i>abs/1903.10326</i>.","mla":"Amer Desouki, Abdelmoneim, et al. “TopFiberM: Scalable and Efficient Boolean Matrix Factorization.” <i>CoRR</i>, vol. abs/1903.10326, 2019.","chicago":"Amer Desouki, Abdelmoneim, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “TopFiberM: Scalable and Efficient Boolean Matrix Factorization.” <i>CoRR</i> abs/1903.10326 (2019).","bibtex":"@article{Amer Desouki_Röder_Ngonga Ngomo_2019, title={topFiberM: Scalable and Efficient Boolean Matrix Factorization}, volume={abs/1903.10326}, journal={CoRR}, author={Amer Desouki, Abdelmoneim and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2019} }","ama":"Amer Desouki A, Röder M, Ngonga Ngomo A-C. topFiberM: Scalable and Efficient Boolean Matrix Factorization. <i>CoRR</i>. 2019;abs/1903.10326.","short":"A. Amer Desouki, M. Röder, A.-C. Ngonga Ngomo, CoRR abs/1903.10326 (2019)."},"user_id":"15526","publication":"CoRR","title":"topFiberM: Scalable and Efficient Boolean Matrix Factorization","date_created":"2021-10-04T21:50:03Z","type":"journal_article","_id":"25391","language":[{"iso":"eng"}],"year":"2019","author":[{"first_name":"Abdelmoneim","last_name":"Amer Desouki","full_name":"Amer Desouki, Abdelmoneim"},{"first_name":"Michael","last_name":"Röder","full_name":"Röder, Michael"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","id":"65716"}],"status":"public","date_updated":"2022-01-06T06:57:02Z"}