tag:blogger.com,1999:blog-5743983044224833668.post6057604512773407916..comments2023-03-30T02:13:37.406-07:00Comments on Fatvat: Neural Networks and ClojureJeffhttp://www.blogger.com/profile/08195722595923882332noreply@blogger.comBlogger5125tag:blogger.com,1999:blog-5743983044224833668.post-33071299291049172872010-05-15T10:03:20.042-07:002010-05-15T10:03:20.042-07:00Thanks Paweł - that looks much cleaner!
Looking...Thanks Paweł - that looks much cleaner! <br /><br />Looking back now, I'm of the opinion anything that uses recur is almost certainly something you can do with a standard function. I guess recursion is a code smell in a functional language since most likely you can express it in terms of a map / fold operation.Jeffhttps://www.blogger.com/profile/08195722595923882332noreply@blogger.comtag:blogger.com,1999:blog-5743983044224833668.post-86060209511217234632010-05-15T08:52:32.430-07:002010-05-15T08:52:32.430-07:00"train" function does look a lot like re..."train" function does look a lot like reduce so I thought it'd be nice if you made test data 'reducable' and refactor "train" into function that may be used by "reduce".<br /><br />You can find source code at:<br />http://gist.github.com/402257Paweł Badeńskihttps://www.blogger.com/profile/02544441831377477201noreply@blogger.comtag:blogger.com,1999:blog-5743983044224833668.post-38499402568056384622010-01-29T00:57:24.082-08:002010-01-29T00:57:24.082-08:00What is your opinion, the structure of typiclal NN...What is your opinion, the structure of typiclal NN can be best described from the point of view objects or functions?<br /><br />And what structure would be better to use for NN structure, weights, inputs.<br />list<br />set<br />vectors<br />maps<br /><br />or maybe use Java's structure?Infospacerhttps://www.blogger.com/profile/03490720712678508108noreply@blogger.comtag:blogger.com,1999:blog-5743983044224833668.post-88947666120838969212010-01-28T23:25:04.678-08:002010-01-28T23:25:04.678-08:00I'm definitely not an expert in FP or ANN so t...I'm definitely not an expert in FP or ANN so take this with a pinch of salt!<br /><br />I think your concerns about many matrix copies are (probably) unfounded. The Clojure data structures are designed to mutate efficiently; they share the structure that stays the same only the new data changes. In addition, when you need to mutate you can do so in a safe way using <i>transient</i>.<br /><br />Even if it is a little slower then you can probably win in the end with multi-processor support!Jeffhttps://www.blogger.com/profile/08195722595923882332noreply@blogger.comtag:blogger.com,1999:blog-5743983044224833668.post-46934592785427568902010-01-28T18:12:03.623-08:002010-01-28T18:12:03.623-08:00Nice post. I'm novice in FP. Now I'm tryin...Nice post. I'm novice in FP. Now I'm trying to play with Clojure. It's seems for me this paradigma is much closer to my way of thinking than OO. I was looking for any implementations of ANN on functional language. I'm planning to implement Restricted Boltzman Machine for humor and jokes extraction from text. <br /><br />I'd like to know your opinion regarding using functional programming vs OO programming for ANN construction. Which one is better suited for this kind of tasks. As soon as I know with FP it is much simpler to programm for multiprocessor hardware. But how about memory consumption. With BP algorithm we should create many matrix copy when adjusting wheights.<br /><br />So anybody using FP languages for ANN?Infospacerhttps://www.blogger.com/profile/03490720712678508108noreply@blogger.com