TY - GEN
T1 - Consensus Algorithm for Bi-clustering Analysis
AU - Foszner, Paweł
AU - Labaj, Wojciech
AU - Polanski, Andrzej
AU - Staniszewski, Michal
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - Bi-clustering is an unsupervised data mining technique, which involves concurrent clustering of rows and columns of a two-dimensional data matrix. It has been demonstrated that bi-clustering may allow accurate and comprehensive mining of information, important for many practical applications. Numerous algorithms for data bi-clustering were proposed in the literature, based on different approaches and leading, in general, to different outputs. In this paper we propose a consensus method for combining outputs of many bi-clustering algorithms for improved quality of predictions. The proposed algorithm includes two steps. The first step, “assignment”, leads to detecting groups of bi-clusters of high similarity and the second step, “trimming”, results in transforming a group of similar bi-clusters into one bi-cluster of high quality. We demonstrate, on the basis of both simulated and real datasets, that using our algorithm highly improves quality of bi-clustering. We also provide an easy to use software tool, which includes implementations of several bi-clustering algorithms and our consensus method.
AB - Bi-clustering is an unsupervised data mining technique, which involves concurrent clustering of rows and columns of a two-dimensional data matrix. It has been demonstrated that bi-clustering may allow accurate and comprehensive mining of information, important for many practical applications. Numerous algorithms for data bi-clustering were proposed in the literature, based on different approaches and leading, in general, to different outputs. In this paper we propose a consensus method for combining outputs of many bi-clustering algorithms for improved quality of predictions. The proposed algorithm includes two steps. The first step, “assignment”, leads to detecting groups of bi-clusters of high similarity and the second step, “trimming”, results in transforming a group of similar bi-clusters into one bi-cluster of high quality. We demonstrate, on the basis of both simulated and real datasets, that using our algorithm highly improves quality of bi-clustering. We also provide an easy to use software tool, which includes implementations of several bi-clustering algorithms and our consensus method.
KW - Bi-clustering
KW - Consensus methods
KW - Ensemble methods
KW - Machine learning
UR - https://www.scopus.com/pages/publications/85134302061
U2 - 10.1007/978-3-031-08754-7_61
DO - 10.1007/978-3-031-08754-7_61
M3 - Conference contribution
AN - SCOPUS:85134302061
SN - 9783031087530
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 557
EP - 570
BT - Computational Science - ICCS 2022, 22nd International Conference, Proceedings
A2 - Groen, Derek
A2 - de Mulatier, Clélia
A2 - Krzhizhanovskaya, Valeria V.
A2 - Sloot, Peter M.A.
A2 - Paszynski, Maciej
A2 - Dongarra, Jack J.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 22nd Annual International Conference on Computational Science, ICCS 2022
Y2 - 21 June 2022 through 23 June 2022
ER -