scientific article

zbMath0987.68068MaRDI QIDQ2768331

Dan Oblinger, Leonard Pitt, Nina Mishra

Publication date: 30 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

PAC-clustering algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering ⋮ Unnamed Item ⋮ Quantum speed-up for unsupervised learning ⋮ \(k\)-means genetic algorithms with greedy genetic operators ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Sublinear-time Algorithms ⋮ Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms ⋮ A sublinear-time approximation scheme for bin packing ⋮ Sublinear‐time approximation algorithms for clustering via random sampling

This page was built for publication: