mirror of
https://github.com/pgvector/pgvector.git
synced 2026-07-16 09:30:59 +08:00
Moved libraries [skip ci]
This commit is contained in:
12
README.md
12
README.md
@@ -130,6 +130,12 @@ l2_distance(vector, vector) | Euclidean distance
|
|||||||
vector_dims(vector) | number of dimensions
|
vector_dims(vector) | number of dimensions
|
||||||
vector_norm(vector) | Euclidean norm
|
vector_norm(vector) | Euclidean norm
|
||||||
|
|
||||||
|
## Libraries
|
||||||
|
|
||||||
|
Libraries that use pgvector:
|
||||||
|
|
||||||
|
- [Neighbor](https://github.com/ankane/neighbor) (Ruby)
|
||||||
|
|
||||||
## Thanks
|
## Thanks
|
||||||
|
|
||||||
Thanks to:
|
Thanks to:
|
||||||
@@ -140,12 +146,6 @@ Thanks to:
|
|||||||
- [k-means++: The Advantage of Careful Seeding](https://theory.stanford.edu/~sergei/papers/kMeansPP-soda.pdf)
|
- [k-means++: The Advantage of Careful Seeding](https://theory.stanford.edu/~sergei/papers/kMeansPP-soda.pdf)
|
||||||
- [Concept Decompositions for Large Sparse Text Data using Clustering](https://www.cs.utexas.edu/users/inderjit/public_papers/concept_mlj.pdf)
|
- [Concept Decompositions for Large Sparse Text Data using Clustering](https://www.cs.utexas.edu/users/inderjit/public_papers/concept_mlj.pdf)
|
||||||
|
|
||||||
## Libraries
|
|
||||||
|
|
||||||
Libraries that use pgvector:
|
|
||||||
|
|
||||||
- [Neighbor](https://github.com/ankane/neighbor) (Ruby)
|
|
||||||
|
|
||||||
## History
|
## History
|
||||||
|
|
||||||
View the [changelog](https://github.com/ankane/pgvector/blob/master/CHANGELOG.md)
|
View the [changelog](https://github.com/ankane/pgvector/blob/master/CHANGELOG.md)
|
||||||
|
|||||||
Reference in New Issue
Block a user