Exemplar-based robust coherent biclustering

Kewei Tu, Xixiu Ouyang, Dingyi Han, Yong Yu, Vasant Honavar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the data matrix that optimize a desired objective function. In coherent biclustering, the objective function contains a coherence measure of the biclusters. We introduce a novel formulation of the coherent biclustering problem and use it to derive two algorithms. The first algorithm is based on loopy message passing; and the second relies on a greedy strategy yielding an algorithm that is significantly faster than the first. A distinguishing feature of these algorithms is that they identify an exemplar or a prototypical member of each bicluster. We note the interference from background elements in biclustering, and offer a means to circumvent such interference using additional regularization. Our experiments with synthetic as well as real-world datasets show that our algorithms are competitive with the current state-of-the-art algorithms for finding coherent biclusters.

Original languageEnglish (US)
Title of host publicationProceedings of the 11th SIAM International Conference on Data Mining, SDM 2011
Pages884-895
Number of pages12
StatePublished - Dec 1 2011
Event11th SIAM International Conference on Data Mining, SDM 2011 - Mesa, AZ, United States
Duration: Apr 28 2011Apr 30 2011

Publication series

NameProceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

Other

Other11th SIAM International Conference on Data Mining, SDM 2011
CountryUnited States
CityMesa, AZ
Period4/28/114/30/11

Fingerprint

Message passing
Experiments

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Tu, K., Ouyang, X., Han, D., Yu, Y., & Honavar, V. (2011). Exemplar-based robust coherent biclustering. In Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011 (pp. 884-895). (Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011).
Tu, Kewei ; Ouyang, Xixiu ; Han, Dingyi ; Yu, Yong ; Honavar, Vasant. / Exemplar-based robust coherent biclustering. Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011. 2011. pp. 884-895 (Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011).
@inproceedings{2a97cb297de94f4288ab6f9f2787a3f9,
title = "Exemplar-based robust coherent biclustering",
abstract = "The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the data matrix that optimize a desired objective function. In coherent biclustering, the objective function contains a coherence measure of the biclusters. We introduce a novel formulation of the coherent biclustering problem and use it to derive two algorithms. The first algorithm is based on loopy message passing; and the second relies on a greedy strategy yielding an algorithm that is significantly faster than the first. A distinguishing feature of these algorithms is that they identify an exemplar or a prototypical member of each bicluster. We note the interference from background elements in biclustering, and offer a means to circumvent such interference using additional regularization. Our experiments with synthetic as well as real-world datasets show that our algorithms are competitive with the current state-of-the-art algorithms for finding coherent biclusters.",
author = "Kewei Tu and Xixiu Ouyang and Dingyi Han and Yong Yu and Vasant Honavar",
year = "2011",
month = "12",
day = "1",
language = "English (US)",
isbn = "9780898719925",
series = "Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011",
pages = "884--895",
booktitle = "Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011",

}

Tu, K, Ouyang, X, Han, D, Yu, Y & Honavar, V 2011, Exemplar-based robust coherent biclustering. in Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011. Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011, pp. 884-895, 11th SIAM International Conference on Data Mining, SDM 2011, Mesa, AZ, United States, 4/28/11.

Exemplar-based robust coherent biclustering. / Tu, Kewei; Ouyang, Xixiu; Han, Dingyi; Yu, Yong; Honavar, Vasant.

Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011. 2011. p. 884-895 (Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Exemplar-based robust coherent biclustering

AU - Tu, Kewei

AU - Ouyang, Xixiu

AU - Han, Dingyi

AU - Yu, Yong

AU - Honavar, Vasant

PY - 2011/12/1

Y1 - 2011/12/1

N2 - The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the data matrix that optimize a desired objective function. In coherent biclustering, the objective function contains a coherence measure of the biclusters. We introduce a novel formulation of the coherent biclustering problem and use it to derive two algorithms. The first algorithm is based on loopy message passing; and the second relies on a greedy strategy yielding an algorithm that is significantly faster than the first. A distinguishing feature of these algorithms is that they identify an exemplar or a prototypical member of each bicluster. We note the interference from background elements in biclustering, and offer a means to circumvent such interference using additional regularization. Our experiments with synthetic as well as real-world datasets show that our algorithms are competitive with the current state-of-the-art algorithms for finding coherent biclusters.

AB - The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the data matrix that optimize a desired objective function. In coherent biclustering, the objective function contains a coherence measure of the biclusters. We introduce a novel formulation of the coherent biclustering problem and use it to derive two algorithms. The first algorithm is based on loopy message passing; and the second relies on a greedy strategy yielding an algorithm that is significantly faster than the first. A distinguishing feature of these algorithms is that they identify an exemplar or a prototypical member of each bicluster. We note the interference from background elements in biclustering, and offer a means to circumvent such interference using additional regularization. Our experiments with synthetic as well as real-world datasets show that our algorithms are competitive with the current state-of-the-art algorithms for finding coherent biclusters.

UR - http://www.scopus.com/inward/record.url?scp=84880102718&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880102718&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84880102718

SN - 9780898719925

T3 - Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

SP - 884

EP - 895

BT - Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

ER -

Tu K, Ouyang X, Han D, Yu Y, Honavar V. Exemplar-based robust coherent biclustering. In Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011. 2011. p. 884-895. (Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011).