Search Results for author:
Found 3 papers, 1 papers with code
New advances in enumerative biclustering algorithms with online partitioning
This paper further extends RIn-Close_CVC, a biclustering algorithm capable of performing an efficient, complete, correct and non-redundant enumeration of maximal biclusters with constant values on columns in numerical datasets.
RIn-Close_CVC2: an even more efficient enumerative algorithm for biclustering of numerical datasets
Despite RIn-Close_CVC has all these outstanding properties, it has a high computational cost in terms of memory usage because it must keep a symbol table in memory to prevent a maximal bicluster to be found more than once.
On bicluster aggregation and its benefits for enumerative solutions
Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
