Enumerating all maximal biclusters in numerical datasets

DOI10.1016/j.ins.2016.10.029zbMath1429.68240arXiv1403.3562OpenAlexW2964274578MaRDI 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

zbMATH Keywords

efficient enumerationmaximal biclustersmultiple types of biclustersnumerical datasetsperfect and perturbed biclusters

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items (1)

Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices

Uses Software

• MTBA
• Algorithm 457
• BicPAM
• In-Close

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating all maximal biclusters in numerical datasets