Heuristic search of exact biclusters in binary data
DOI10.34768/AMCS-2020-0013zbMATH Open1464.62326OpenAlexW3044552930MaRDI QIDQ2019711FDOQ2019711
Authors: Marcin Michalak, Roman Jaksik, Dominik Ślęzak 
Publication date: 22 April 2021
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://content.sciendo.com/view/journals/amcs/30/1/article-p161.xml
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10)
Cites Work
- Approximation algorithms for combinatorial problems
- Biclustering in data mining
- Title not available (Why is that?)
- Extracting conserved gene expression motifs from gene expression data
- Applied biclustering methods for big and high-dimensional data using R
- Boolean Representation for Exact Biclustering
- On Boolean representation of continuous data biclustering
Cited In (6)
- On Boolean representation of continuous data biclustering
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Bi-objective optimization of biclustering with binary data
- Boolean Representation for Exact Biclustering
- Search heuristics for module identification from biological high-thoughput data
- Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction
Uses Software
This page was built for publication: Heuristic search of exact biclusters in binary data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019711)
