Abstract
The biclustering methods have an increasing interest in the community of machine learning and data mining. These methods identify subsets of examples and features with interesting patterns. Recently ensemble approach has been applied to the biclustering problems with success. Their principle is to generate a set of different biclusters then aggregate them into only one. The crucial step of this approach is the consensus functions that compute the aggregation of the biclusters. We identify the main consensus functions commonly used in the clustering ensemble and show how to extend them in the biclustering context. We evaluate and analyze the performances of these consensus functions on several experiments based on both artificial and real data.
Author supplied keywords
Cite
CITATION STYLE
Hanczar Hanczar, B., & Nadif, M. (2015). Aggregation of biclustering solutions for ensemble approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9443, pp. 19–34). Springer Verlag. https://doi.org/10.1007/978-3-319-25530-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.