Co-Clustering with Generative Models
In this paper, we present a generative model for co-clustering and develop algorithms based on the mean field approximation for the corresponding modeling problem. These algorithms can be viewed as generalizations of the traditional model-based clustering; they extend hard co-clustering algorithms s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/1721.1/49526 |
| _version_ | 1826192188489334784 |
|---|---|
| author | Golland, Polina Lashkari, Danial |
| author2 | Polina Golland |
| author_facet | Polina Golland Golland, Polina Lashkari, Danial |
| author_sort | Golland, Polina |
| collection | MIT |
| description | In this paper, we present a generative model for co-clustering and develop algorithms based on the mean field approximation for the corresponding modeling problem. These algorithms can be viewed as generalizations of the traditional model-based clustering; they extend hard co-clustering algorithms such as Bregman co-clustering to include soft assignments. We show empirically that these model-based algorithms offer better performance than their hard-assignment counterparts, especially with increasing problem complexity. |
| first_indexed | 2024-09-23T09:07:37Z |
| id | mit-1721.1/49526 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T09:07:37Z |
| publishDate | 2009 |
| record_format | dspace |
| spelling | mit-1721.1/495262019-04-10T07:39:10Z Co-Clustering with Generative Models Golland, Polina Lashkari, Danial Polina Golland Vision In this paper, we present a generative model for co-clustering and develop algorithms based on the mean field approximation for the corresponding modeling problem. These algorithms can be viewed as generalizations of the traditional model-based clustering; they extend hard co-clustering algorithms such as Bregman co-clustering to include soft assignments. We show empirically that these model-based algorithms offer better performance than their hard-assignment counterparts, especially with increasing problem complexity. 2009-11-03T20:30:11Z 2009-11-03T20:30:11Z 2009-11-03 http://hdl.handle.net/1721.1/49526 MIT-CSAIL-TR-2009-054 9 p. application/pdf |
| spellingShingle | Golland, Polina Lashkari, Danial Co-Clustering with Generative Models |
| title | Co-Clustering with Generative Models |
| title_full | Co-Clustering with Generative Models |
| title_fullStr | Co-Clustering with Generative Models |
| title_full_unstemmed | Co-Clustering with Generative Models |
| title_short | Co-Clustering with Generative Models |
| title_sort | co clustering with generative models |
| url | http://hdl.handle.net/1721.1/49526 |
| work_keys_str_mv | AT gollandpolina coclusteringwithgenerativemodels AT lashkaridanial coclusteringwithgenerativemodels |