k-means Clustering
العنقَدة بـ k-متوسطات
خوارزمية عنقدة تقسم البيانات إلى k مجموعة عبر تكرار الإسناد إلى أقرب مركز ثم تحديث المراكز.
k-means Clustering
Also translated asخوارزمية k-وسائط، تجميع k-وسائط
First appears in this corpus in: Least Squares Quantization in PCM (1982)
Appears in these papers
- A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise1996in the sky ✦
- K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation2006in the sky ✦
- Billion-Scale Similarity Search with GPUs2017in the sky ✦
- ImageNet: A Large-Scale Hierarchical Image Database2009in the sky ✦
- Least Squares Quantization in PCM1982in the sky ✦
- MusicLM: Generating Music From Text2023in the sky ✦
- Exploring Simple Siamese Representation Learning2021in the sky ✦
- Exploring Simple Siamese Representation Learning2021in the sky ✦
- On Spectral Clustering: Analysis and an Algorithm2001in the sky ✦
- YOLOv3: An Incremental Improvement2018in the sky ✦