The fast clustering algorithm for the big data based on K-means
DOI10.1142/S0219691320500538zbMATH Open1492.68122OpenAlexW3049659830MaRDI QIDQ5150104FDOQ5150104
Authors: Ting Xie, Taiping Zhang 
Publication date: 9 February 2021
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219691320500538
Recommendations
- Improvement of the fast clustering algorithm improved by \(K\)-means in the big data
- An efficient \(K\)-means clustering algorithm for tall data
- A fast clustering algorithm for large-scale and high dimensional data
- Decomposition/aggregation \(k\)-means for big data
- A fast \(k\)-means clustering algorithm using cluster center displacement
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational aspects of data analysis and big data (68T09)
Cites Work
- Title not available (Why is that?)
- A classification EM algorithm for clustering and two stochastic versions
- Least squares quantization in PCM
- Clustering with Bregman divergences.
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Efficient algorithms for agglomerative hierarchical clustering methods
- Cure: An efficient clustering algorithm for large databases
- Similarity reduction and closed form solutions for a model derived from two-layer fluids
- Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
- Kink solutions for a class of generalized dissipative equations
- Approximate symmetries in nonlinear viscoelastic media
- Symmetries and reduction techniques for dissipative models
- New method for feature extraction based on fractal behavior
- Face Recognition Under Varying Illumination Using Gradientfaces
- Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on $$\varvec{\mathscr {D'}}(\mathbb {C})$$ D ′ ( C )
- Non-convex clustering via proximal alternating linearized minimization method
Cited In (8)
- An efficient \(K\)-means clustering algorithm for tall data
- Heterogeneous distributed big data clustering on sparse grids
- Decomposition/aggregation \(k\)-means for big data
- A fast clustering algorithm for large-scale and high dimensional data
- A new fast online learning algorithm based on distributed mining of big data
- Improvement of the fast clustering algorithm improved by \(K\)-means in the big data
- Speeding up the large-scale consensus fuzzy clustering for handling big data
- Acceleration of machine learning algorithms by Tchebychev iteration technique
Uses Software
This page was built for publication: The fast clustering algorithm for the big data based on K-means
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150104)
