Scalable biclustering — the future of big data exploration? | Zendy

Patryk Orzechowski | Zendy; Krzysztof Boryczko | Zendy; Jason H. Moore | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Scalable biclustering — the future of big data exploration?

Author(s) -

Patryk Orzechowski,

Krzysztof Boryczko,

Jason H. Moore

Publication year - 2019

Publication title -

gigascience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 2.947

H-Index - 54

ISSN - 2047-217X

DOI - 10.1093/gigascience/giz078

Subject(s) - biclustering , computer science , big data , scalability , data science , cluster analysis , data mining , artificial intelligence , database , cure data clustering algorithm , correlation clustering

Biclustering is a technique of discovering local similarities within data. For many years the complexity of the methods and parallelization issues limited its application to big data problems. With the development of novel scalable methods, biclustering has finally started to close this gap. In this paper we discuss the caveats of biclustering and present its current challenges and guidelines for practitioners. We also try to explain why biclustering may soon become one of the standards for big data analytics.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research