Neural Networks Books
Related Subjects: Conferences Companies Research Groups People Software Organizations Books Publications
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250

Used price: $49.50

Good BookReview Date: 2006-03-01
A very good introduction to Bayesian networksReview Date: 2003-06-14
The author also provides a good introduction to decision graphs, a close relative of Bayesian networks.
The aspect of Bayesian networks that I find most attractive is the fact that there is a "rational" way of designing a network, based on hypothesis, informational, and mediating variables, and their "causal" relationships. Unlike neural networks in which one is almost forced to guess the appropriate structure of the network, every node in a Bayesian network correpsonds with a state or quantity that can be measured either directly or indirectly through other variables. Thus, changes in a system model should only induce local changes in a Bayesian network, where as system changes might require the design and training of an entirely new neural network.
Another aspect of Bayesian networks that I find very compelling is the way in which they seem quite amendable to learning and the presentation of new evidence. This is true since knowledge updating is done locally (through variables), while the effects of those changes are witnessed globally through appropriate belief-updating algorithms.
On the downside, it should be noted that the operation of belief-updating is in general NP-hard, thus there exists a valid concern about the computational efficiency of Bayesian networks. Contrast this with the fact that once a nueral network has been trained, it is quite easy to compute. One would hope that these concerns will subside with more research, for the above mentioned benefits of Bayesian networks leads me to believe that these networks will have quite an influence on the future directions of machine learning.
Although this book will not go down in history as the definitive reference for Bayesian networks, it serves as a good conduit for explaining this quite interesting area of learning at a time when such few complete and modern references exist.
Not worth the moneyReview Date: 2002-12-31
Accessible introduction to Bayesian NetworksReview Date: 2003-01-21
Prerequisites of the book as stated in the preface include Graph Theory and Calculus, both at introductory level. I personally did not have exposure to Graph theory, but I was able to understand most of the material without any help. Necessary probability theory is developed, but basic probability knowledge is also a prerequisite to digest the material to a reader without prior exposure of Probability as it shapes the core of the material in the book.
The strength of this text is in Part I where the author provides several examples to illustrate use of Bayesian Networks, Influence Diagrams and other models. I find it useful Influence Diagram as an extension of Bayesian Networks.
Most answers to Exercises at the end of each chapter are provided at the author's homepage, except answers of the last chapter. Answers that require graphical modeling software are also provided in Hugin format. (Hugin Lite can be downloaded from Hugin site.)
The downsides are that writing of the text is somewhat awkward, obscuring readers from understanding, that model building chapter could have been discussed more thoroughly, that material in Learning is barely present, and that definitions are sometimes not introduced upon the first encounter but they appear later in chapters. More different and complex examples could have been discussed to illustrate the material. Note: the author provides a page for Learning at his homepage.
Although this is an introduction to Bayesian Networks and Influence Diagrams, a reader should be equipped with some level of abstract thinking in order to digest the material.
This book is suitable for self-study. It has motivations for the uninitiated. References are provided at the end of the book and I was able to find some of them online. A notable is "A tutorial on Learning with Bayesian Networks" by Heckerman, to fill in the part of Learning in this book.
Other books at this level from users' perspective are:
Edwards, Introduction to Graphical Modeling (Utilizes software MIM.)
Clemen, et al., Making Hard Decisions (Uses Palisade Decision Tools suite. The book discusses Influence Diagrams but not Bayesian Networks.)
Further studies after completion of this book include:
Cowell, et al., Probabilistic Networks and Expert Systems
Lauritzen, Graphical Models
Pearl, Probabilistic Reasoning in Intelligent Systems
Pearl, Causality
A lot about very littleReview Date: 2003-05-06

Used price: $19.83
Collectible price: $70.00

No idea for whom it was writtenReview Date: 2007-09-19
I found much better sources for free on the web.
Low then avarage book...Review Date: 2001-09-09
-Review Date: 2000-04-18
Excellent workReview Date: 2003-07-16
Because after all this is a very subjective matter. I bought the book for two reasons neither of which has to do with a reader's review. The first reason was because I have a copy of Timothy's book on Practical Neural Networks in C++, which I found excellent, and the second reason was because I had previewed chapter one before I bought the book and liked it very much for what it had to say and the way it said it. Timothy's books are for a wide audience of intelligent people, not necessarily all rocket scientists, and although a mathematician himself, restricts math as much as possible so people do not get bogged down by the math and loose the forest for the trees. On the other hand there is sufficient amount of bibliography for any one who is interested to pursue most rigorous or more exotic approaches. The code examples are good and the executable file NPREDICT, works without any further processing, for those who don't want to mess with code and compiling. The treatment of Box-Jekins ARMA model,and the multivariate example on temperature and precipitation is very good. The book is highly recomended to any one who has little or no knowledge of the subject, and wants to understand what time series is all about
Not for beginnersReview Date: 2001-10-28

Used price: $0.36

Want to know about DEN? Don't bother with this book!!Review Date: 1999-07-03
Very enjoyable bookReview Date: 1999-11-11
All essential information on DEN specificationsReview Date: 1999-10-29
Good overview of DEN and the major playersReview Date: 1999-06-30
Don't waste your time and moneyReview Date: 1999-06-29

Jargon - Not for beginners.Review Date: 2008-02-13
The book itself comes off as extremely condescending to any beginner who is frustrated with the book because throughout the text, the authors repeat over and over and over again some variation of, "Here is a SIMPLE example..."
****ALSO IMPORTANT TO NOTE: As for the free software you can download online, PDP++, it is prone to errors (random quitting, functions not working properly) and DOES NOT work on many newer versions of Mac OS X. You have to download a different program called Emergent, which is not compatible with what you read in this text; this is also an annoying problem.
The aspects of the book that focus on the biology of the mind are like breaths of fresh air, but every chapter inevitably leads into mind-numbing instructions and equations that are difficult to comprehend.
This is by far the most frustrating book I've had to deal with. The other one-star review was shrewd in warning undergrad students and beginners about this text.
Best introduction to neural network models of cognitive processesReview Date: 2006-03-23
A new paradigmReview Date: 2000-09-27
A new paradigmReview Date: 2000-09-27
Great for Grads/Professional--confusing and convoluted for undergradReview Date: 2006-11-17
---->dont.

Used price: $34.95

Misleading TitleReview Date: 2008-03-29
Fuzzy Logic for Embedded Systems ApplicationsReview Date: 2005-03-18
Embedded system design using fuzzy logic algorithms is made easy through practical examples.
I thoroughly enjoyed the book. If you want a concise, well written book that is not overbearing and is actually very user friendly and you are interested in fuzzy logic application algorithms this is your book.
Too much padding, too many typosReview Date: 2004-09-07
It has too many errors. With highly technical material, it is imperative that the information is correct or else you can't trust it. For example a minus instead of a plus does not help when explaining terminology.
Only half the book is really about fuzzy logic. There is far too much padding eg. 1.large diagrams showing Moore's Law and the layers in an IC gate. These are not subjects that should be covered in a book on fuzzy logic and one is forced to conclude that the author had a page quota to be reached and did it by adding these secions and large verbose reference sections.
A worked example or an appendix showing an algorithm in C would have been far more useful.
Embedded Applications with "Fuzzy Logic"Review Date: 2004-02-06
In summary the book contains the right material, it is presented in an easy to absorb manor and is practically oriented. I highly recommended it to embedded engineering students, or engineers and managers facing the challenges of fuzzy logic based project. I'll consider five stars for this book.
Good but many errorsReview Date: 2004-01-23

Used price: $9.50

Do not waste your timeReview Date: 1999-09-06
Very explanatory book about neural nets.Review Date: 1997-09-30
look at the cover before you buy itReview Date: 2001-06-07
This is not a book for developers unless they are just getting started and have never heard of neural nets or data mining. I found this little book helpful for providing easy-to-understand reviews for beginning AI students and non-technical business people.
Some of the other reviewers of this book are unfairly slamming this book for not being technical enough, when clearly that is not the intention of the book. There are no formulae in this book, but there are some nice diagrams that get the point across for beginners. The chapter on agents seemed a little misplaced, but otherwise, for learning about neural nets, this is not a bad book. For a pure biz-oriented "intro to data mining" I prefer the Adriaans book, however.
A book long magazine article: no code but no substanceReview Date: 1999-07-15

Used price: $218.26

Very good for a first book in the fieldReview Date: 2000-10-13
What a price ?!Review Date: 2002-04-27
I rate it 4/5 because of its expensive price.
Great Expectations !!Review Date: 2001-07-19
(1) It is merely a collection of papers for the same author lacking proper organization;
(2) Blank pages are deliberately left between chapters, also figures are placed on separate pages this can tell you a lot regarding the quality you expect;
(3) The book is expensive ,I think the author should make it the half or less ;
(4) A researcher in this field hardly sees the book as a reference;
(5) Other topics are ignored ex:Tensoral methods;ICA is not only about Infomax;
(6) The first pages compose the climax of the book ,the rest is just loose and even abscent concepts;
(7) Finally,I think that the book was published too early ,it seems a lot of maturity could have been witnessed if the author waited instead.
Anyone new will be presented to the name of the subject but not the subject itself .The book by Hyvarinen should be available ... ,go for it.I believe life will be a lot easier .The latter is divided into four parts which clearly puts the reader in the right place to start and are : (I) Mathematical Preliminaries (II) Basic Independent Component Analysis (III) Extensions and related Methods (IV) Applications of ICA ,also after reading the sample chapter and contents I think you will not be disappointed . ....
An average bookReview Date: 2001-07-07
The applications side is dominated nearly entirely by the biomedical applications to which Lee is associated with, with a small foray into the world of feature extraction.
The introduction and conclusions are well written, though more detail could have helped. There are a few errata throughout though this is normal for a first book. All in all a book with a rather narrow focus.


Elegant theoretical apparatusReview Date: 2007-09-19
A central issue that arises is what values the neural couplings can take on. The book outlines the consequences of various choices. Rational-valued neural networks turn out to be Turing machines, a contribution of general significance. The book shows (and perhaps unduly emphasizes) that irrational-valued couplings can yield Superturing computation, a result which has been controversial.
If irrational numbers can arise in a computational setting, then the work outlined here is clearly a major landmark that deserves the careful, systematic exposition the book provides. On the other hand, maybe irrational numbers are just not relevant to actual computational devices. (They certainly aren't yet.) If so, the book is still a worthwhile theoretical exercise leading to an elegant set of results. Even if one leans toward the latter option - and I would say that this is probably the vast majority - I don't think any of us really _know_ where the irrational numbers stand vis-a-vis our computational universe.
Even if you intuitively see that an infinitely rich source of information, which is what an irrational number provides, should yield Super-Turing computation, the book is still valuable. (If you don't have this intuition, think about it more!) There is a lot to be gleaned from the non-obvious (at least to me) details of how that intuition works itself out.
The book has more technical flaws. The author periodically states results without really explaining fully, or even at all. This leaves a good deal of work to the reader. I would expect to spend a few hours per page, here and there, though usually it will move quicker. A major issue is also the challenging notation, which is often more difficult than it needs to be. The book's introduction to advice turing machines is also insufficient; you'll need to do a bit of background reading if you don't know much about them.
Hypercomputation in the limits of classical physical realityReview Date: 2000-07-11
Over the last decade, researchers have speculated that although the Turing model is indeed able to simulate a large class of computations, it does not necessarily provide a complete picture of the computations possible in nature. As pointed out by Hava Siegelmann, the most famous proposals of new models were made by Richard Feynman and Roger Penrose. Feynman suggested making use of the non-locality of quantum physics. Penrose, who was motivated by the model of the human brain, argued that the Turing model of computing is not strong enough to model biological intelligence. In response, several novel models of computation have been put forth: among them the quantum Turing machine and the DNA computer. These models compute faster than Turing machines and thus are richer under time constraints. However they cannot compute non-recursive functions, and in this sense are not inherently more powerful than the classical model. The analog recurrent neural network model of Hava Siegemann computes more than the Turing machine, not only under time-constraints, but also in general. In this sense it can be referred to as a hypercomputation model.
The use of analog recurrent neural networks for computability analysis is due to Hava Siegelmann and Eduardo Sontag. In Hava Siegelmann's book, she used them to establish lower bounds on their computational power. These systems satisfy the classical constraints of computation theory, namely, (a) input is discrete (binary) and finite, (b) output is discrete (binary) and finite, and (c) the system is itself finite (control is finite). The infiniteness may originate from two different sources: the system is influenced by a real value, which can be a physical constant, directly affecting the computation, a probability of a biased binary random coin or any other process; the infiniteness may also come from the operations of an adaptive process interleaved with the computation process, like is the case in our brains. Neurons may hold values within [0,1] with unbounded precision. To work with such analog systems, binary input is encoded into a rational number between 0 and 1, and the rational output is decoded into an output binary sequence. The technique used in this book consists of an encoding of binary words into the Cantor Set of base 4. Within this (number-theoretic) model, finite binary words are encoded as rational numbers in [0,1]. We may then identify the set of computable functions by analog recurrent neural nets, provided that the type of the weights is given. This research program has been systematically pursued by Hava Siegelmann at the Technion and her collaborators.
The first level of nets is NET[integers]. These nets are historically related with the work of Warren McCulloch and Walter Pitts. As the weights are integer numbers, each processor can only compute a linear combination of integer coefficients applied to zeros and ones. The activation values are thus always zero or one. In this case the nets 'degenerate' into classical devices called finite automata. It was Kleene who first proved that McCulloch and Pitts nets are equivalent to finite automata and therefore they were able to recognize all regular languages. But they are not capable of recognizing well-formed parenthetic expressions or to recognize the nucleic acids for these structures are not regular...
The second relevant class Hava Siegelmann considers is NET[rationals]. Rationals are indeed computable numbers in finite time, and NET[rationals] turn to be equivalent to Turing machines. Twofold equivalent: rational nets compute the same functions as Turing machines and, under appropriate encoding of input and output, they are able to compute the same functions in exactly the same time. Even knowing that rationals are provided for free in nature, rationals of increasing complexity, this ressource do not even speed up computations with regard to Turing machines. The class NET[rationals] coincide with the class of (partial) recursive functions of Kurt Gödel and Kleene. About them it is said that they constitute the whole concrete, realizable, mathematical universe.
The third relevant (and maybe surprising to the reader) class is NET[reals]. Reals are indeed in general non computable. But theories of physics abound that consider real variables. If the reader look at these theories from a more epistemological point of view as approximative models, then we argue that while some alternative theories are not available, if the old models can encode hypercomputations, then they are not simulable in digital computers. The advantage of making a theory of computation on top of these systems is that nonuniform classes of computation, namely the classes that arise in complexity theory using Turing machines with advice, are uniformly described in NET[reals]. As shown in Hava Siegelmann's book all sets over finite alphabets can be represented as reals that encode the families of boolean circuits that recognize them. Under efficient time computation, these networks compute not only all efficient computations by Turing machines but also some non-recursive functions such as (a unary encoding of) the halting problem of Turing machines.
A novel connection between the complexity of the networks in terms of information theory and their computational complexity is developed, spanning a hierarchy of computation from the Turing to the fully analog model. This leads to the statement of the Siegelmann-Sontag thesis of 'hypercomputation by analog systems' analogously to the Church-Turing thesis of 'computation by digital systems'.
A beautiful non-standard theory of computation is presented in 'Neural Networks and Analog Computation'. I strongly recommend the careful reading of Hava Siegelmann's book, to enjoy the uniformity of nets description and to ponder where hypercomputation begins in the limits of classical physical reality.
Lots of notation, little contentReview Date: 2002-11-28
Cogently argued but fatally flawedReview Date: 2002-04-23

Used price: $2.99

How can I get this book? please help!Review Date: 2004-07-14
THANKS A LOT!
Useful workbook to learn about ANNsReview Date: 2000-11-26
Badly out of dateReview Date: 2000-07-05
Badly out of dateReview Date: 2000-07-05
Used price: $3.00
Collectible price: $44.81

Upbeat, but oddly organized and a little unclearReview Date: 2000-05-08
PET scanning is a low resolution technique that produces a computed picture of oxygen uptake by tissues in the brain. The experimental idea is to get the brain of a human experimental volunteer to do something - recite the multiplication tables, say - and then try to notice whether and how the given project changes the relative oxygen demand of brain tissue in various regions of the brain.
The hope would be to identify local volumes of brain tissue which are associated with and thus perhaps even perform some basic psychological function. In practice, the brain obligingly lights up here and there - presumably consuming oxygen in order to energize its thinking.
From the explanations given in the book, it appears that the PET scanned pictures, which are quite beautiful, are thought to reflect heightened metabolic activity in the nerves of the brain, and only in the nerves. The book speaks often about functional brain "modules" and "assemblages of nerves." It is not clear to me, from the text, just how the scanner distinguishes between the nerves and all the other types of tissue in the brain. The glia, for example, outnumber the nerve cells about 9 to 1 in the brain, and these cells breathe oxygen too. In other words it is not clear, from the book, how the scanner somehow selectively singles out nerve cells and snaps their picture.
And maybe it doesn't. I was left wondering what a PET scan of some other complex organ, such as the liver, looks like. The PET technique may just be fine, brilliant in fact, but if it is, then maybe it deserves a clearer explanation that I could find in here.
The best book about the hardware of neurotechnology.Review Date: 1998-08-10
Instead of more theory, Images Of Mind describes the machinery neuroscientists use to take all the pictures that have sparked all the theories about how the brain works. Complete with lush illustrations and lucid descriptions, Images takes the reader on a historical tour of the devices scientists have used to "watch" the mind work. From EEGs to PET scanners, Raichle and Posner describe how neurotechnological devices work and what they measure.
The writing is direct and elegant, meant for the pro and the layperson.
Since it is irreproducible, it is uselessReview Date: 1999-03-08
Related Subjects: Conferences Companies Research Groups People Software Organizations Books Publications
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250