The fast clustering algorithm for the big data based on K-means
From MaRDI portal
Publication:5150104
DOI10.1142/S0219691320500538zbMath1492.68122OpenAlexW3049659830MaRDI QIDQ5150104
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational aspects of data analysis and big data (68T09)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Similarity reduction and closed form solutions for a model derived from two-layer fluids
- Efficient algorithms for agglomerative hierarchical clustering methods
- New method for feature extraction based on fractal behavior
- Cure: An efficient clustering algorithm for large databases
- Kink solutions for a class of generalized dissipative equations
- Approximate symmetries in nonlinear viscoelastic media
- A classification EM algorithm for clustering and two stochastic versions
- Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on $$\varvec{\mathscr {D'}}(\mathbb {C})$$ D ′ ( C )
- Symmetries and reduction techniques for dissipative models
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
- Non-convex clustering via proximal alternating linearized minimization method
- Least squares quantization in PCM
- Face Recognition Under Varying Illumination Using Gradientfaces
This page was built for publication: The fast clustering algorithm for the big data based on K-means