-
Notifications
You must be signed in to change notification settings - Fork 74
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
IVFPQIndex ? #13
Comments
SSGIndex's building time is slow, though its performance and accuracy is awesome SSGIndex will build a KNN graph first, and then pruning, the complexity is about O(n^2), that's why it cost more time to do the we will implement https://arxiv.org/abs/1609.07228 and https://www.cs.princeton.edu/cass/papers/www11.pdf to decrease the complexity to O(n^1.14), which will significantly fast these feature we plan to release in version |
could you give more information about your IVFPQIndex issue? |
default n_kmeans_center is 256. |
good point! we have a API(temporarily not in Python lib)to display the statistics info of the index we built, and we would return these info, and we will also release a PCA method utils which you can decrease the dimension into 2. And the rest of the drawing work may need the support of other libraries |
Understanding the index structure and clustering would be helpful. Data output that would be compatible with https://opentsne.readthedocs.io/en/latest/ or similar tools would be great. |
I'm not sure if this is my problem, (possible).
I am testing the index types all work, (SSG had extensive index times > 24 hours so I aborted that).
IVFPQIndex
I am doing this with all index types, no issues except this case.
FYI:
print(i,d)
15746524 [248, 225, 188, 223, 199, 174, 144, 146]
Error:
The text was updated successfully, but these errors were encountered: