DataOmbudsman

Hey @LEES0159, Thanks for the PR. Would you mind explaining the use case of the changes? I have to say I haven't thought about such an interface that would return...

Several things can explain this depending on your data and the `eps` parameter you used. As the number of dimensions increases, distance between data points change. Thus, "being within `eps`...

There's an implementation of the Incremental DBSCAN paper in the [incdbsan](https://github.com/DataOmbudsman/incdbscan) repository. For disclosure, I am the author of that project. In my experience it is rather tricky to implement...

@cjnolet In DBSCAN there's a distance matrix calculation step that could be parallelized. It's also there in the incremental version (during insertion). (Note that the above project currently implements insertion...

Hi all, I thought to share my implementation of Incremental DBSCAN over the [incdbscan](https://github.com/DataOmbudsman/incdbscan) repository for anyone interested here. The interface of the algorithm was somewhat insipred by scikit-learn's but...

It's a matter of definition I think. I see what you expect but I can also argue that clustering is about arranging already existing data points into groups. Note that...

Hey @kevcenteno, thanks for the idea! I see value in such a feature based on the description of your use case. I'd suggest going with another implementation however. Since data...