High-Performance Hybrid Algorithm for Minimum Sum-of-Squares Clustering of Infinitely Tall Data

Ravil Mussabayev, Rustam Mussabayev

Open source

DOI
10.3390/math12131930
Published
2024-06-21
Container
Mathematics
Publisher
MDPI AG
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.3390/math12131930,
  title = {High-Performance Hybrid Algorithm for Minimum Sum-of-Squares Clustering of Infinitely Tall Data},
  author = {Ravil Mussabayev and Rustam Mussabayev},
  year = {2024},
  journal = {Mathematics},
  doi = {10.3390/math12131930},
  url = {https://doi.org/10.3390/math12131930}
}

RIS

TY  - JOUR
TI  - High-Performance Hybrid Algorithm for Minimum Sum-of-Squares Clustering of Infinitely Tall Data
AU  - Ravil Mussabayev
AU  - Rustam Mussabayev
PY  - 2024
JO  - Mathematics
DO  - 10.3390/math12131930
UR  - https://doi.org/10.3390/math12131930
ER  - 

APA

Mussabayev, R., & Mussabayev, R. (2024). High-Performance Hybrid Algorithm for Minimum Sum-of-Squares Clustering of Infinitely Tall Data. Mathematics. https://doi.org/10.3390/math12131930

Source records