On the lower bound of local optimums in k-means algorithms
Saved in:
Main Authors: | ZHANG, Zhenjie, DAI, Bing Tian, TUNG, Anthony K.H. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3757 https://ink.library.smu.edu.sg/context/sis_research/article/4759/viewcontent/untitled.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
On the lower bound of local optimums in k-means algorithm
by: Zhang, Z., et al.
Published: (2013) -
Estimating local optimums in EM algorithm over Gaussian mixture model
by: ZHANG, Zhenjie, et al.
Published: (2008) -
Validating multi-column schema matchings by type
by: DAI, Bing Tian, et al.
Published: (2008) -
Estimating local optimums in EM algorithm over Gaussian mixture model
by: Zhang, Z., et al.
Published: (2013) -
Coresets for vertical federated learning: Regularized linear regression and k-means clustering
by: HUANG, Lingxiao, et al.
Published: (2022)