Abstract
Biclustering is considered as the method of finding two-dimensional subgroups in a matrix of scalars. The paper introduces a new approach to biclustering continuous matrices on the basis of boolean function analysis, where it is assumed that found bicluster must fulfill two criteria: it should cover the specified value called a centre and the maximal difference between the mentioned centre and cells of bicluster should not exceed an assumed margin. The paper also presents mathematical proofs of the correctness of such approach. The application of new approach for biclustering was applied on artificial data.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Brown, F.M.: Boolean Reasoning. Springer, New York (1990)
Busygin, S., Prokopyev, O., Pardalos, P.M.: Biclustering in data mining. Comput. Oper. Res. 35(9), 2964–2987 (2008)
Chagoyen, M., Carmona-Saez, P., Shatkay, H., Carazo, J.M., Pascual-Montano, A.: Discovering semantic features in the literature: a foundation for building functional associations. BMC Bioinform. 7(1), 41 (2006)
Hartigan, J.A.: Direct clustering of a data matrix. J. Am. Stat. Assoc. 67(337), 123–129 (1972)
Johnson, D.: Approximation algorithms for combinational problems. J. Comput. Syst. Sci. 9, 256–278 (1974)
Latkowski, R.: On decomposition for incomplete data. Fundam. Informaticae 54, 1–16 (2003)
Michalak, M., Jaksik, R., Ślęzak, D.: Heuristic search of exact biclusters in binary data. Int. J. Appl. Math. Comput. Sci. (2019, to appear)
Michalak, M., Ślęzak, D.: Boolean representation for exact biclustering. Fundam. Informaticae 161(3), 275–297 (2018)
Michalak, M., Ślęzak, D.: On Boolean representation of continuous data biclustering. Fundam. Informaticae 167(3), 193–217 (2019)
Nguyen, H.S.: Approximate Boolean reasoning: foundations and applications in data mining. In: Transactions on Rough Sets V, pp. 334–506 (2006)
Orzechowski, P., Boryczko, K.: Text mining with hybrid biclustering algorithms. Lecture Notes in Computer Science, vol. 9693, pp. 102–113 (2016)
Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: a survey. Handb. Comput. Mol. Biol. 9(1–20), 122–124 (2005)
Acknowledgements
The work was carried out within the statutory research project of the Institute of Informatics, BK-204/RAU2/2019.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Michalak, M. (2020). Induction of Centre-Based Biclusters in Terms of Boolean Reasoning. In: Gruca, A., Czachórski, T., Deorowicz, S., Harężlak, K., Piotrowska, A. (eds) Man-Machine Interactions 6. ICMMI 2019. Advances in Intelligent Systems and Computing, vol 1061 . Springer, Cham. https://doi.org/10.1007/978-3-030-31964-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-31964-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31963-2
Online ISBN: 978-3-030-31964-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)