Name
Abstract | ||
|---|---|---|
•We present algorithms for enumerating all maximal biclusters in numerical datasets.•They are the first ones in the literature with polynomial time per pattern.•The enumeration is efficient, complete, correct and non-redundant.•The experiments emphasize the relevance of enumerative approaches over heuristics.•Our family of algorithms is ready for practical applications requiring enumeration. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ins.2016.10.029 | Information Sciences |
Keywords | Field | DocType |
Efficient enumeration,Maximal biclusters,Numerical datasets,Multiple types of biclusters,Perfect and perturbed biclusters | Row,Discrete mathematics,Data mining,Heuristic,Theoretical computer science,Biclustering,Time complexity,Formal concept analysis,Mathematics,Scalability | Journal |
Volume | ISSN | Citations |
379 | 0020-0255 | 2 |
PageRank | References | Authors |
0.39 | 46 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rosana Veroneze | 1 | 6 | 2.51 |
| Arindam Banerjee | 2 | 4716 | 233.98 |
| Fernando J. Von Zuben | 3 | 831 | 81.83 |