Machine Learning Books
Related Subjects: Case-Based Reasoning Companies Mailing Lists Conferences Research Groups Software Datasets 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

Used price: $25.56

Trick philosophyReview Date: 2004-07-13
Ignore the previous comments on "trick philosophy"Review Date: 2005-04-24
For example, the concepts we employ to think and the words we use to speak have meanings. But there is nothing in computationalism as syntax that has any meaning whatsoever. Whatever meaning an implemented formal program has results from its being programmed or interpreted by us. Syntax (e.g., a computer program) has no causal powers. Whatever causal powers computers have (e.g., to fly airplanes) results from our programming and our assigning interpretations to the electrical charge insides a chip, not from the program in itself.
The chapters in Views Into the Chinese Room attack different aspects of the CRA. But they address it as an argument that stands or falls on the truth of the premises and the validity of the inference, not on engineering questions such as the speed of computers, which are irrelevant. Searle believes that there are, in fact, thinking machines -- we human beings are biological machines that think. And he believes that there also could be artificially made machines that think. The CRA is meant to show only that an implemented computer program by itself cannot generate mental content or semantic content.
For a clear explanation of the CRA, see chapter 15 of this book, by Stevan Harnad, the editor of The Behavioral and Brain Sciences, where Searle's original paper appeared twenty years ago. Do not rely on reviewers who do not understand the argument in the first place.

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: $26.74

Wrong combination of GAs and application domainReview Date: 2002-09-23
Finally, for a book published in 1999, the bibliography offered is missing a lot of important papers published during the 90's in the fields of physical design for VLSI as well as Genetic Algorithms.
The essential guide to application of GAs to electronics.Review Date: 2000-10-09
This work specific to electrical engineering, in conjunction with Goldbergs's broader treatment of the general subject, together constitute an essential and complete treatment for both the experienced and learning engineer. I have been fortunate to attend professional lectures by one of the authors (Rudnick) and can attest her clarity of expression and ability to easily cover complex material is present throughout the text.
The author's lucid treatment of the subject makes this the fundamental work on application of GA technology to VLSI design.
Used price: $1.81

Too frustrating!!!Review Date: 2007-09-07
What a great book! It should be back in print!Review Date: 2001-10-24

Used price: $65.00

Good general overview of the field, but quite unevenReview Date: 2007-08-24
This book goes for breadth, in a very ambitious take on Petri nets: to cover the complete range of activities of systems engineering supported by nets, from modelling to verification to validation and execution, including case studies in application domains. All this in a complete, self-contained volume. And it mostly succeeds in giving a general view of the possible uses of Petri nets and the research areas related to these nets. So it may be useful to both practicioners and researchers.
The chapters are divided into parts, according to the many aspects investigated: Part I is on basic concepts of Petri nets, including its features, models, definitions and properties. Part II takes on modelling systems with Petri nets. Individual techniques and complete methods (e.g. state-based modelling and event-based modelling) are presented, and case studies analysed. Then, Part III includes four chapters about verification of Petri net models, presenting an array of different techniques and approaches: state-space-based model checking, structural methods, deductive logic-based methods and techniques based on process algebras. Finally, Part IV is about validation and execution of nets, including code generation from net models, and Part V showcases three application domains for the nets: manufacturing systems, workflow systems and telecommunications.
To cover all this ground in the subject of Petri nets, the book was written collectively by more than 20 authors; even some of the chapters are divided into sections written by different people. This naturally results in noticeable variations of style and quality between chapters, and even between sections in the same chapter. Although some effort was spent to try to integrate them better, some sections (and chapters) are quite convoluted and hard to understand, while others are very clear and informative. The notation and style of presentation also changes, but this is mostly not a problem, because chapters often tackle different problems. Also, most of the sections that are difficult to grasp include references that can be used to learn more about the subject. Some sections are really very superficial, covering only the major ideas involved in some technique or method, and sweeping most of the meaty details under the rug, to the references. Unfortunately, some sections don't include enough references to track the original work from which they're based.
Finally, a warning regarding the title: it seems mostly directed to practicioners, but actually includes a lot of material that can be classified as recent research, and so not thoroughly in the field. This is very valuable to a researcher on Petri nets, who can get in contact with a lot of the research on nets done elsewhere, but may be not directly useful to practicioners. Even so, users of Petri nets that are not very interested in research results may take from the book a general idea of tools and possibilities that can be used with net models in all the stages of systems design and execution.
For all readers, I believe this book is mostly useful as a collection of pointers to further research or experimentation.

Used price: $7.15

College Books - Blueprint ReadingReview Date: 2008-06-27
Used price: $5.99

It's okReview Date: 2006-05-02
It's a sleeperReview Date: 2004-10-03
Simply godawfulReview Date: 2004-04-23
Linz' utter ineptitude towards writing is what gives this book 1 star. Examples throughout chapters are sparse and relatively worthless. Sample problems at the end of the chapter, in contrast, are ridiculously difficult, and the solutions in the back don't offer any explanation whatsoever towards the answers.
This is the only book I have ever read that actually made me feel dumber for reading it. It's simply demeaning. Rather than explaining or justifying his logic, as he should to the target audience of this book, he simply uses "it's obvious that..." repeatedly for sample problems and solutions. A ridiculously complex problem's solution in the back of the book will be whittled down to two lines at best, half of which says something along the line of "It's blatantly obvious that the answer is ___, and you're stupid for not realizing it."
If you're actually assigned graded work from this book, may god have mercy on your soul.
Boring subjectReview Date: 2004-01-21
Too advanced for most CS studentsReview Date: 2006-03-12
Look, most undergraduate computer science majors might not need a book as formal as this one. It really is best suited for computer scientists with a strong maths inclination. Many CS students study specific languages, some algorithms, and [hopefully] the hardware of an abstract Neumann machine.
But concepts like the left quotient of a language are really only used by those who want a grand view across all computing languages. And who possibly want to design a new language. This is beyond the capabilities of most CS majors. And so is this book.


Very useful bookReview Date: 2003-06-27
The worst book everReview Date: 2002-12-05
I have used the three first source code and ... they are so buggy.
They're wrote in C but doesn't compile due to evident syntax errors (so evident, are they here so as to made these source code unusable ?).
The content of the book is not equilibrate (some metaheuristics aren't discussed thoroughly).
If the authors use there source code, I think evereything presented in this book is completely false.
Don't buy it, there are some better books to buy.
SuperficialReview Date: 2001-03-26
Used price: $0.01
Collectible price: $10.95

NOVICE BOOK OF PROGRAMMING Computer Numerical Control.Review Date: 2001-03-02
Climbing a Tree to Harvest TurnipsReview Date: 2004-01-28
There could be a benefit when someone outside the industry looks at what we do with new eyes and ears. It is not as if our own industry's authors are casting their explanation of CNC in a vocabulary of contemporary technological sensibilities. They are stuck in the 1970's and have never been able to explain properly such basic CNC features as interpolation. Coming from nowhere, however, Mr. Seamas flops around with no ability to descern when by accident he happens upon something fresh. He doesn't have the experience (nor, I doubt the prerequisite engineeringing education) to recognize this to do anything with it.
In addition, the book fails badly as a basic primer on CNC. The lowest score an Amazon reviewer can give a book is "1" star, but really, this book is a zero. You are better off with any number of books by other authors.

Used price: $4.98

patchy but interestingReview Date: 2000-08-07
pretty trashyReview Date: 2000-06-15
He calls propositional learning "fence'n'fill" algorithms, because they basically carve up the input space (e.g., a perceptron uses linear boundaries). The advantage is that they are fast and well-understood. In the final chapter, he proposes an algorithm for relational learning which is based on top of a standard fence-n-fill algorithm, but doesn't explain it well, and doesn't give any compelling evidence that it works. The papers on his web site are no better.
He intersperses what little technical material he has with some historical anecdotes about code-breaking during WWII, etc. It's not really clear what the connection is. Overall, the book just does not hang together.
If you felt inclined to buy this book, I would recommend you check out Andy Clark's excellent "Being There" instead.
Related Subjects: Case-Based Reasoning Companies Mailing Lists Conferences Research Groups Software Datasets 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
Yet if you are asked to act like a computer by reading numbers, moving paper tape, erasing things and following instructions given on the paper tape, you will prove to be one of the slowest computers in the world. The original word `computer' referred to a man sitting in a room with paper, pencil and eraser. These human `computers' were replaced by machines a long time ago because they are too slow.
In summary, humans are fast and intelligent at being humans but slow at being computers. In the Chinese Room Argument, John Searle states that although we have a human mind which could otherwise be used to understand Chinese, this particular human mind does not in fact understand it. Given this stipulation, the human mind's ability to process language cannot be used and the only method of "understanding Chinese" is left to the "Chinese room" which consists of a computer run by the very slowest of CPUs, the human being sans abacus, sans calculator, sans silicon chips and sans hope.
The Chinese Room Argument is a trick argument that proves nothing. The computer room is so slow that it cannot ever think or understand Chinese. On the other hand, this doesn't say anything about whether a high-speed computer with the memory and processing power of the human brain might one day speak and understand Chinese quite well.