Sam,
I'm not an expert, but I think making `co-occurrences` recursive is
slightly simpler. Something like:
(defn co-occurrences [db ht depth tags]
(if (zero? depth)
>
tags
> (recur db ht (dec depth) (co-ocs db ht tags
You'll note that I'm not reducing into tags on the last line.
EDIT
On Wednesday, December 3, 2014 10:45:33 PM UTC-5, Sam Raker wrote:
>
> I've got a decent-sized corpus of tweets, organized by hashtag, in a
> CouchDB db. I'm doing some initial explorations of my data, and was curious
> about which hashtags show up together in tweets. I want to do a NSA-sty
I've got a decent-sized corpus of tweets, organized by hashtag, in a
CouchDB db. I'm doing some initial explorations of my data, and was curious
about which hashtags show up together in tweets. I want to do a NSA-style
"hops" kind of algorithm--get all the hashtags that show up in the same
twee
