graph streams and higher order Markov processes
Rick Taube
hkt@zkm.de
Nicky Hind recently asked me for higher order Markov processes in graph streams. Ive got this working now, with some nice additions like pattern matching on the the previous N choices instead of straight lookup. If anyone wants to play around with Markov chains send me a note and ill mail the patch file, which includes documentation and the Stephen Foster example (2nd order Markov) from chapter 8 in Dodge/Jerse. othewise, this stuff will get encorporated into the next release.
I can also send out a #i read macro that helps shorten item streams definitions a bit:
#i(a b c) = (items a b c)
#ir(a b c) = (items a b c in random)
#irn(a b c) = (notes a b c in random)
and so on.
-hkt
>From bil@ccrma.Stanford.EDU Mon Nov 8 09:23:05 1993