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