Chris Bowdon @cbowdon@linuxrocks.online

Still continuing my #graph journey of discovery. I’ve been looking at overlapping community detection algorithms. Implemented a simple one (CPMw) in #Clojure but was underwhelmed by the results. I could fiddle with parameters to get the desired clusters individually but not together.

Need to look into proper evaluation methods now, I won’t get very far just by eyeballing the clusters.

Looks like the no-no-deal pressure is building, both Labour and Lib Dems requiring that it’s “taken off the table”. Good good. #brexit

My colleagues are looking at more #graphql. Seems to be a good dev story in the browser and on Node, but much weaker everywhere else.

Just spent an hour writing a lightweight inferior-lisp based #Clojure mode for #Emacs before thinking of checking whether inf-clojure existed. It does, d’oh. An hour wasted, but problem solved: when I don’t want to use CIDER (or have a socket REPL) there is a good option.

Trying to balance early morning workouts against getting enough sleep. I guess the solution is going to bed earlier, but those seasons of Doctor Who aren’t going to watch themselves..

Turns out all my performance improvements were unnecessary- it was an infinite loop due to a node with an edge to itself. Rookie error!

Serious yak-shaving going on now. I'm trying to implement clique percolation (CFinder) in Clojure. Loom provides a maximal cliques implementation that should be trivial to build on top of, except I noticed degeneracy ordering was performing terribly. I managed to optimize this and was feeling pretty smug, except the rest of the algorithm is also not performing. Further down the rabbit hole I go...

“A man has died, so Hackernews presses the upvote arrow, since that's the closest approximation of human emotion any of them have.”

n-gate is on it this week.

http://n-gate.com/