Enumerating all maximal biclusters in numerical datasets
详细信息 查看全文
- 作者：Rosana Veroneze ; a ; veroneze@dca.fee.unicamp.br" class="auth_mail" title="E-mail the corresponding author ; rveroneze@gmail.com" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Arindam BanerjeebAuthor Vitae ; Fernando J. Von ZubenaAuthor Vitae
- 关键词：Efficient enumeration ; Maximal biclusters ; Numerical datasets ; Multiple types of biclusters ; Perfect and perturbed biclusters
- 刊名：Information Sciences
- 出版年：2017
- 出版时间：10 February 2017
- 年：2017
- 卷：379
- 期：Complete
- 页码：288-309
- 全文大小：1448 K
文摘
- label">•
We present algorithms for enumerating all maximal biclusters in numerical datasets.
- label">•
They are the first ones in the literature with polynomial time per pattern.
- label">•
The enumeration is efficient, complete, correct and non-redundant.
- label">•
The experiments emphasize the relevance of enumerative approaches over heuristics.
- label">•
Our family of algorithms is ready for practical applications requiring enumeration.