Questions tagged [annoy]
21 questions
0
votes
0 answers
how to append a dataframe in DeepImageSearch
I'm working on a personal project using deep image search, and I was planning on adding he functionality to add new data to the approximate nearest neighbor index. I tried a few other things, but the approach I got closest with is by passing a…

Shams Ghani
- 1
- 1
0
votes
2 answers
Save MySql 'Show' result in db
So I'm kind of stumped.
I have a MySql project that involves a database table that is being manipulated and altered by scripts on a regular basis. This isn't so unusual, but I need to automate a script to run (after hours, when changes aren't…

FerrousOxide
- 644
- 1
- 5
- 11
0
votes
1 answer
How to load a huge model on Dask with limited RAM?
I want to load a model (ANNOY model) on Dask. The size of the model is 60GB and Dask RAM is 2GB only. Is there a way to load the model in distributed manner as well?

n0obcoder
- 649
- 8
- 24
0
votes
0 answers
How to resolve "exit status 1: python setup.py egg_info" error while using pip install package_name?
I am unable to install any package out of scann, lshash, annoy etc using pip install on my Windows 10 using conda environment. Surprisingly, when I used pip install autocorrect, it was installed. I am getting the error:
ERROR: Command errored out…

Deshwal
- 3,436
- 4
- 35
- 94
0
votes
0 answers
How to cluster spacy vectors (word embedding) into groups using Annoy or other similar algorithms
I have a list of words whose vector embeddings I got by using spacy's pre trained model en_core_web_lg.
My questions are two fold
Can these word vectors be fed into Annoy like algorithm?
Can I get say 20 groups, each group containing around 100…

user10083444
- 105
- 1
- 1
- 10
0
votes
1 answer
document similarity search - annoy & pysparNN
I am trying to find a solution for finding nearest or approximate nearest neighbor of documents.
Right now I am using tfidf as vector representation of the document. My data is pretty big (N ~ million). If I use annoy with tfidf, I ran out of…

I-PING Ou
- 497
- 2
- 6
- 18