# UNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Page 1 of 7 UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam in INF3490/4490 iologically Inspired omputing ay of exam: ecember 9th, 2015 Exam hours: 09:00 13:00 This examination paper consists of 7 pages. ppendices: 1 Permitted materials: None Make sure that your copy of this examination paper is complete before answering. The exam text consists of problems 1-35 (multiple choice questions) to be answered on the form that is enclosed in the appendix and problems which are answered on the usual sheets (in English or Norwegian). Problems 1-35 have a total weight of 70%, while problems have a weight of 30%. bout problem 1-35: Each problem consists of a topic in the left column and a number of statements each indicated by a capital letter. Problems are answered by marking true statements with a clear cross (X) in the corresponding row and column in the attached form, and leaving false statements unmarked. Each problem has a variable number of true statements, but there is always at least one true and false statement for each problem. 0.5 points are given for each marked true statement and for each false statement left unmarked, resulting in a score ranging from 0 to 60. You can use the right column of the text as a draft. The form in the appendix is the one to be handed in (remember to include your candidate number). Problem 1 iologically inspired computation is appropriate for Optimization Modelling Safety critical systems Simulation Problem 2 Exhaustive search Not guaranteed to find the optimal solution Test all possible solutions, pick the best Relevant for continuous problems by using approximation Most relevant for large search problems

2 Page 2 of 7 Problem 3 Which of the following are discrete optimization problems? Travelling salesman problem Robot control hess playing program Prediction of stock prices Problem 4 Gradient ascent The direction of the move is towards a larger value Relevant for discrete optimization Is not guaranteed to find the optimal solution The ascent continues until the gradient is very small Problem 5 Exploration in search is Problem 6 What controls the search in simulated annealing? Problem 7 algorithm: Initialization Problem 8 algorithm: Variation operators Problem 9 algorithm: Recombination oncerned with improving the current best solution by local search ombined with exploitation in evolutionary algorithms Often resulting in getting stuck in local optima oncerned with global search Time Temperature Initial solution Final solution Individuals are normally generated randomly Is concerned with generating candidate solutions Mutation of candidates is normally also taking place during the initialization Heuristics for generating candidates can be applied Is a selection operator ct on population level ct on individual level re crossover and mutation lso known as crossover ombines elements of two or more genotypes lso known as mutation lso known as representation

3 Page 3 of 7 Problem 10 algorithm: Survivor selection Problem 11 algorithm: Termination condition Problem 12 Permutation representation Is often stochastic lso known as replacement an be fitness based an be age based Several termination criteria can be combined etermines when to compute the fitness for a population Is checked in every generation Should be avoided to get faster evolution Is used for problems where each variable can only appear once it-flip mutation is applicable mutation operator that swaps at least two values is applicable Is used for problems where each variable can appear multiple times Problem 13 Tree representation Is used in Genetic Programming Mutation results in replacing a randomly chosen subtree by a randomly generated tree Not suited for representing computer programs Is used in Genetic lgorithms Problem 14 Selection pressure Should be high to avoid premature convergence The higher pressure, the harder for the fittest solutions to survive Fitness-proportionate selection avoids selection pressure Rank-based selection can adjust and control the pressure Problem 15 Rank based selection Use relative rather than absolute fitness Use absolute rather than relative fitness Results in less control of the selection pressure than fitness-proportionate selection Ranking can be either linear or non-linear Problem 16 Multimodality In crowding, offspring competes with their nearest parent In fitness sharing, the fitness decreases if there are many candidates in a niche The problem has only one locally optimal solution Periodic migration is not relevant in the island model

4 Problem 17 Simple Genetic lgorithm (G) Problem 18 Strategies (ES) Problem 19 What is most important to be concerned with in the evolution of repetitive problems? Problem 20 What are normally the two best measurement units for an evolutionary algorithm? Problem 21 Multiobjective optimisation problems (MOPs) Problem 22 Learning in neural networks Problem 23 Supervised learning hildren compete with parents in survival selection oth crossover and mutation are applied in each generation The whole population is replaced with the resulting offspring Uses real-valued representation (µ,λ): Select survivors among parents and offspring (µ+λ): Select survivors among parents and offspring (µ-λ): Select survivors among offspring only (µ:λ): Select survivors among offspring only o multiple runs until a good solution is found Execute one run until the solution is good enough Get a reasonably good solution every time Get a very good result just once Number of evaluations Elapsed time PU time Number of generations The travelling salesman problem is an example of a MOP oncurrent optimisation of n possibly conflicting objectives The Pareto front represents the best solutions found The Pareto front consists of dominated solutions Learning takes place in the neurons n error is computed on axon outputs in the human brain Learning takes place in the connections between neurons Weights in a perceptron represent the strengths of synapses esired outputs are not included esired outputs are included Error between desired outputs and actual outputs are computed during training The multi-layer perceptron is trained by supervised learning Page 4 of 7

5 Problem 24 rtificial neural networks Problem 25 Why use Multi Layer Perceptron instead of a single layer perceptron? Problem 26 When can the weights be adjusted in a multilayer perceptron? Page 5 of 7 re trained by adjusting the network size re trained by adjusting weights The weights are either all positive or all negative The learning rate controls the amount of weight change Faster learning Easier programming an solve more complex problems an learn multiple decision boundaries In the forward pass In the backward pass In both forward and backward pass fter computing output values of each training vector Problem 27 The activation function in a multilayer perceptron oes thresholding to 0 or 1 Is used to compute the output value of a node Is used for initialization of the network Makes it possible to train non-linear decision boundaries Problem 28 artesian Genetic Programming Is more restricted than the general Genetic Programming In evolving circuits, the genes determines function and input to each node The level back parameter decides the number of columns in the node-array The problem of bloat is larger than for the general Genetic Programming Problem 29 Swarm intelligence Global behaviour appears as a result of centralized control In Particle Swarm Optimization, velocity and position of particles are updated ommunication through the environment is called stigmergy The probability of choosing a new edge in ant colony optimization is proportional with the pheromone level of the edge

6 Page 6 of 7 Problem 30 Support vector machines Only data vectors defining the margins are needed to represent the support vectors an only classify linearly separable data Map inputs into a higher-dimensional space Margins can be increased by using soft margins Problem 31 Ensemble learning Multiple classifiers are trained to be slightly different Only the best classifier is applied after training Training vectors can be assigned weights during training ll training vectors available should be used for training each classifier Problem 32 Principal component analysis Problem 33 Unsupervised learning Problem 34 K means clustering Problem 35 Reinforcement learning Performs mapping to higher dimensions an be applied for feature extraction omponents represent the directions along with the most variation in the data Is a non-linear transformation an be used for training with data sets containing only inputs No specific error function is used for training Self organizing maps are increasing dimensions in the data multi-layer perceptron can be trained with unsupervised learning Need to know the number of clusters in advance Need to know which cluster a data point belongs to Each cluster center is moved most in the beginning The method always results in the global optimal solution The algorithm is told when the answer is wrong, and how to correct it Is training using rewards policy defines how actions are chosen discount factor is used to discount future rewards

7 Page 7 of 7 Problem 36 (8%) a) riefly explain the evolutionary algorithm terms chromosome, gene, locus and allele by including a figure of a chromosome. b) Explain briefly what a genotype and phenotype are and give an example of each of them. Problem 37 (5%) In a population of three individuals, they have fitness 2, 3 and 5, respectively. What is the probability for selecting each of them when using a roulette wheel? Total fitness= 2+3+5= 10, thus, probability for selection is 1/10 for each of the fitness values: 0.2, 0.3 and 0.5.

8 Page 8 of 7 Problem 38 (9%) a) Show how the following multi-layer perceptron realizes a XOR-function by computing the output of each node and putting the results into a table: Each perceptron accepts inputs being 0 or 1 and contains a threshold activation function. (T) (T) (T) (T) E (T) E (T) T: efore threshold, T: fter threshold. b) What values should the weights in the output layer have to make an inverted XOR function (XNOR)? ll output layer weights must be negated (including to the bias). Weight E = 1, Weight E = -1 and Weight bias = 0.5. Problem 39 (8%) List and explain, with one sentence each, up to four of the ethical recommendations for commercial robots the Euronet Roboethics telier came up with. Safety: There must be mechanisms (or opportunities for an operator) to control and limit a robot's autonomy. Security: There must be a password or other keys to avoid inappropriate and illegal use of a robot. Traceability: Similarly as aircraft, robots should have a "black box" to record and document their own behavior. Identifiability: Robots should have serial numbers and registration number similar cars. Privacy policy: Software and hardware should be used to encrypt and password protect sensitive data that the robot needs to save.

9 ppendix Page 9 of 1 7 INF3490/INF4490 nswers problems 1 35 for candidate no: Problem

10 ppendix Page 10 of 1 7 INF3490/INF4490 nswers problems 1 35 for candidate no: Problem 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 Ο Ο Ο

### UNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences

Page 1 of 7 UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam in INF3490/4490 iologically Inspired omputing ay of exam: November 29th, 2016 Exam hours: 09:00 13:00 This examination paper

### Lecture 19 November 2013

INF90/90 Exam INF90 - Biologically inspired computing Lecture 19 November 201 Jim Tørresen and Eivind Samuelsen Format: Written Tid: December, at 1:0 ( hours) Closed book exam : No materials are permitted

### INF Biologically inspired computing Lecture 4: Eiben and Smith,

INF3490 - Biologically inspired computing Lecture 4: Eiben and Smith, Working with evolutionary algorithms (chpt 9) Hybrid algorithms (chpt 10) Multi-objective optimization (chpt 12) Kai Olav Ellefsen

### Jim Tørresen Chapter 9: Working with Evolutionary Algorithms. INF Biologically inspired computing Lecture 4: Eiben and Smith,

Chapter 9: Working with Evolutionary Algorithms INF3490 - Biologically inspired computing Lecture 4: Eiben and Smith, Working with evolutionary algorithms (chpt 9) Hybrid algorithms (chpt 10) Multi-objective

### Use of Data Mining & Neural Network in Medical Industry

Current Development in Artificial Intelligence. ISSN 0976-5832 Volume 3, Number 1 (2012), pp. 1-8 International Research Publication House http://www.irphouse.com Use of Data Mining & Neural Network in

### Genetic Algorithms in Robotics

Genetic Algorithms in Robotics Julius Mayer Universität Hamburg Fakultät für Mathematik, Informatik und Naturwissenschaften Technische Aspekte Multimodaler Systeme October 31, 2016 J. Mayer 1 Outline 1.

### Question of the Day. 2D1431 Machine Learning. Exam. Exam. Exam preparation

Question of the Day 2D1431 Machine Learning Take two ordinary swedish kronor coins and touch them together. Tough, huh? w take a third coin and position it in a fashion so that it touches the other two.

### Lecture 16 November 2015 Summary & Questions

INF3490 - Biologically inspired computing Lecture 16 November 2015 Summary & Questions Jim Tørresen INF3490/4490 Exam Format: Written When: December 9, at 09:00 (4 hours) Closed book exam : No materials

### Application of Genetic Algorithm and Neural Network in Forecasting with Good Data

Application of Genetic Algorithm and Neural Network in Forecasting with Good Data P. MAKVANDI, J.JASSBI, S.KHANMOHAMMADI System Department I.A. University, Science & Research campus Poonak sq. Ashrafi

### Lecture 2 Fundamentals of machine learning

Lecture 2 Fundamentals of machine learning Topics of this lecture Formulation of machine learning Taxonomy of learning algorithms Supervised, semi-supervised, and unsupervised learning Parametric and non-parametric

### CSCI 446 ARTIFICIAL INTELLIGENCE EXAM 1 STUDY OUTLINE

CSCI 446 ARTIFICIAL INTELLIGENCE EXAM 1 STUDY OUTLINE Introduction to Artificial Intelligence I. Definitions of Artificial Intelligence A. Acting Like Humans -- Turing Test B. Thinking Like Humans -- Cognitive

### Machine Learning and Artificial Neural Networks (Ref: Negnevitsky, M. Artificial Intelligence, Chapter 6)

Machine Learning and Artificial Neural Networks (Ref: Negnevitsky, M. Artificial Intelligence, Chapter 6) The Concept of Learning Learning is the ability to adapt to new surroundings and solve new problems.

### [Em_Deplo] Morphogenesis

[Em_Deplo] Morphogenesis Dr. Ana Cocho-Bermejo Barcelona Tech, Architect & Morphogenetic Designer, www.emdeplo.com, Barcelona, Spain, ana@emdeplo.com Summary: Developing the concept of Human Oriented Parametric

### Comparison of GA-Based Algorithms: A Viewpoint of Learning Scheme

2017 2nd International Conference on Communications, Information Management and Network Security (CIMNS 2017) ISBN: 978-1-60595-498-1 Comparison of GA-Based Algorithms: A Viewpoint of Learning Scheme Guo-sheng

### Connectionist Learning Procedures. Siamak Saliminejad

Connectionist Learning Procedures Siamak Saliminejad Overview 1. Introduction 2. Connectionist Models 3. Connectionist Research Issues 4. Associative Memories without Hidden Units 5. Simple Supervised

### Lecture 3.1. Reinforcement Learning. Slide 0 Jonathan Shapiro Department of Computer Science, University of Manchester.

Lecture 3.1 Rinforcement Learning Slide 0 Jonathan Shapiro Department of Computer Science, University of Manchester February 4, 2003 References: Reinforcement Learning Slide 1 Reinforcement Learning: An

### Evolving Artificial Neural Networks

Evolving Artificial Neural Networks Christof Teuscher Swiss Federal Institute of Technology Lausanne (EPFL) Logic Systems Laboratory (LSL) http://lslwww.epfl.ch christof@teuscher.ch http://www.teuscher.ch/christof

### DM534 - Introduction to Computer Science

Department of Mathematics and Computer Science University of Southern Denmark, Odense October 11, 2017 Marco Chiarandini DM534 - Introduction to Computer Science Training Session, Week 41, Autumn 2017

### Big Data Classification using Evolutionary Techniques: A Survey

Big Data Classification using Evolutionary Techniques: A Survey Neha Khan nehakhan.sami@gmail.com Mohd Shahid Husain mshahidhusain@ieee.org Mohd Rizwan Beg rizwanbeg@gmail.com Abstract Data over the internet

### Creating a Difficulty Metric for A Sudoku Variation

Creating a Difficulty Metric for A Sudoku Variation Emily Alfs Mathematics and Computer Science Doane College Crete, Nebraska 68333 emily.alfs@doane.edu Abstract Frame Sudoku is very similar to traditional

### Evolutionary Search. Announcements. Announcements. Homework #1 Clarifications. Genetic Algorithms. Homework #1 Clarifications

Evolutionary Search Burr H. Settles CS-540, UW-Madison www.cs.wisc.edu/~cs540-1 Summer 2003 1 Announcements This week s mailing list topic: think of a realworld problem where we could apply an optimization

### Genetically Evolving Optimal Neural Networks

Genetically Evolving Optimal Neural Networks Chad A. Williams cwilli43@students.depaul.edu November 20th, 2005 Abstract One of the greatest challenges of neural networks is determining an efficient network

### CS 510: Lecture 8. Deep Learning, Fairness, and Bias

CS 510: Lecture 8 Deep Learning, Fairness, and Bias Next Week All Presentations, all the time Upload your presentation before class if using slides Sign up for a timeslot google doc, if you haven t already

### Explorations in Parallel Linear Genetic Programming

Explorations in Parallel Linear Genetic Programming by Carlton Downey A thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Master of Science in

### Data Warehouse. Data Mining. InterPro Database. Knowledge Discovery. Knowledge Discovery. BINF 630: Introduction to Bioinformatics.

Data Warehouse BINF 630: Introduction to Bioinformatics Operational data Iosif Vaisman Data fusion Email: ivaisman@gmu.edu Data cleansing Metadata InterPro Database Data Mining Data mining is the exploration

### Multi-objective Evolutionary Approaches for ROC Performance Maximization

Multi-objective Evolutionary Approaches for ROC Performance Maximization Ke Tang USTC-Birmingham Joint Research Institute in Intelligent Computation and Its Applications (UBRI) School of Computer Science

### Machine Learning (Decision Trees and Intro to Neural Nets) CSCI 3202, Fall 2010

Machine Learning (Decision Trees and Intro to Neural Nets) CSCI 3202, Fall 2010 Assignments To read this week: Chapter 18, sections 1-4 and 7 Problem Set 3 due next week! Learning a Decision Tree We look

Chapter- 6 : Machine Learning - Machine learning is a branch of AI that uses algorithm to allow computer to evolve behaviors based on data collected from databases or gathered through sensors. - Machine

### EE04 804(B) Soft Computing Class 3. ANN Learning Methods February 27, Dr. Sasidharan Sreedharan

EE04 804(B) Soft Computing Class 3. ANN Learning Methods February 27, 2012 Dr. Sasidharan Sreedharan www.sasidharan.webs.com 3/1/2012 1 Syllabus Artificial Intelligence Systems- Neural Networks, fuzzy

### Effect of Patten Coding on Pattern Classification Neural Networks

Effect of Patten Coding on Pattern Classification Neural Networks Tomohiro Tanno, Kazumasa Horie, Takaaki Kobayashi, and Masahiko Morita Abstract A recent practical research reported that a layered neural

### Artificial Intelligence COMP-424

Lecture notes Page 1 Artificial Intelligence COMP-424 Lecture notes by Alexandre Tomberg Prof. Joelle Pineau McGill University Winter 2009 Lecture notes Page 2 Table of Contents December-03-08 12:16 PM

### Iterative Improvement Search Methods

Iterative Improvement Search Methods Kris Beevers Intro to AI 9/18/03 Ch. 4.3 Overview Blind/heuristic search methods are designed to explore a search space systematically, and return a path to the goal

### GENETIK Genetic algorithm for the sizing cases research. Hélène Pasquier Stéphane Clouet (CNES, France)

69 Appendix E GENETIK Genetic algorithm for the sizing cases research Hélène Pasquier Stéphane Clouet (CNES, France) 70 GENETIK Genetic algorithm for the sizing cases research Abstract GENETIK is a CNES

### Exam Time Table Scheduling using Genetic Algorithm

Exam Time Table Scheduling using Genetic Algorithm Manoj Kr. Mahto 1, Mr. Lokesh Kumar 2 1 M. Tech. Student, CSE Dept., RIEM, MDU, Rohtak, Haryana 2 Asst Prof. & HOD, CSE Dept., RIEM, MDU, Rohtak, Haryana

### SUPERVISED LEARNING. We ve finished Part I: Problem Solving We ve finished Part II: Reasoning with uncertainty. Part III: (Machine) Learning

SUPERVISED LEARNING Progress Report We ve finished Part I: Problem Solving We ve finished Part II: Reasoning with uncertainty Part III: (Machine) Learning Supervised Learning Unsupervised Learning Overlaps

### K-12 Partnership Lesson Plan

K-12 Partnership Lesson Plan Overview Objectives BoxCar2D Evolving better cars: teaching evolution by natural selection through inquiry Students explore how the basic principles of evolution can be used

### Introduction to Intelligent Systems

430.457 Fall 2018 Introduction to Intelligent Systems Lecture 8 Prof. Songhwai Oh ECE, SNU Prof. Songhwai Oh Intelligent Systems Fall 2018 1 LINEAR REGRESSION Prof. Songhwai Oh Intelligent Systems Fall

### Lecture 5: 21 September 2016 Intro to machine learning and single-layer neural networks. Jim Tørresen This Lecture

This Lecture INF3490 - Biologically inspired computing Lecture 5: 21 September 2016 Intro to machine learning and single-layer neural networks Jim Tørresen 1. Introduction to learning/classification 2.

### Unsupervised Learning: Clustering

Unsupervised Learning: Clustering Vibhav Gogate The University of Texas at Dallas Slides adapted from Carlos Guestrin, Dan Klein & Luke Zettlemoyer Machine Learning Supervised Learning Unsupervised Learning

### A Study on Application of Artificial Neural Network and Genetic Algorithm in Pattern Recognition

A Study on Application of Artificial Neural Network and Genetic Algorithm in Pattern Recognition Raj Kumar Mohanta 1 Department of IT NM Institute of Engineering & Technology, Bhubaneswar, Odisha rajkumar_19it@yahoo.co.in

### Workshop GA1. Introduction to the genetic algorithm

Workshop GA1 Introduction to the genetic algorithm Functional Programming and Intelligent Algorithms Module: Genetic Algorithms Spring 2017 Department of ICT and Natural Sciences Norwegian University of

### Genetic Network Programming Based Rule Accumulation for Agent Control

Waseda University Doctoral Dissertation Genetic Network Programming Based Rule Accumulation for Agent Control Lutao WANG Graduate School of Information, Production and Systems Waseda University January

### CIS 32 Spring 2007 Jansen MIDTERM KEY

CIS 32 Spring 2007 Jansen MIDTERM Print Your Name: KEY Chipp Honor Code I have neither given nor received aid on this exam. your signature Problems Points 1 12 / 12 13 / 7 14 / 3 15 / 3 16 / 3 17 / 10

### Evolving Multimodal Robot Behavior via Many Stepping Stones with the Combinatorial Multi-Objective Evolutionary Algorithm

1 Evolving Multimodal Robot Behavior via Many Stepping Stones with the Combinatorial Multi-Objective Evolutionary Algorithm Joost Huizinga and Jeff Clune arxiv:1807.03392v1 [cs.ne] 9 Jul 2018 Abstract

### Defining Big Data. Data Mining. Knowledge Discovery. Knowledge Discovery. Knowledge Discovery. BINF 630: Bioinformatics Methods

Defining Big Data BINF 630: Bioinformatics Methods Iosif Vaisman Email: ivaisman@gmu.edu NO JUS SIZE he three Vs of Big Data: volume, variety and velocity (D.Laney, 2001) Elements of "Big Data" include:

### Sigmoid function is a) Linear B) non linear C) piecewise linear D) combination of linear & non linear

1. Neural networks are also referred to as (multiple answers) A) Neurocomputers B) connectionist networks C) parallel distributed processors D) ANNs 2. The property that permits developing nervous system

### Learning of Open-Loop Neural Networks with Improved Error Backpropagation Methods

Learning of Open-Loop Neural Networks with Improved Error Backpropagation Methods J. Pihler Abstract The paper describes learning of artificial neural networks with improved error backpropagation methods.

### Applied Machine Learning

Applied Spring 2018, CS 519 Prof. Liang Huang School of EECS Oregon State University liang.huang@oregonstate.edu is Everywhere A breakthrough in machine learning would be worth ten Microsofts (Bill Gates)

### Artificial Neural Networks written examination

1 (8) Institutionen för informationsteknologi Olle Gällmo Universitetsadjunkt Adress: Lägerhyddsvägen 2 Box 337 751 05 Uppsala Artificial Neural Networks written examination Monday, May 15, 2006 9 00-14

### Survival of the fittest

Survival of the fittest in the jungle of Open Educational Resources a Master Thesis by Sander Latour TutOER Online curriculum sequencing using genetic algorithms based on measured learning gain. A thesis

### The Development of a Self-assessment System for the Learners Answers with the Use of GPNN

The Development of a Self-assessment System for the Learners Answers with the Use of GPNN John Pavlopoulos 1, John Vrettaros 1, George Vouros 2, and Athanasios S. Drigas 1 1 NCSR DEMOKRITOS, Department

### Artificial Neural Network (ANN)

Artificial Neural Network (ANN) Smrita Singh All India Institute Of Medical Sciences ANNS Information processing paradigm that is inspired by the way biological nervous systems, such as the brain process

### Chapter 11: Artificial Intelligence

Chapter 11: Artificial Intelligence Computer Science: An Overview Eleventh Edition by J. Glenn Brookshear Chapter 11: Artificial Intelligence 11.1 Intelligence and Machines 11.2 Perception 11.3 Reasoning

### DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING S.R.M INSTITUTE OF SCIENCE AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING S.R.M INSTITUTE OF SCIENCE AND TECHNOLOGY SUBJECT : ARTIFICIAL NEURAL NETWORKS SUB.CODE : CS306 CLASS : III YEAR CSE QUESTION BANK UNIT-1 1. Define ANN and

### ARTIFICIAL neural networks (ANN s) have been used

694 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 8, NO. 3, MAY 1997 A New Evolutionary System for Evolving Artificial Neural Networks Xin Yao, Senior Member, IEEE, and Yong Liu Abstract This paper presents

### Learning from Examples

INF5390 Kunstig intelligens Learning from Examples Roar Fjellheim INF5390-12 Learning from Examples 1 Outline General model Types of learning Learning decision trees Neural networks Perceptrons Summary

### An Introduction to Deep Learning. Labeeb Khan

An Introduction to Deep Learning Labeeb Khan Special Thanks: Lukas Masuch @lukasmasuch +lukasmasuch Lead Software Engineer: Machine Intelligence, SAP The Big Players Companies The Big Players Startups

### CLASSIFICATION ON BREAST CANCER USING GENETIC ALGORITHM TRAINED NEURAL NETWORK

Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,

### Genetic Algorithms /~gibson/teaching/csc7336/lecture3-geneticalgorithms.pdf

CSC7336 : Advanced SE for Smart Devices J Paul Gibson, D311 paul.gibson@telecom-sudparis.eu http://www-public.telecom-sudparis.eu/~gibson/teaching/csc7336/ /~gibson/teaching/csc7336/lecture3-geneticalgorithms.pdf

### and Physical Sciences Building, East Lansing, MI

Darwin builds better cars: lessons evolving online vehicles Anne Royer (royerann@msu.edu) 1 Elizabeth Schultheis (schulth5@msu.edu) 1 Louise Mead (lsmead@msu.edu) 2 1Kellogg Biological Station, Michigan

### Dudon Wai Georgia Institute of Technology CS 7641: Machine Learning Atlanta, GA

Adult Income and Letter Recognition - Supervised Learning Report An objective look at classifier performance for predicting adult income and Letter Recognition Dudon Wai Georgia Institute of Technology

### Registration Hw1 is due tomorrow night Hw2 will be out tomorrow night. Please start working on it as soon as possible Come to sections with questions

Administration Registration Hw1 is due tomorrow night Hw2 will be out tomorrow night. Please start working on it as soon as possible Come to sections with questions No lectures net Week!! Please watch

### Practical Advice for Building Machine Learning Applications

Practical Advice for Building Machine Learning Applications Machine Learning Fall 2017 Based on lectures and papers by Andrew Ng, Pedro Domingos, Tom Mitchell and others 1 This lecture: ML and the world

### DIAGNOSIS ON LUNG CANCER USING ARTIFICIAL NEURAL NETWORK

Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,

### Predictive Analysis of Text: Concepts, Instances, and Classifiers. Heejun Kim

Predictive Analysis of Text: Concepts, Instances, and Classifiers Heejun Kim May 29, 2018 Predictive Analysis of Text Objective: developing computer programs that automatically predict a particular concept

### NAND Flash Reliability and Optimization

NAND Flash Reliability and Optimization Barry Fitzgerald Santa Clara, CA 1 Agenda Introduction Research group, project goals Flash reliability Endurance/retention, test system, test process Machine Learning

### Ū P O K O O T E I K A A M Ā U I U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2013 TRIMESTER ONE

T E W H A R E W Ā N A N G A O T E Student ID:........................ Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N Time Allowed: THREE HOURS EXAMINATIONS 2013

### Genetic Algorithm based Weights Optimization of Artificial Neural Network Ms.Dharmistha D.Vishwakarma

Genetic Algorithm based Weights Optimization of Artificial Neural Network Ms.Dharmistha D.Vishwakarma Research Scholar, Dept. of Electrical. Engineering, Faculty of Tech. & Engg., M.S.University of Baroda.

### Self Organizing Maps

1. Neural Networks A neural network contains a number of nodes (called units or neurons) connected by edges. Each link has a numerical weight associated with it. The weights can be compared to a long-term

### IAI : Machine Learning

IAI : Machine Learning John A. Bullinaria, 2005 1. What is Machine Learning? 2. The Need for Learning 3. Learning in Neural and Evolutionary Systems 4. Problems Facing Expert Systems 5. Learning in Rule

### 2. Search procedure that probabilistically applies. search operators to set of points in the search

Evoluationary Computation 1. Computational procedures patterned after biological evolution 2. Search procedure that probabilistically applies search operators to set of points in the search space 169 lecture

### Introduction to Neural Networks. Terrance DeVries

Introduction to Neural Networks Terrance DeVries Contents 1. Brief overview of neural networks 2. Introduction to PyTorch (Jupyter notebook) 3. Implementation of simple neural network (Jupyter notebook)

### Final Study Guide. CSE 327, Spring Final Time and Place: Monday, May 16, 12-3pm Neville 001

Final Study Guide Final Time and Place: Monday, May 16, 12-3pm Neville 001 Format: You can expect the following types of questions: true/false, short answer, and smaller versions of homework problems.

### Tuning Q-Learning Parameters with a Genetic Algorithm Ben E. Cline September 2004

Abstract Tuning Q-Learning Parameters with a Genetic Algorithm Ben E. Cline September 2004 The Pond simulator provides a means of studying agents that must learn to survive in either static or dynamic

### CSIS. Masters Thesis

CSIS Masters Thesis A Comparison of Various Genetic and Non-Genetic Algorithms for Aiding the Design of an Artificial Neural Network that Learns the Wisconsin Card Sorting Test Task Student: Melissa K.

### An Introduction of Soft Computing Approach over Hard Computing

An Introduction of Soft Computing Approach over Hard Computing Puja Gupta Department of Computer Engineering S.G.S.I.T.S. Indore, M.P, India Neha Kulkarni Department of Computer Engineering S.G.S.I.T.S.

### Under the hood of Neural Machine Translation. Vincent Vandeghinste

Under the hood of Neural Machine Translation Vincent Vandeghinste Recipe for (data-driven) machine translation Ingredients 1 (or more) Parallel corpus 1 (or more) Trainable MT engine + Decoder Statistical

### Translation invariance

CHAPTER 7 Translation invariance Introduction In this chapter you will examine the ability of the network to detect patterns which may be displaced in space. For example, you will attempt to train a network

### Classification with Deep Belief Networks. HussamHebbo Jae Won Kim

Classification with Deep Belief Networks HussamHebbo Jae Won Kim Table of Contents Introduction... 3 Neural Networks... 3 Perceptron... 3 Backpropagation... 4 Deep Belief Networks (RBM, Sigmoid Belief

### CPS331 Lecture: Genetic Algorithms last revised March 27, 2012

CPS331 Lecture: Genetic Algorithms last revised March 27, 2012 Objectives: 1. To explain the basic ideas of GA/GP: evolution of a population; fitness, crossover, mutation Materials: 1. Genetic NIM learner

### ECE521 Lecture10 Deep Learning

ECE521 Lecture10 Deep Learning Learning fully connected multi-layer neural networks For a single data point, we can write the the hidden activations of the fully connected neural network as a recursive

### EVOLVING NEURAL NETWORKS WITH HYPERNEAT AND ONLINE TRAINING. Shaun M. Lusk, B.S.

EVOLVING NEURAL NETWORKS WITH HYPERNEAT AND ONLINE TRAINING by Shaun M. Lusk, B.S. A thesis submitted to the Graduate Council of Texas State University in partial fulfillment of the requirements for the

### Behavior Clustering Inverse Reinforcement Learning and Approximate Optimal Control with Temporal Logic Tasks

Behavior Clustering Inverse Reinforcement Learning and Approximate Optimal Control with Temporal Logic Tasks By Siddharthan Rajasekaran Committee: Jie Fu (Advisor), Jane Li (Co-advisor), Carlo Pinciroli

### CO Computational Intelligence and Software Engineering. Lecture 01. Module Introduction. Leandro L. Minku

CO3091 - Computational Intelligence and Software Engineering Lecture 01 Module Introduction Leandro L. Minku CO3091 - Computational Intelligence and Software Engineering Lecture 01 Module Introduction

### Figures. Agents in the World: What are Agents and How Can They be Built? 1

Table of Figures v xv I Agents in the World: What are Agents and How Can They be Built? 1 1 Artificial Intelligence and Agents 3 1.1 What is Artificial Intelligence?... 3 1.1.1 Artificial and Natural Intelligence...

### Supervised learning in artificial neural networks

A brief introduction Supervised learning in artificial neural networks Borgersen Gustav Mälardalens Högskola Brahegatan 4 A 722 16 Västerås +4670 400 23 99 gbn05001@student.mdh.se Karlsson Linus Mälardalens

### 6.034 QUIZ 2 Fall 2001

6.034 QUIZ 2 Fall 2001 Name E-mail Problem Maximum Score Number Problem 1 24 Problem 2 26 Problem 3 24 Problem 4 26 Total 100 1 Problem 1: Decision Boundaries (24 points) In a nightmare, you find yourself

UNIVERSITY OF GHANA (All rights reserved) Faculty of Engineering Sciences Department of Computer Engineering First Semester 2011/2012 Academic Year CENG 409: Artificial Intelligence Final Exams (3 credits)

### Automated Adaptation of Input and Output Data for a Weightless Artificial Neural Network

Automated Adaptation of Input and Output Data for a Weightless Artificial Neural Network Ben McElroy, Gareth Howells School of Engineering and Digital Arts, University of Kent bm208@kent.ac.uk W.G.J.Howells@kent.ac.uk

### Evaluating the Intrinsic Similarity between Neural Networks

University of Arkansas, Fayetteville ScholarWorks@UARK Theses and Dissertations 12-2015 Evaluating the Intrinsic Similarity between Neural Networks Stephen Charles Ashmore University of Arkansas, Fayetteville

### ECS171: Machine Learning

ECS171: Machine Learning Lecture 1: Overview of class, LFD 1.1, 1.2 Cho-Jui Hsieh UC Davis Jan 8, 2018 Course Information Website: http://www.stat.ucdavis.edu/~chohsieh/teaching/ ECS171_Winter2018/main.html

### Introduction of connectionist models

Introduction of connectionist models Introduction to ANNs Markus Dambek Uni Bremen 20. Dezember 2010 Markus Dambek (Uni Bremen) Introduction of connectionist models 20. Dezember 2010 1 / 66 1 Introduction

### A Genetic Optimized Parallel MLP to Improve Classification Accuracy for Web Learning System

A Genetic Optimized Parallel MLP to Improve Classification Accuracy for Web Learning System L. Jayasimman 1, E.George Dharma Prakash Raj 2 1 Department of MCA, JJ College of Engineering and Technology,

### A Hybrid Machine Learning Classification Algorithm for Medical Science

A Hybrid Machine Learning Classification Algorithm for Medical Science Swarnendu Kundu, Deblina Banerjee P.G. Student, SCOPE, VIT UNIVERSITY, VELLORE,India P.G. Student, Department of Information Technology,GCECT,MAKAUT,KOLKATA,India

### Learning Blackjack. Anne-Marie Bausch. May 31, 2016

Learning Blackjack Anne-Marie Bausch ETH, D-MATH May 31, 2016 Table of Contents 1 2 Perceptron A perceptron is the most basic artificial neuron (developed in the 1950s and 1960s). The input X R n, w 1,...,

### Backpropagation in recurrent MLP

Backpropagation in recurrent MLP Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2006 Chapter 5.3 Training and design issues in MLP Christopher Bishop, Pattern Recognition and Machine

### Evolving Programs for Distributed Multi-Agent Configuration in Two Dimensions

Evolving Programs for Distributed Multi-Agent Configuration in Two Dimensions Rob P. DeConde Stanford Biomedical Informatics Program Stanford University 344 Olmsted Road, Apt. 431 Stanford, California