0
$\begingroup$

I am trying to generate partitions of networks to evaluate clustering algorithms. I know that generating all partitions is infeasible (since they grow with Stirling number of the second kind which get big very quickly). I would like to restrict this to partitions that have a minimum size since these are the ones I care about anyway.

As a bonus, if anyone has a good way to estimate the number of such partitions for set size N, number of partitions k and minimum partition size l that would also be appreciated.

Improve this question
$\endgroup$
2
  • $\begingroup$ You can easility design such algorithms using recursion/backtracking. $\endgroup$
    – Inuyasha Yagami
    Commented Jan 25, 2022 at 20:19
  • $\begingroup$ What is $k$?: Number of partitions or the minimum size of a cluster? $\endgroup$
    – Inuyasha Yagami
    Commented Jan 25, 2022 at 20:21

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.