0 views

Uploaded by chemchemha

- Self Healing Robots
- Artificial Neural Networks
- 1 My First Perceptron With Python Eric Joel Barragan Gonzalez(Www.ebook Dl.com)
- IBM SPSS Neural Network
- Ppt on Evaluation of Liquefaction Potential in Modern Methodology
- Fall 2016 Chapter 1 Lecture 3
- ThomasHosslerResume.pdf
- Textbooks Gate
- Matlab
- Cortical Artificial Neural Networks and their Evolution - Consciousness-inspired Data Mining
- Still Not Systematic After All These Years- on the Compositional Skills of Sequence-Tosequence Recurrent Networks
- Natural-language-processing-(almost)-from-scatch.pdf
- report AI
- Classification of Lung Diseases Using Optimization Techniques
- AS.LECTURE8.NN1
- Modeling Cogeneration Power Plants Using Neural Networks
- CRR-paper_214
- FR
- Optimization of Citric Acid Production Using Ann
- 08rr410405 Artificial Neural Networks

You are on page 1of 10

Final Exam

2:45-4:45pm, December 20, 1995

Room 3425 Sterling Hall

CLOSED BOOK

(one page of notes allowed)

Write your answers on these pages and show your work. If you feel that a question is not fully

specified, state any assumptions that you need to make in order to solve the problem. You may

use the backs of these sheets for scratch work.

Write your name on this and all other pages of this exam. Make sure your exam contains eight

problems on ten pages.

Name ________________________________________________

Student ID ________________________________________________

1 _____ 20

2 _____ 25

3 _____ 20

4 _____ 20

5 _____ 20

6 _____ 10

7 _____ 20

8 _____ 15

(over)

CS 540-1 2 Name ____________________

(a) Assume you are given the following three features of TV shows, with the possible values

shown, and wish to learn how to predict future top-10 shows.

Type ∈ {Comedy, Drama, News, Sports}

Location ∈ {LA, NYC, Various}

Duration ∈ {30min, 60min}

Assume that the ID3 algorithm is given the following set of categorized examples from

previous television seasons. Calculate the decision tree that ID3 would produce. Show all

your work. (You may use the abbreviations that are used to describe the examples.) Break

ties by preferring the feature with the least number of possible values.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

T = C L = NYC D = 30 +

T = C L = LA D = 60 -

T = N L = Var D = 60 +

T = N L = LA D = 30 +

T = S L = Var D = 60 -

T = D L = LA D = 60 -

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

lg(a/b) = lg(a) - lg(b)

lg(1) =0

lg(2) =1

lg(3) = 1.58

lg(4) =2

lg(5) = 2.32

lg(6) = 2.58

(over)

CS 540-1 3 Name ____________________

(b) Briefly explain the space ID3 searches and the search strategy it uses.

(a) Hand ‘‘wire’’ (i.e., manually configure) a perceptron so that it computes the Boolean AND of

its two inputs.

(b) Now consider using the delta rule to train a perceptron to learn the AND function. Assume

the initial weights and threshold of your perceptron are all −0.1 and that the learning rate

(i.e., α or η) is 0.2. Be sure to train the threshold.

Draw the initial state of this perceptron.

Draw the state of the perceptron after training it on the input In1=1 & In2=1.

(over)

CS 540-1 4 Name ____________________

(c) Assuming you trained it on all possible inputs enough times, could the delta rule learn the

AND function? Explain your answer using feature space.

(d) Assuming In2 = 0 and the threshold = −0.1, draw the weight space (and associated error

surface) for the AND function (by using specific values for In2 and the threshold, you do not

have to draw these two dimensions, since they are constant).

(e) Discuss the claim that the backpropagation algorithm uses a ‘‘hill climbing’’ search strategy.

(f) Dr. I. M. Wright is given 10,000 hospital records describing the initial symptoms of patients

who, after weeks of treatment with a new drug, were or were not cured. Due to the

availability of alternate treatments, it would be useful to be able to accurately predict, based

on the initial symptoms of an incoming patient, whether or not they should receive the new

drug. Dr. Wright decides to use a neural network to learn this function.

Dr. Wright uses the following methodology. First, he randomly chooses 1000 patient

records and marks them as ‘‘testset’’ cases. Next, he uses the remaining 9000 examples to

train five different neural networks; these networks have 0, 5, 10, 15, 20 hidden units,

respectively. Once training completes, he tests the five networks on the held-aside testset

and finds that the one with 15 hidden units has the best error rate (it’s 97.2% accurate).

Based on these results, Dr. Wright sends to the hospital the network with 15 hidden units and

tells the doctors there that if they use this neural network they can expect an diagnosis error

rate of 2.8%.

Explain the major methodological flaw that Dr. Wright made.

(over)

CS 540-1 5 Name ____________________

(a) Consider the Prolog program below.

c(1,4).

c(2,1).

c(2,3).

c(2,6).

c(3,5).

c(5,4).

r(X,X).

r(X,Y) :- c(Z,Y), r(X,Z).

What would Prolog return if given the following queries? (Report all the answers returned, in

the order Prolog would return them.)

h hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

?- r(2,4).

h hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

?- r(W,4).

(b) Write a Prolog program for sick(Person,Year) that captures the following world knowledge:

John and Mary get sick every year.

Pebbles, the child of Fred and Wilma, will get sick in 1996.

Every year Maggie sits next to Pebbles on the school bus.

People who sit next to sick people will get sick [that same year].

Parents catch [that same year] every cold their children get.

Having a cold is one way of getting sick.

The predicate sick(Person,Year) means that Person will be (was) sick during Year. You may

use, without needing to further define them, the predicates: human(Person),

parentOf(Parent,Child), hadFluShot(Person,Year), hasCold(Person,Year), hasFlu(Person,Year),

sitsNextTo(PersonA,PersonB,Year).

(over)

CS 540-1 6 Name ____________________

For each of the following assertions, draw a specific search graph that supports it. (If you wish

to use an infinite search graph, it is fine to use ‘‘ . . . ’’ to indicate the remainder of an infinite

subgraph.) Explain your answers. Note: assume that best-first search solely uses f=h as its

scoring function.

(a) Best-first search can explore more nodes than breadth-first search.

(b) Hill climbing can produce a solution when depth-first search does not.

(c) A* can produce a lower-cost solution path than does best-first search when both algorithms

use the same admissible h function.

(over)

CS 540-1 7 Name ____________________

Represent the following English sentences using predicate calculus. In the first two sentences,

be sure to represent move and cook as situation-calculus operators. If you feel a sentence is

ambiguous, you need only give one FOPC representation, but also provide an unambiguous

paraphrase. Be sure to choose reasonable constants, predicates, and functions.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

Robbie the robot will move it from the warehouse to the shipping dock.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

To be a respected butterfly collector, one must possess two distinct and rare butterflies.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

(over)

CS 540-1 8 Name ____________________

Create a simple formal interpretation that shows the following wff is not valid.

Explain your solution.

{∀ x [P(x) ⇒ Q(x)] } ⇒ {∀ y [P(y) ∧ Q(y)] }

Answer the following true (T) or false (F). Provide brief justifications of your answers.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

(over)

CS 540-1 9 Name ____________________

Every wff that can be derived via a ‘‘natural deduction’’ proof can also be

proved using resolution.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

Resolution theorem proving will not terminate if the theorem one is trying to prove is false.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

Fuzzy logic reduces to standard logic in the case where all propositions are either

completely true (ie, have value 1) or completely false (have value 0).

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

(over)

CS 540-1 10 Name ____________________

Assume you have started a ‘‘fresh’’ Lisp. What would the following s-expressions return?

Write ‘‘error’’ if Lisp would complain when evaluating an s-expr. In cases where multiple s-

expressions are in a group, you need only report the returned value of the last s-expr.

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

(append (1 2 3) (4 5 6))

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

(assoc 1 ’( (1 2) (1 1) (2 1) ))

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

(setf x nil)

(dolist (y ’(1 2 3)) (setf x (cons y x)))

x

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

(defun f(x y)

"a mystery function"

(if (< x 1)

(+ 1 (f (- x 1) y))

y))

(f 5 1)

- Self Healing RobotsUploaded by1da09ec064
- Artificial Neural NetworksUploaded byP K Singh
- 1 My First Perceptron With Python Eric Joel Barragan Gonzalez(Www.ebook Dl.com)Uploaded bySahib Qafarsoy
- IBM SPSS Neural NetworkUploaded byEdmundo Caetano
- Ppt on Evaluation of Liquefaction Potential in Modern MethodologyUploaded bySuvadeep Dalal
- Fall 2016 Chapter 1 Lecture 3Uploaded byTan Quoc Huynh
- ThomasHosslerResume.pdfUploaded byThomas Hlr
- Textbooks GateUploaded bysaitej
- MatlabUploaded byshylaja_p
- Cortical Artificial Neural Networks and their Evolution - Consciousness-inspired Data MiningUploaded byDr. Florian Neukart
- Still Not Systematic After All These Years- on the Compositional Skills of Sequence-Tosequence Recurrent NetworksUploaded byJan Hula
- Natural-language-processing-(almost)-from-scatch.pdfUploaded bywangxy802
- report AIUploaded byAhli Sihir
- Classification of Lung Diseases Using Optimization TechniquesUploaded byInternational Journal for Scientific Research and Development - IJSRD
- AS.LECTURE8.NN1Uploaded bymrtfkhang
- Modeling Cogeneration Power Plants Using Neural NetworksUploaded byInternational Journal of Research in Engineering and Technology
- CRR-paper_214Uploaded byUbiquitous Computing and Communication Journal
- FRUploaded bymayank036
- Optimization of Citric Acid Production Using AnnUploaded byHana Hamid
- 08rr410405 Artificial Neural NetworksUploaded byandhracolleges
- 06 BSP GradualUploaded byiky77
- Linear RegressionUploaded byZheng Ronnie Li
- Exam 2001Uploaded bykib6707
- articolUploaded byPodeanu Cristina
- A Study of Neural Networks With RicketyHyp - Eduardo Paradinas Glez. de VegaUploaded byEstudio de Arquitectura Eduardo Paradinas
- Sadhana Volume 32 issue 5 2007 [doi 10.1007%2Fs12046-007-0043-5] H. Sudarsana Rao; B. Ramesh Babu -- Hybrid neural network model for the design of beam subjected to bending and shear.pdfUploaded byGuillermo Ramirez
- 91319c0322fe806c99d6f57173a6e08b6c6bUploaded byHasn FX
- 10.1.1.19.9955Uploaded bySmiley Jay
- plan-ga-nn.pdfUploaded byAnshul
- Oral HardUploaded byVinu Vin

- midterm-fall16.pdfUploaded bychemchemha
- exam2-fall95Uploaded bychemchemha
- exam1-fall95.pdfUploaded bychemchemha
- final-spring98.pdfUploaded bychemchemha
- Midterm Fall02Uploaded bychemchemha
- Final Fall00Uploaded bychemchemha
- exam2-spring98Uploaded bychemchemha
- exam1-spring98.pdfUploaded bychemchemha
- Final Fall11Uploaded bychemchemha
- Final Spring99Uploaded bychemchemha
- Midterm Spring99Uploaded bychemchemha
- Midterm Fall00Uploaded bychemchemha
- Final Fall02Uploaded bychemchemha
- Midterm Spring08Uploaded bychemchemha
- Final Spring08Uploaded bychemchemha
- Midterm Fall11Uploaded bychemchemha
- Final Spring13Uploaded bychemchemha
- Midterm Spring13Uploaded bychemchemha
- Final Fall14Uploaded bychemchemha
- Midterm Fall14Uploaded bychemchemha
- Midterm Fall15Uploaded bychemchemha
- Final Fall15Uploaded bychemchemha
- algorithms list in AIUploaded bykucingmucing
- Final Fall16Uploaded bychemchemha
- Silverberg MPINE PPTUploaded bychemchemha
- Food-and-Wine-Pairing.pptUploaded bychemchemha

- Expansion form and the Continuum HypothesisUploaded byPhilip White
- Key Terms in LogicUploaded byAnonymous mNlqilGb
- LogicomixUploaded byMariana Nunes
- Chapter 05 Finite AutamataUploaded byMuhammad Waqas
- Discrete Maths QBUploaded byJyotsna Suraydevara
- Crp Roster Points-kadapa districtUploaded byNarasimha Sastry
- FoodUploaded byangel_shikhu13
- Data Types Operators and VariablesUploaded bynjk19
- Adams, HesteAdams, Hester, Bradley, Meyers & Keating (2014)r, Bradley, Meyers & Keating (2014)Uploaded byYetifshum
- C++ Pointers and ReferencesUploaded byvikkikokki
- 14 ArraysUploaded byhusnusaner
- L9_KR_p1Uploaded byBomezzZ Enterprises
- Otter 33Uploaded bysidathd
- Dynamic LogicUploaded byTaqi Shah
- Automata Solved MCQUploaded byDeepak Bagga
- Types of SetsUploaded byJerel Calanao
- Peter Smith - Intro to Formal LogicUploaded byShane Veidt
- SOFTWARE TOOL FOR TRANSLATING PSEUDOCODE TO A PROGRAMMING LANGUAGEUploaded byJames Moreno
- Formal Languages and Automata TheoryUploaded byVenugopal Reddy
- interpretersUploaded bylahsivlahsiv
- Lecture9_DecidabilityUploaded byvignesvaran
- Ex Contradictione Non Sequitur Quodlibet (the Principle of Explosion)Uploaded byDimitris Kapa
- 0198537816.pdfUploaded byYan Mikhlin
- Recursive FunctionsUploaded byGledsonLeal
- The Curse of Compiler ConstructionUploaded byi1958239
- Automata midsem paper 2010Uploaded bysiddhartha_puligilla
- Mile TiUploaded byEpic Win
- Interpretación de Gödel de la lógica intuicionistaUploaded byelias
- Axiomatic Systems.pdfUploaded bydont change pass
- ocaml-4.01-refmanUploaded byRobert Komartin