The seeding algorithm for Functional k-Means problem

DOI10.1007/978-3-030-26176-4_32MaRDI QIDQ2300054zbMATH OpenOpenAlexFDO

Authors M. Li, Yishui Wang, Dongmei Zhang, Dachuan Xu

Publication date 24 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-26176-4_32

zbMATH Keywords

approximation algorithm\(k\)-Means problemFunctional \(k\)-Means problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• A new distance with derivative information for functional \(k\)-means clustering algorithm
• The seeding algorithm for \(k\)-means problem with penalties
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem
• Approximation algorithms for fuzzy \(C\)-means problem based on seeding method
• The seeding algorithms for spherical \(k\)-means clustering

Cited in

(3)

• Simulated annealing for selecting optimal initial seeds in the K-means algorithm
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• The Parallel Seeding Algorithm for k-Means Problem with Penalties

This page was built for publication: The seeding algorithm for Functional \(k\)-Means problem

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