Advances in k-means clustering. A data mining thinking.
From MaRDI portal
Publication:2893103
DOI10.1007/978-3-642-29807-3zbMATH Open1267.68018OpenAlexW2497532187MaRDI QIDQ2893103FDOQ2893103
Authors: JunJie Wu
Publication date: 26 June 2012
Published in: Springer Theses (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29807-3
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Cited In (9)
- Spectral and modal methods for studying stability and control of electric power systems
- A novel convex clustering method for high-dimensional data using semiproximal ADMM
- Efficient editing and data abstraction by finding homogeneous clusters
- Title not available (Why is that?)
- On the parameterized complexity of consensus clustering
- \(K\)-medoids and other criteria for crisp clustering
- Predictive tools in data mining and \(k\)-means clustering: universal inequalities
- Methodically unified procedures for a conditional approach to outlier detection, clustering, and classification
- Reconstruction of random fields concentrated on an unknown curve using irregularly sampled data
This page was built for publication: Advances in \(k\)-means clustering. A data mining thinking.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893103)