Co-Clustering with Generative Models
|
Descargar SCORM
¡Sea el primero en solicitar este recurso!
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Co-Clustering with Generative Models
|
| Id. |
49267056 |
| Titulo |
Co-Clustering with Generative Models |
| Autor(es) |
Golland, Polina
Lashkari, Danial
|
| Localización |
http://hdl.handle.net/1721.1/49526
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
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.
|
| Tipo |
9 p.
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
| Formatos |
9 p.
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[References] MIT-CSAIL-TR-2009-054
|
| Fecha de contribución |
04-nov-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
