On Boolean representation of continuous data biclustering

DOI10.3233/FI-2019-1814MaRDI QIDQ5229299zbMATH OpenOpenAlexWikidataFDO

Authors Marcin Michalak, Dominik Ślęzak

Publication date 14 August 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1814

zbMATH Keywords

discernibility functionprime implicantsBoolean reasoningbiclustercontinuous data biclusteringdissimilarity biclusterssimilarity biclusters

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Boolean programming (90C09)

Recommendations

• Boolean Representation for Exact Biclustering
• Heuristic search of exact biclusters in binary data
• Biclustering in data mining
• Biclustering numerical data in formal concept analysis
• A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood

Cited in

(5)

• Biclustering numerical data in formal concept analysis
• FuBiNFS -- fuzzy biclustering neuro-fuzzy system
• Boolean Representation for Exact Biclustering
• Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction
• Heuristic search of exact biclusters in binary data

This page was built for publication: On Boolean representation of continuous data biclustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229299)