Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

Poclustering: Lossless clustering of dissimilarity data

  • Jinze Liu
  • , Qi Zhang
  • , Wei Wang
  • , Leonard McMillan
  • , Jan Prins

Producción científica: Conference contribution › revisión exhaustiva

10 Citas (Scopus)

Resumen

Given a set of objects V with a dissimilarity measure between pairs of objects in V, a PoGluster is a collection of sets P c powerset(V) partially ordered by the C relation such that S C T if the maximal dissimilarity among objects in S is less than the maximal dissimilarity among objects in T. PoChisters capture categorizations of objects that are not strictly hierarchical, such as those found in ontologies. PoChisters can not, in general, be constructed using hierarchical clustering algorithms. In this paper, we examine the relationship between PoChisters and dissimilarity matrices and prove that PoChisters are in one-to-one correspondence with the set of dissimilarity matrices. The PoChistering problem is NP-Complete, and we present a heuristic algorithm for it in this paper. Experiments on both synthetic and real datasets demonstrate the quality and scalability of the algorithms.

Idioma originalEnglish
Título de la publicación alojadaProceedings of the 7th SIAM International Conference on Data Mining
Páginas557-562
Número de páginas6
DOI
EstadoPublished - 2007
Evento7th SIAM International Conference on Data Mining - Minneapolis, MN, United States
Duración: abr 26 2007 → abr 28 2007

Serie de la publicación

NombreProceedings of the 7th SIAM International Conference on Data Mining

Conference

Conference7th SIAM International Conference on Data Mining
País/TerritorioUnited States
CiudadMinneapolis, MN
Período4/26/07 → 4/28/07

ASJC Scopus subject areas

  • General Engineering

Huella

Profundice en los temas de investigación de 'Poclustering: Lossless clustering of dissimilarity data'. En conjunto forman una huella única.

Citar esto