Skip to content
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

Hierarchical clustering with connectivity #144

Open
YoungFaithful opened this issue Feb 1, 2019 · 2 comments
Open

Hierarchical clustering with connectivity #144

YoungFaithful opened this issue Feb 1, 2019 · 2 comments
Labels

Comments

@YoungFaithful
Copy link

I'm using this package for calculating representative periods for my research. As I need chronological clustering for one aspect, I was wondering, if you think a connectivity like this one:

connectivity : sparse matrix (optional).
connectivity matrix. Defines for each sample the neighboring samples
following a given structure of the data. The matrix is assumed to
be symmetric and only the upper triangular half is used.
Default is None, i.e, the Ward algorithm is unstructured.
from (https://github.com/scikit-learn/scikit-learn/blob/7389dba/sklearn/cluster/hierarchical.py#L657)
could be integrated without messing too much with the algorithm.

@alyst
Copy link
Member

alyst commented Feb 3, 2019

I had a brief look, it seems SKLearn has a separate implementation of e.g. Ward algorithm if connectivity matrix is provided.
So I'm not sure it's would be a matter of a few minor changes to support the connectivity information.
But you are welcome to propose a PR implementing it.

@YoungFaithful
Copy link
Author

I also got the impression that some major addition would be necessary. I'll see if I can do that.

@alyst alyst added the feature label Mar 28, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

2 participants