Enumerating all maximal biclusters in numerical datasets
From MaRDI portal
Publication:2292925
DOI10.1016/j.ins.2016.10.029zbMath1429.68240arXiv1403.3562MaRDI QIDQ2292925
Arindam Banerjee, Rosana Veroneze, Fernando José Von Zuben
Publication date: 6 February 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3562
efficient enumeration; maximal biclusters; multiple types of biclusters; numerical datasets; perfect and perturbed biclusters
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
68T30: Knowledge representation
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical aspects of concept analysis
- A note on the problem of reporting maximal cliques
- Enumeration aspects of maximal cliques and bicliques
- Enumerating all connected maximal common subgraphs in two graphs
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Biclustering Numerical Data in Formal Concept Analysis
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
- Algorithm Theory - SWAT 2004
- Algorithm 457: finding all cliques of an undirected graph