2 research outputs found

    Dominant Set Biclustering

    No full text
    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 result

    Biclustering with Dominant Sets

    No full text
    Biclustering can be defined as the simultaneous clustering of rows and columns in a data matrix and it has been recently applied to many scientific scenarios such as bioinformatics, text analysis and computer vision to name a few. In this paper we propose a novel biclustering approach, that is based on the concept of dominant-set clustering and extends such algorithm to the biclustering problem. In more detail, we propose a novel encoding of the biclustering problem as a graph so to use the dominant set concept to analyse rows and columns simultaneously. Moreover, we extend the Dominant Set Biclustering approach to facilitate the insertion of prior knowledge that may be available on the domain. We evaluated the proposed approach on a synthetic benchmark and on two computer vision tasks: multiple structure recovery and region-based correspondence. The empirical evaluation shows that the method achieves promising results that are comparable to the state-of-the-art and that outperforms competitors in various cases
    corecore