Scribd
Upload
4 views1 page

Lisp Programs for AI Algorithms

The document outlines 7 practical exercises for an artificial intelligence course, involving implementing various algorithms in Lisp: 1) Demonstrate an artificial neuron by calculating the weighted sum and output of input and weight vectors using activation functions. 2) Demonstrate a fuzzy system controlling an inverted pendulum by converting angle and velocity inputs to fuzzy values and applying rules to get a motor control output. 3) Implement a decision tree to split decimal string ranges and find digit repetitions. 4) Implement the k-nearest neighbor algorithm to select neighbors of a random decimal string entry. 5) Perform roulette wheel selection on a binary string population using bit repetition fitness. 6) Demonstrate crossover by performing it on a binary string

Uploaded by

Kiran Mahajan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
4 views1 page

Lisp Programs for AI Algorithms

The document outlines 7 practical exercises for an artificial intelligence course, involving implementing various algorithms in Lisp: 1) Demonstrate an artificial neuron by calculating the weighted sum and output of input and weight vectors using activation functions. 2) Demonstrate a fuzzy system controlling an inverted pendulum by converting angle and velocity inputs to fuzzy values and applying rules to get a motor control output. 3) Implement a decision tree to split decimal string ranges and find digit repetitions. 4) Implement the k-nearest neighbor algorithm to select neighbors of a random decimal string entry. 5) Perform roulette wheel selection on a binary string population using bit repetition fitness. 6) Demonstrate crossover by performing it on a binary string

Uploaded by

Kiran Mahajan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

Practical 1 : Logistic Signal Functions Write a program in Lisp to demonstrate working of an artificial neuron.

Enter an input vector X and weight vector W. Calculate weighted sum XW. Transform this using signal or activation functions like logistic, threshold, hyperbolic-tangent, linear, exponential, sigmoid or some other functions (syntax provided) and display the output. Test your program on the following inputs: 1 to 5 (X,W,c,n). Practical 2 : FAM Write a program in Lisp to demonstrate that a fuzzy system is a structured numerical estimator using example of controlling an inverted pendulum. (Enter two strings for angle of pendulum and angular velocity . Convert them into strings of fuzzy using five fuzzy set values NM( Negative medium), NS (Negative Small), ZE(Zero), PS (Positive Small) and PM ( Positive Medium). Apply FAM rules to find the output values v, the current to the motor control of the pendulum to each input set of (, ). Create a string of fuzzy output values of the current.) Practical 3 : DECISION TREE Write a program in Lisp to implement a decision tree. (Enter a decimal string of repeated entries of suitable length. Apply binary decision tree to split the range about the midpoint to find repetitions of each decimal digit in the string.) Practical 4 : K-NEAREST ALGORITHM Write a program in Lisp to implement the data mining algorithm k-nearest neighborhood. (Enter a decimal string of suitable length. Select an entry of the string randomly. Generate a random number k. Construct a string consisting of k-neighbors of the chosen entry.) Practical 5 : ROULETTE WHEEL SELECTION Write a program in Lisp to perform roulette wheel selection. (Enter a population of binary strings. Consider fitness value as the number of repetitions of a specified bit (say 1) in the string.) Practical 6 : CROSSOVER Write a program in Lisp to demonstrate the crossover genetic operator. (Enter population of binary strings. Perform crossover based on a random crossing site value. Consider fitness value as the number of repetitions of specified bit in the string. Perform the evolution for a specified number generation). Practical 7 :. MUTATION Write a program in Lisp to demonstrate the genetic operator mutation. (Enter a population of binary strings. Perform mutation based on a random mutation point. Consider fitness value as the number of repetitions of a specified bit (say 1) in the string. Perform the evolution for a specified number generation.)

You might also like