On Sun, Jan 6, 2013 at 12:34 PM, <simon.2.thomp...@bt.com> wrote: > I think that one of the Mahout algorithms (DF) does use NaN for > "undecidable" >
Yes. But I don't think the HMM codes do. > So perhaps there is a long term need to think through the output > semantics of the library? > Yes. And no. Yes, it would be good for the HMM code, but not necessarily. Large scale HMM's have serious problems with convergence with simple algorithms. Basically, you have a problem of diffusion of the solution from the boundary conditions. It is likely that entirely different approaches will be necessary at truly large scale. See Googles deep learning of language models, for instance. Coupled with the lack of a well-known public use case, this has meant that the development of these algorithms in Mahout is still very rudimentary and is likely to remain so because the focus of attention is mostly elsewhere. > I ran an open source project (Zeus Agents - still on source forge! but > antique) for many years before it faded, so I know that random suggestions > with no technical input is fairly unhelpful, but give me some time and I'll > try and come back with something more useful! > Well, comments are certainly helpful as well. Willing hands are even better!
