The approximation algorithm based on seeding method for functional \(k\)-means problem

DOI10.3934/jimo.2020160zbMath1499.90184OpenAlexW3097639457MaRDI QIDQ2076447

Dongmei Zhang, Yishui Wang, Min Li, Da-Chuan Xu

Publication date: 16 February 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020160

zbMATH Keywords

approximation algorithm\(k\)-meansseeding algorithmfunctional \(k\)-means

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Functional cluster analysis via orthonormalized Gaussian basis expansions and its application
• Functional data clustering via piecewise constant nonparametric density estimation
• Distance-based clustering of sparsely observed stochastic processes, with applications to online auctions
• PLS classification on functional data
• NP-hardness of Euclidean sum-of-squares clustering
• Model-based clustering of high-dimensional data: a review
• Clustering functional data
• How fast is the \(k\)-means method?
• A new distance with derivative information for functional \(k\)-means clustering algorithm
• The seeding algorithm for \(k\)-means problem with penalties
• A new Dirichlet process for mining dynamic patterns in functional data
• Functional data clustering: a survey
• Clustering based polyhedral conic functions algorithm in classification
• Unsupervised Curve Clustering using B‐Splines
• Least squares quantization in PCM
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Clustering multivariate functional data with phase variation
• The effectiveness of lloyd-type methods for the k-means problem

This page was built for publication: The approximation algorithm based on seeding method for functional \(k\)-means problem