Correlation clustering.
We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, v) is labeled either + or ? depending on whether u and v have been deemed to be similar or different. The goal is to produce a partition of the vertices (a clustering) that agrees as muc...
| Publicado en: | Machine learning. 56, 1-3 (2004). |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Lenguaje: | English |
| Materias: |