Showing posts with label machine learning. Show all posts
Showing posts with label machine learning. Show all posts

Foundations of Genetic Programming Review

Foundations of Genetic Programming
Average Reviews:

(More customer reviews)
Langdon and Poli are both internationally recognized experts in Evolutionary Computation (EC) and, in particular, Genetic Programming. They have both contributed extensively to the theoretical "foundations" of GP and hence may speak with no small degree of authority about GP theory. As a physicist working in EC I like the balance that the authors have struck between mathematical rigor and understandable intuition. The book is not as rigorous as Vose's well known GA book. However, it is much easier to read. Neither does it take the "engineering" rule of thumb approach, as does Goldberg's book for instance. It covers very well recent important developments in the theory of GP and in that sense makes very good reading for anyone with a serious interest in EC theory. It is not for the novice, even though technically it is not a difficult book. It is really a research monograph and not a textbook. In that sense the title is a little bit misplaced. With the exciting direction the authors are pointing in I believe that in five years time another book of the same title should truly be able to lay out what are the foundations of GP theory and also show the theoretical unity that exists between the different branches of EC.

Click Here to see more reviews about: Foundations of Genetic Programming

Product Description:
Genetic programming (GP), one of the most advanced forms of evolutionary computation, has been highly successful as a technique for getting computers to automatically solve problems without having to tell them explicitly how. Since its inceptions more than ten years ago, GP has been used to solve practical problems in a variety of application fields. Along with this ad-hoc engineering approaches interest increased in how and why GP works. This book provides a coherent consolidation of recent work on the theoretical foundations of GP. A concise introduction to GP and genetic algorithms (GA) is followed by a discussion of fitness landscapes and other theoretical approaches to natural and artificial evolution. Having surveyed early approaches to GP theory it presents new exact schema analysis, showing that it applies to GP as well as to the simpler GAs. New results on the potentially infinite number of possible programs are followed by two chapters applying these new techniques.

Buy NowGet 31% OFF

Want to buy Foundations of Genetic Programming at other amazon sites? Click the corresponding icon below:



buy it at amazon.combuy it at amazon.co.ukbuy it at amazon.cabuy it at amazon.debuy it at amazon.fr

Computational Intelligence: An Introduction Review

Computational Intelligence: An Introduction
Average Reviews:

(More customer reviews)
This book is suitable for undergraduates and first-year graduate students in computer science who are interested in getting an overview of what is and has been done in a field that used to be classified as "artificial intelligence". The new designation as "computational intelligence" was done so as to distance it from other activities in artificial intelligence that are deemed somewhat exotic, such as the efforts to build autonomous thinking machines. The book can be read very quickly, due to the sparse nature of the paragraph organization, and the author puts exercises at the end of each chapter to test the reader's insight and problem solving ability.
The author divides his book into five parts, the first one being an introduction and history, and the next four being on neural networks, evolutionary computation, swarm intelligence, and fuzzy systems. The third part is relatively new on the scene in computational intelligence, and so its inclusion in this book is welcomed.
Neural networks have been extensively used in the last four decades in many different fields, such as financial engineering, bioinformatics, physics, and network analysis. The author devotes six chapters to their elucidation, and he discusses the most important types of artificial neural networks and the different learning schemes employed by them. Detailed derivations and pseudocode are given for these, particularly for back-propagation, and the "LeapFrog" and "conjugate gradient" approaches to optimization. Most interesting is the inclusion of a "swarm optimization" technique. Although brief, the author includes pseudocode and references for further reading.
The author includes a discussion of product unit neural networks, which are sometimes not treated in other books on neural networks. In this type of neural network, the neurons compute the weighted product of the input signals, and the author includes a "distortion factor" that allows the dynamical shaping of the activiation function during the training phase. Only a cursory discussion of what it actually means for a neural network to learn is given, but references for further reading are included. The author also includes a nice discussion of performance issues in the use of neural networks. Readers who eventually use them in practice will find that neural networks can be computationally intensive. An interesting inclusion in this discussion is that of the VC-dimension, and how it relates to the total number of weights in a 1-hidden layer network, and thus of the number of training examples needed. The reader is asked to investigate the role of the Huber function in making a neural network more robust to outliers. The author cautions the reader that the use of neural networks should not be taken lightly and great care is need to insure optimal performance.
In part 3 the author treats genetic and evolutionary programming, evolutionary strategies, differential and cultural evolution, and co-evolution. The use of these techniques has dramatically increased in the last decade, especially in optimization problems. The author points out the role of finding the right chromosome representation in the design of an evolutionary algorithm, this serving also as a kind of classification of the different approaches: binary strings for genetic algorithms, tree representations for genetic programming, and real numbers for evolutionary programming. The author compares briefly the use of evolutionary computing versus using techniques from classical optimization theory, with the role played by the "no-free-lunch" theorem. The author holds that evolutionary algorithms are superior for discontinuous, nondifferentiable, multimodal, and noisy problems.
Of personal interest to me, an application of genetic algorithms to routing optimization is discussed in this part. The author also briefly mentions "niching" as a method to locate multiple minima and asks the reader to develop a genetic algorithm to train a feed-forward neural network as an exercise. For readers who have a knowledge of LISP the discussion on genetic programming will seem much more natural. Evolutionary programming, which differs from genetic algorithms and genetic programming with its omission of crossover and its emphasis on simulating adaptive behavior in evolution, and not genetic models is given ample treatment, along with some useful pseudocode. An elementary application to function optimization is given. The discussion on evolutionary strategies is a fine one since the ones in the literature may be too difficult mathematically for a reader at this level. The discussions on differential and cultural evolution, and coevolution are too brief however (only a few pages devoted to each).
Of great interest to me was the part on swarm intelligence, as my knowledge of this field is very meager. It has taken on importance recently in research circles and so I was very interested in seeing if could be used successfully in practical optimization problems. Having just begun to get my feet wet in swarm intelligence algorithms, this part was a good help in giving me more insight into the use of them. This book is one of the few that covers swarm intelligence, most of the literature still being found in online preprints and published journal articles. The author callsone approach "particle swarm optimization" (PSO), and he explains how the different social interaction schemes serve to classify the algorithm, going by the namnes of star, ring, and wheels topology. He also discusses various modifications to PSO that improve its convergence and to increase its diversity. Another approach is based on the social interaction of ants, and is called appropriately "ant colony optimization". This approach has been applied with some success to route assignment in packet networks, and has been shown to be competetive with vector-distance and link-state shortest path algorithms. It remains to be seen if such an approach will be implemented in real-world network topologies, dominated as they are currently with legacy hardware. The author also gives brief discussions on some of its other applications, such as robotics, and the quadratic assignment, job-scheduling, and graph coloring problems.
I did not read the part on fuzzy systems so I will omit its review.

Click Here to see more reviews about: Computational Intelligence: An Introduction

Product Description:
Computational Intelligence: An Introduction, Second Edition offers an in-depth exploration into the adaptive mechanisms that enable intelligent behaviour in complex and changing environments. The main focus of this text is centred on the computational modelling of biological and natural intelligent systems, encompassing swarm intelligence, fuzzy systems, artificial neutral networks, artificial immune systems and evolutionary computation.
Engelbrecht provides readers with a wide knowledge of Computational Intelligence (CI) paradigms and algorithms; inviting readers to implement and problem solve real-world, complex problems within the CI development framework. This implementation framework will enable readers to tackle new problems without any difficulty through a single Java class as part of the CI library.
Key features of this second edition include:

    A tutorial, hands-on based presentation of the material.
    State-of-the-art coverage of the most recent developments in computational intelligence with more elaborate discussions on intelligence and artificial intelligence (AI).
    New discussion of Darwinian evolution versus Lamarckian evolution, also including swarm robotics, hybrid systems and artificial immune systems.
    A section on how to perform empirical studies; topics including statistical analysis of stochastic algorithms, and an open source library of CI algorithms.
    Tables, illustrations, graphs, examples, assignments, Java code implementing the algorithms, and a complete CI implementation and experimental framework.


Computational Intelligence: An Introduction, Second Edition is essential reading for third and fourth year undergraduate and postgraduate students studying CI. The first edition has been prescribed by a number of overseas universities and is thus a valuable teaching tool. In addition, it will also be a useful resource for researchers in Computational Intelligence and Artificial Intelligence, as well as engineers, statisticians, operational researchers, and bioinformaticians with an interest in applying AI or CI to solve problems in their domains.
Check out http://www.ci.cs.up.ac.za for examples, assignments and Java code implementing the algorithms.

Buy NowGet 44% OFF

Want to buy Computational Intelligence: An Introduction at other amazon sites? Click the corresponding icon below:



buy it at amazon.combuy it at amazon.co.ukbuy it at amazon.cabuy it at amazon.debuy it at amazon.fr

Complexity: A Guided Tour Review

Complexity: A Guided Tour
Average Reviews:

(More customer reviews)
This book is easily the best introductory "guided tour" of complexity I know of.It has several key strengths:

1. Mitchell covers many of the major topics which can reasonably be grouped under the umbrella of complexity, so the breadth of the book is excellent.For my benefit and yours, here are the main topics covered, roughly in the order they appear in the book: chaos, information, thermodynamics, Godel's theorem, Turing machines, evolution, genetics, measures of complexity, fractals, self-reproducing automata, genetic algorithms, cellular automata, artificial life, information processing in living systems, analogy-finding algorithms, game theory, networks, power laws, metabolic scaling, random boolean networks, and historical foundations of complex systems research (cybernetics, general systems theory, synergetics, etc.).This long list leaves out some significant complexity topics, but Mitchell's scope is still plentiful for an introductory guided tour.

2. The topics are covered in sufficient depth to clearly convey the key concepts, which reflects the fact that Mitchell is a scientist who really knows the subject.Though the treatment is certainly introductory, rest assured that this isn't a superficial journalistic popularization which drops lots of names and terminology without getting into any real content.

3. Mitchell's writing style is concise and precise, but still friendly and not at all terse.The book is quite easy to read if you have a decent background in general science.

4. General readers will appreciate that there isn't much formal math in the book, yet Mitchell explains things in a way that nicely intimates the outlines of the math for readers who are math-savvy.

5. Mitchell's presentation is sober and honest.She naturally highlights the potentials and promise of complex systems science, but she also openly acknowledges its past dead ends and likely future limitations.

6. There are biographical notes interspersed throughout the book, which adds a nice human touch.

For completeness, I'll note that I did notice a few technical errors in Mitchell's initial discussion of immunology.But these errors don't invalidate the general message, and can be overlooked, considering the overall excellence of the book.

The bottom line is that I highly recommend this book to anyone interested in complexity (how could you not be?).It's a perfect introduction for beginners, and people well-versed in the subject will also appreciate the convenience of having a high-quality broad overview within the covers of just one book.

Click Here to see more reviews about: Complexity: A Guided Tour



Buy NowGet 34% OFF

Want to buy Complexity: A Guided Tour at other amazon sites? Click the corresponding icon below:



buy it at amazon.combuy it at amazon.co.ukbuy it at amazon.cabuy it at amazon.debuy it at amazon.fr

Ant Colony Optimization (Bradford Books) Review

Ant Colony Optimization
Average Reviews:

(More customer reviews)
Being an ant isn't very complex, but it's a daily fight for life. The losers in that fight don't count, but the winners get to vote.

That is the basis of ant colony optimization. There are many parts to the idea, all of them very simple. First, there are many routes to the goal (food, if you're an ant) - some are better, some worse, you don't know which are which in advance, and the answer may change over time. Second, it's a random search. If you find any answer at all, no matter how convoluted, you get to vote on your route. Third, there are many other ants, all voting. Any leg of a trip that is heavily followed must be part of a good route, and gets many votes. There are details, but that's about it.

Chapters 1-3 are the most readable, and convey the basic spirit of the family of algorithms. Ch. 4-6 will drag a bit, for the general reader, but go into significant detail about the ant algorithm and specific applications.

Ch. 7 ends the book with a warm, informal discussion of the algorithm's history and some delightful variations. Dorigo, the principal author and founder of the ant school, uses this chapter to express his pure joy at having found such a wonderful thing, and at the similar approaches that others have also found.

The approach has some real limits. For example, it can solve only problems that look like finding the shortest route. The good news is that a wide range of unlikely problems can all be cast in these terms. The better news is that, given the many variations available, some form of the 'stigmergic' approach will probably solve any problem in that range. Best of all, though, is the sheer cleverness and the sincere appreciation expressed by the authors.

Nature is economical, but a brilliant problem solver. This is written by someone who as able to listen in on one of the lessons.

//wiredweird

Click Here to see more reviews about: Ant Colony Optimization (Bradford Books)

Product Description:
The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of Ant Colony Optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.

Buy NowGet 20% OFF

Want to buy Ant Colony Optimization (Bradford Books) at other amazon sites? Click the corresponding icon below:



buy it at amazon.combuy it at amazon.co.ukbuy it at amazon.cabuy it at amazon.debuy it at amazon.fr