-
-
Notifications
You must be signed in to change notification settings - Fork 544
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add of Online Hierarchical Clustering #1218
base: main
Are you sure you want to change the base?
Conversation
Hey there! I hope it's ok for me to answer only by now. Am I correct in assuming the algorithm stores all the data points it sees in memory (i.e. the |
Hello, sorry for replying that late. |
Ok I see, fair. But I don't think we'll ever want that behavior. Could you remove it? |
Yes I can. So I add an error if the value of |
Nope, no need to check for an error. An exception will raise itself at some point. In general, we don't do input validation. Instead, we document well. |
Okay ! I will delete it |
…computational speed.
…ing Tree." at the end of the tree.
@MaxHalford I think I'm quite happy with the current state of the code! Only one small concern is that the unit tests keep failing because there is an attribute error, saying that |
… not used within the algorithm).
@MaxHalford @kchardon If possible, I would really hope that both of you would be able to take a final look at the current state of the implementation and see if there are any changes you want to make. In case there is no opposition from both of you, when applicable, I would want to merge this into the main branch of |
I will review next week :) |
I (finally) took a look at this. There's a lot of nits to fix. But the main issue I see is that the code relies on numpy. It converts input dictionaries to numpy arrays. Would it be possible to use dictionaries only instead? I don't see any good reason to rely on numpy. Indeed, it's not in the spirit of River to rely on numpy when it can be avoided. |
No description provided.