From post

Parallelization of the GreConD Algorithm for Boolean Matrix Factorization.

, и . ICFCA, том 11511 из Lecture Notes in Computer Science, стр. 208-222. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

How to assess quality of BMF algorithms?, , и . IEEE Conf. on Intelligent Systems, стр. 227-233. IEEE, (2016)Special Issue on Concept Lattices and their Applications (CLA 2020)., , и . Int. J. Approx. Reason., (января 2024)Revisiting the GreCon Algorithm for Boolean Matrix Factorization., и . CLA, том 2668 из CEUR Workshop Proceedings, стр. 59-70. CEUR-WS.org, (2020)Boolean Factor Analysis of Multi-Relational Data., и . CLA, том 1062 из CEUR Workshop Proceedings, стр. 187-198. CEUR-WS.org, (2013)The 8M Algorithm from Today's Perspective., и . CLA, том 2123 из CEUR Workshop Proceedings, стр. 167-178. CEUR-WS.org, (2018)Decomposition of Boolean multi-relational data with graded relations., и . IEEE Conf. on Intelligent Systems, стр. 221-226. IEEE, (2016)Handling Noise in Boolean Matrix Factorization., и . IJCAI, стр. 1433-1439. ijcai.org, (2017)A Study of Boolean Matrix Factorization Under Supervised Settings., и . ICFCA, том 11511 из Lecture Notes in Computer Science, стр. 341-348. Springer, (2019)Can We Measure the Interpretability of Factors?, и . CLA, том 2123 из CEUR Workshop Proceedings, стр. 179-190. CEUR-WS.org, (2018)Boolean Matrix Decomposition by Formal Concept Sampling., и . CIKM, стр. 2243-2246. ACM, (2017)