lmcinnes / lmcinnes/pynndescent
Nearest neighbors for a subset of points
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 970
- Forks
- 107
- PR merge metrics
- No merged PRs in 30d
Description
I'm interested in the following use case: suppose I have a dataset X with N point in it. I take a subsample Y with M < N points.
Is it possible to calculate the nearest neighbors in X of just the points in Y? And would that be much faster than calculating all nearest neighbors (supposing M << N, say 10%)?
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue does not name a file, test, or entry point to inspect. First clarify the desired subset-query API and expected performance, then define tests and completion criteria for computing neighbors only for Y.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- machine-learning, search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100