Comments (4)
That's a great scenario. The library currently doesn't handle eviction of keys. Is it possible for you to implement it around the library using the delete
function of the index? I know it would be great to utilize redis' EXPIRE keys but not sure how to implement that to play well with the LSH index itself.
from datasketch.
Thanks for a swift reply. In order to delete something, we need to know when it was added to index, so the only way I see is to alter the key used to add MinHash to LSH to contain a timestamp, and as we work with the data we would be constantly deleting and adding back to the index with the updated key. Not really optimal and easy to work with solution.
from datasketch.
What is the typical window, in terms of number of minhashes? Is there a way to time-partition the data stream so you can expire partitions as they age over time.
from datasketch.
It's always increasing but we would expire based on when we last see a value. We're using the LSH as a clustering mechanism right now, so we do a search, and if we get anything within the similarity score, then the minhash belongs to that cluster. If we don't have any values map to that cluster in x many days we would like to purge that cluster.
We're looking at doing our own datastore build on redis sorted sets to keep tabs on when we last see clusters, but this would be great if it could be coded into the existing structure, but looking at the code i see the difficulties with it
from datasketch.
Related Issues (20)
- Advice for compression of a big graph HOT 3
- Distributed MinHashLSH HOT 3
- Poor default args in MinHashLSH? HOT 1
- Is is possible to rename already created index? HOT 1
- Add C-minHash variant HOT 11
- Synchronous Mongodb Storage HOT 3
- Merging (Identically Specified) MinHashLSH objects HOT 11
- Impact of MinHashLSH threshold on memory usage HOT 2
- Too large minhashLSH index HOT 10
- Is the bumber of bands correct? HOT 3
- Choice of np.uint64? HOT 11
- def jaccard 's denominator is self not [self union other] . HOT 2
- How to Use MinHash and MinHashLSH to Identify Comprehensive Documents and Partial Matches? HOT 3
- HNSW: `HNSW.add` will not set the entry point of new levels HOT 2
- Process-safe, no mem bloat, implementation of LSH HOT 1
- Implementing MinHash retrieval from keys for MinHashLSHForest HOT 2
- Cassandra storage not compatible with Python 3.12 HOT 5
- Question: Effects of Bit Truncation on MinhashLSH? HOT 15
- uint64 overflow risk
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 datasketch.