scientific article; zbMATH DE number 176588

MaRDI QIDQ4035764zbMATH OpenFDO

Authors Thomas Schreiber

Publication date 18 May 1993

zbMATH Keywords

\(k\)-means algorithmclustering algorithmDelaunay triangulationhierarchical representationVoronoi diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An optimization algorithm for clustering using weighted dissimilarity measures
• Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
• An improved K-means algorithm using a weighted distance based on the maximum between-cluster variation
• An LP-based k-means algorithm for balancing weighted point sets
• Feature weighting in \(k\)-means clustering

Cited in

(1)

• scientific article; zbMATH DE number 6454013 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035764)