[MRG+1] Refactor birch-documentation - #8298
Conversation
| For a new point entering the root, it is merged with the subcluster closest | ||
| to it and the linear sum, squared sum and the number of samples of that | ||
| subcluster are updated. This is done recursively till the properties of | ||
| the leaf node are updated. |
There was a problem hiding this comment.
The guidelines for docstrings is that the text before the parameters should be short. The reason is that users might not realize that parameters are described after.
I think that the right thing would be to move part of the text that you added in the "notes" section.
|
Done, thanks! |
| centroid closest to the new sample. This is done recursively till it | ||
| ends up at the subcluster of the leaf of the tree has the closest centroid. | ||
| It is a memory-efficient, online-learning algorithm provided as an alternative | ||
| to MiniBatchKMeans. It constructs a tree data-structure with the cluster |
| to MiniBatchKMeans. It constructs a tree data-structure with the cluster | ||
| centroids being read off the leaf. These can be either the final cluster | ||
| centroids or can be provided as input to another clustering algorithm | ||
| such as `AgglomerativeClustering`. |
| The radius of the subcluster obtained by merging a new sample and the | ||
| closest subcluster should be lesser than the threshold. Otherwise a new | ||
| subcluster is started. | ||
| subcluster is started. Setting this value to be very low, promotes |
| fit is AgglomerativeClustering with n_clusters set to the int. | ||
| subclusters from the leaves as new samples. | ||
|
|
||
| "None" : the final clustering step is not performed and the subclusters are |
There was a problem hiding this comment.
I don't think we should be using quotes for non-string values. Use double-backticks if you wish.
There was a problem hiding this comment.
Also, I'd rather this be formatted using RST's list syntax (either bullet or definition) rather than individual paragraphs.
|
|
||
| Notes | ||
| ----- | ||
| The tree data-structure consists of nodes with each node consisting of |
|
+1 on my side: this is a net improvement of what we have. |
|
If you have a moment to fix my comments, please do so and merge. |
d57609a to
ae68282
Compare
|
Thanks! I am embarrassed to admit that after looking at the documentation after a long time and I wasn't sure what was going on till I went through the code again. |
ae68282 to
d016857
Compare
* Refactor birch-documentation * move * class tags * pep8
* Refactor birch-documentation * move * class tags * pep8
* Refactor birch-documentation * move * class tags * pep8
* Refactor birch-documentation * move * class tags * pep8
* Refactor birch-documentation * move * class tags * pep8
* Refactor birch-documentation * move * class tags * pep8
What does this implement/fix? Explain your changes.
This refactors a bit of Birch Documentation.