Meta FAIR releases e-means clustering algorithm in FAISS 1.16.0Machine translation
Meta FAIR 发布聚类算法 e-means,已集成至 FAISS 1.16.0
Meta FAIR researchers released e-means, which updates cluster centroids using exponential moving averages for tasks such as vector indexing and data curation. The authors report that, in their tests, it reached Lloyd’s k-means’ loss after 25 epochs in 1.4 to 2.6 epochs. It is available in FAISS 1.16.0.
This source permits summary display only.
Read at the original source