Come for the quick hacks, stay for the epiphanies. | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
Ideas? Does this align with some obscure or obvious algorithm I couldn't recognize? Hi halley, you may have already seen this one before, but since you asked for an algorithm (either obvious or obscure #but not both?#) here is a link to the entry identified as 1.5.1 Clique from The Stony Brook Algorithm Repository. This immediately came to mind upon reading your question. To see how this applies to your scenario, simply picture each 'keyword' as a node in an undirected graph, and each n-tuple combination represented by a (multi)edge. The clusters with the most connections thus represent your 'popular cliques' that you want to identify and single out for special treatment, abuse, retribution, or whatever (just like in high school ;-). Sorry, I've no ready-to-run perl implementation like those other remarkable chaps, but the link has some useful background for anyone curious.
=oQDlNWYsBHI5JXZ2VGIulGIlJXYgQkUPxEIlhGdgY2bgMXZ5VGIlhGV
In reply to Re: algorithm for 'best subsets'
by dimar
|
|