Comments (6)
Yeah, I've thought about this too.
Just to check, you know that you can query knn against multiple points in one call, which is faster than one at a time?
from nearestneighbors.jl.
Yes, I know. It is just that I need to do it point by point in this case. In places where I can pass a bunch of points, I am already doing it. 👍
from nearestneighbors.jl.
Do you have some performance benchmarks? I think I tried this a while ago and while there was a speedup I don't recall it as "huge".
from nearestneighbors.jl.
I don't have a benchmark yet, can try to run it locally and report here 👍
from nearestneighbors.jl.
seems like this issue was closed? I wonder what's the progress of in-place KNN, in particular in-place KDTree?
I have a problem that needs to do KNN (for density estimation) millions of times on matrices with the same size.
Ideally, I could create a KDTree
, then re-use the memory for new data, e.g.
kdtree = KDTree(data)
set!(kdtree, newdata) # in-place update of kdtree object with new data
Thanks.
from nearestneighbors.jl.
I think this feature will be useful. Querying knn
against multiple points certainly helps, but if we do it
from nearestneighbors.jl.
Related Issues (20)
- knn: skipped items output when there is a skip function has always the last index and not 0 index HOT 3
- `nn` lacking docstring HOT 1
- AssertionError in kmedoids alg
- bug: BoundsError when the skip function returns true for all points HOT 3
- Is there a reason sqeuclidean distance is not supported? HOT 4
- README.md Misleading Custom Metric Documentation
- Document that `inrangecount` also counts the point itself HOT 2
- [Question] Can you insert new data into an existing KDTree object? HOT 2
- Compilation time issues with very high dimensions HOT 3
- Reverse Cuthill-McKee ordering option HOT 1
- Querying number of distance evaluations HOT 3
- Make datatypes of the KNN results selectable for potentially lower memory overhead
- Does ball tree work with any metric? HOT 2
- Add example with `skip` option to documentation HOT 1
- Julia 1.10 is waiting on IO to finish during compilation HOT 3
- It should be possible to make `KDNode` smaller
- KDTree: Wrong results for non-Euclidean metrics
- Cannot build KDTree with Subarrays since v0.4.14 HOT 3
- KDTree with Matrix{ComplexF64} HOT 1
- Can't do `knn` on `AbstractVector{SVector}` HOT 2
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from nearestneighbors.jl.