I'm playing around with neural networks and went for a functional approach. There's some code at http://github.com/fffej/ClojureProjects/tree/master in the neural-networks directory. See http://www.fatvat.co.uk/2009/06/back-propagation-algorithm-in-clojure.html for some explanation.
Lack of mutability made testing the code a lot easier (once you've written a function, write a test for it and it's done forever; mutable state means anything could happen), but writing it felt harder. Hopefully that's just a temporary thing while my brain adjusts to FP. I think the code is more complicated than it needs to be so I'd appreciate any simplifications you see! On Jun 9, 1:59 pm, "alfred.morgan.al...@gmail.com" <alfred.morgan.al...@gmail.com> wrote: > I'm pretty well a complete beginner at clojure, but I was hoping I > could get some advice on how to do this sort of thing efficiently/ > concisely, because as far as I can tell this involves handling an > awful lot of heavily mutable state, so right now I really feel like > I'm fighting the language. What data structures should I be using to > model nodes and their connections, and would atoms/refs/agents be of > any help to me? > > Thanks, Morgan --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
