scientific article; zbMATH DE number 1759590

From MaRDI portal

Revision as of 10:04, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4536577

Jump to:navigation, search

zbMath0996.68815MaRDI QIDQ4536577

No author found.

Publication date: 5 November 2002

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

zbMATH Keywords

clustering metric spaces greedy-interchange algorithm k-medians algorithm k-medians initialization maxmin algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Related Items (2)

A distance based clustering method for arbitrary shaped clusters in large datasets ⋮ On the use of Bernoulli mixture models for text classification

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4536577&oldid=18656269"