Biclustering, which can be defined as the simultaneous clustering of rows and columns in a data matrix, has received increasing attention in recent years, being applied in many scientific scenarios (e.g. bioinformatics, text analysis, computer vision). This paper proposes a novel biclustering approach, which extends the dominant-set clustering algorithm to the biclustering case. In particular, we propose a new way of representing the problem, encoded as a graph, which allows to exploit dominant set to analyse both rows and columns simultaneously. The proposed approach has been tested by using a well known synthetic microarray benchmark, with encouraging results.
CITATION STYLE
Denitto, M., Bicego, M., Farinelli, A., & Pelillo, M. (2018). Dominant set biclustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10746 LNCS, pp. 49–61). Springer Verlag. https://doi.org/10.1007/978-3-319-78199-0_4
Mendeley helps you to discover research relevant for your work.