Robert Marks.org EGR 5358
 HOME Robert Marks.org Time Scales.org Neo Swarm.com Handbook of Fourier . . . Analysis.com Mystery of Lifes . . . Origins.org GunsmokeNet.com Christian Calculus.com The Chortle.com Robert Marks.org River Ranch Retreat.org Theater of the Ears.com Monika Marks.com Marilee Marks.com Joshua Marks.com Leslie Marks.com Jeremiah Marks.com Bob Marks.org Home Way Bak Robert Marks.org

 EGR 5358 Introduction to Computational Intelligence Distinguished Professor Robert J. Marks II Text: Reed & Marks . Search Why Design Information is Required to Find Improbable Complex Targets” (ppt) D&D | UHF Info in Search" Information. What is It? (Video) William A. Dembski and Robert J. Marks II, "Conservation of Information in Search: Measuring the Cost of Success," IEEE Transactions on Systems, Man and Cybernetics A, Systems and Humans, vol.39, #5, September 2009, pp.1051-1061 (Paper introducing active information) The Fisher Discriminant Duda Bob's Notes Fisher Iris Data Genetic Algorithms (see Chapter 11 of Reed & Marks, Neural Smithing) x Particle Swarm Optimization, ppt (Marks) | pdf (Shi) Zadeh's Paper Fuzzy Inference Engines Rosenbrach Bananas Disjunctive vs Conjunctive Systems Swarm reading Homework: 1. Using random search, solve the Cracker Barrel Puzzle. (Due January 31) 2. Monte Carlo: Find the probability of winning the Cracker Barrel Puzzel by (a) choosing a hole at random, and (b) choosing at random the next move from the set of available moves. What is the probability of success? Call this probability p. What is the estimate of the difficulty of the problem in bits, i.e. what is the endogenous information of the problem. Next, find the probability of winning if you always start with hole #1 empty. Call it q[1]. Then hole #2. Call it q[2]. Etc. Some of the holes will have probabilities greater than p. Others less than p. Compute the exogeneous information and the active information for each in bits. Which hole or holes gives the greatest active information? Number 3 & 4 on the list above gives required background (Also presented in class). Due Feb 9. 3. Iris data classification. Use the versicolor and virginica iris data. Train an (unlayered) perceptron to classify the two types of irises. Then use the Fisher discriminant to do the same thing. Look at the ROC curves for each. Is there any conclusion you can make? Due Feb 21. 4a. Train the perceptron in Problem 3 using particle swarm. 4b. Show the distributive laws and DeMorgan's laws for min-max fuzzy logic work. Neural Networks

The material on this web site does not necessarily represent the views of and has not been reviewed or approved by Baylor University.

The material on this web site does not necessarily represent the views of and has not been reviewed or approved by Baylor University