Brad
Brad
Can optimized clustering be done with AutoML? AutoCluster seems to have less support for this (some libraries seem dead) but I can't find another library that makes it happen https://github.com/wywongbd/autocluster...
- https://github.com/gromain/Diceware-Passphrase-Generator/tree/master/lists - https://github.com/atoponce/webpassgen/tree/master/lists - https://github.com/Freaky/mkpass/tree/master/dictionaries - https://github.com/shibumi/mnemonic/tree/master/data
https://github.com/InputBlackBoxOutput/Madlibs-Diceware/tree/main/wordlists
The classic trio of Degree, Closeness, and Betweenness can be replaced by the more well-defined Leverage, Eigenvector, and Bridging Centrality. Without separating Degree Centrality and Closeness Centrality, it becomes Radial...
Assuming that there is a shortlist of users from a known group, it would be useful to see the dynamics of each concerned persons within the network. Example: - Politicians...
The "six degrees of separations" are useful for finding common external interest in communities, and that fetching two levels or three levels deep is already enough insight into others. https://github.com/narendraj9/digsep
As observed in https://cdlib.readthedocs.io/en/latest/reference/cd_algorithms/node_clustering.html there are more algorithms out there, and that it could be useful to see the different results from each community algorithm.
There are other algorithms out there that can be used to enhance search. It would be great if Term Weighting can be separated into individual blocks. - https://github.com/DerwenAI/pytextrank - https://github.com/asahi417/kex...
https://betterprogramming.pub/why-i-made-my-own-code-quality-tool-c44b40ceaafd
https://github.com/ElectronVector/ravioli and https://betterembsw.blogspot.com/2017/08/the-spaghetti-factor-software.html > I've had to review code that has spaghetti-level complexity in control flow (too high cyclomatic complexity). And I've had to review code that has spaghetti-level complexity...