Skip to content

danielivanovds/kmeans

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Cost

Assign: O(n * k * d)

Update: O(n * d)

Overall: O(n * k * d * iter)

where:

  • n is the number of documents
  • k is the number of clusters
  • d is the dimension of the embeddings
  • iter is the number of iterations

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published