Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
2. Which of these systems for technical computations is primarily aimed for numerical
calculations in contrast to symbolical?
Mathematica
Macsyma
MATLAB
Maple
Reduce
3. Which Three Programming Languages occur today typically on the top 5 lists for Machine
Learning?
Lisp
R
Python
Java
Prolog
C
No, the answer is incorrect.
Score: 0
Accepted Answers:
R
Python
Java
IBM Watson
Jupyter Notebook
8. Which two of the following platforms are primarily NOT aimed for Cloud/Distributed
Computing
Amazon Webservices
Apple iCloud
SAP Leonardo
Microsoft Azur
Keras
Hadoop MapReduce
Apache SPARK
Partially Correct.
Score: 0.5
Accepted Answers:
SAP Leonardo
Keras
9. Which two of the following languages are NOT so called GPU languages?
CUDA
OpenCL
Haskel
Harlan
Open Programming language (OPL)
CuDNN
Accepted Answers:
Haskel
Open Programming language (OPL)
10. Which one of the following specialized processors is NOT aimed primarily for Neural
Networks?
Google Tensor Processing Unit
Intel Nervana
Samsung Exynos 9820
Texas Instruments C6000
Apple A11 Bionic SoC
Qualcomm Hexagon
12. Which two of the following are primary gateways to specific repositories for ML Data-
sets:
Imagenet
Data.Gov
Kaggle Repository
UCI ML repository
Google trends
Amazon reviews
Accepted Answers:
Kaggle Repository
UCI ML repository
Assignment 7b
Questions related to Interdisciplinary Inspiration
Bloomfield
Chomsky
Hockett
Lakoff
Accepted Answers:
Chomsky
1. Name the two classical modes of reasoning in theoretical philosophy that has inspired Inductive
Logic Programming
Deduction
Induction
Abduction
Analogy
Partially Correct.
Score: 0.5
Accepted Answers:
Deduction
Induction
2. Name the two classical modes of reasoning in theoretical philosophy that has inspired
Deduction
Induction
Abduction
Analogy
Accepted Answers:
Abduction
Analogy
3. New findings regarding how humans categorize the objects in the world give support to specific
Machine Learning methods. Choose two out of four approaches:
K-means algorithm
Conceptual clustering
ID3 algorithm
K-means algorithm
4. The Entropy measure is used to guide the optimal setup of a decision tree. The measure is inspired
by entropy in physics which measures the:
Molecular regularity
Molecular non-regularity
Molecular disorder
Molecular order
Accepted Answers:
Molecular disorder
Lenz
Hopfield
Onsager
Ising
Accepted Answers:
Ising
6. Which process of Metallurgy has strongly influenced the architecture of Boltzman Machines?
Casting
Forging
Annealing
Welding
Accepted Answers:
Annealing
Accepted Answers:
Cognitivism
Reductionism
Behaviourism
Structuralism
Functionalism
Behaviourism
9. Which is the term used in Genetic Algorithms to refer to the competitiveness of a Hypothesis or
Rule viewed as a Chromosome?
Success rate
Fitness
Competitiveness
Accepted Answers:
Fitness
10. The Mutation operation in the breeding of new generations in Genetic Algorithms contributes to a
specific algorithmic problem. Which?
Accepted Answers:
11. What is the neuro science term for the property of a system to adapt, reconfigure and consolidate
its structure and functionality based on experience?
Resilience
Locality
Plasticity
Equipotentiality
Mass action
Specificity
Holism
Accepted Answers:
Plasticity
12. The work by Donald Hebb exemplifies an integration of two of the principles below. Which two?
Resilience
Locality
Plasticity
Equipotentiality
Mass action
Specificity
Holism
Accepted Answers:
Locality
Holism
13. The work by Hubel and wiesel strengthens the belief of the importance of the combination of two
of the principles.Which two?
Resilience
Locality
Plasticity
Equipotentiality
Mass action
Specificity
Holism
Accepted Answers:
Locality
Specificity
Assignment 6 (NOT SUBMITTED)
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Assignment 5a
Explanation Based Learning
1. If a rule in a Domain theory is contradictory to a real life restriction for the same domain, how is
it referred to?
Inconsistent
Incomplete
Incorrect.
Accepted Answers:
Incorrect.
2. Inductive Logic Programming
Hypotheses: insect(X).
How does the theta subsumptions (specializations) look like after a first iteration of a topdown ILP
search for the example insect(silverfish) ?
insect(X):-hexapodinvertebrate(siverfish)
insect(X):- hexapodinvertebrate(X)
Accepted Answers:
3. Reinforcement Learning
Q-learning
Accepted Answers:
A dynamic programming approach to calculating the shortest distance from S to T gives the
result= 11. Which result would a greedy forward search give?
26
23
25
Accepted Answers:
26
5. Reinforcement Learning
In solving an undiscounted Markov Decision Process with two states A and B using a first visit Monte
Carlo Simulation algorithm, we consider two sample episodes:
E1: A+4 -> A+2 -> B – 5 -> A+3 -> B-4 -> terminate
3/2
5/2
-1
Accepted Answers:
3/2
6. Case-based Reasoning
It is not totally obvious where learning takes palce in a case-based reasoning system. Given the four
core phases ( RE*4) of case-based resoning where is it most likely that machine learning takes
place?
1. RETRIEVE
2. REUSE
3. REVISE
4. RETAIN
1,2
3,4
Accepted Answers:
3,4
Assignment 5b
Explanation Based Learning
JCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
https://www.ijcai.org/Proceedings/87-1/Papers/045.pdf
Ivan Bratko and Stephen Muggleton, 1995, Applications of Inductive Logic Programming,
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.625.5598&rep=rep1&type=pdf
Re-inforcement Learning
Abhijit Gosavi, 2009, Reinforcement Learning: A Tutorial Survey and Recent Advances,
http://web.mst.edu/~gosavia/joc.pdf
Case-based Reasoning
Douglas H. Fisher, 1987, Knowledge Acquisition Via Incremental Conceptual Clustering, Machine
Learning 2: 139-172, 1987
http://inf.ufrgs.br/~engel/data/media/file/Aprendizagem/Cobweb.pdf
In the article by Hirsch, EBL is implemented in a specific logic programming environment. Which?
Prolog
Gödel
MRS
Accepted Answers:
MRS
In the article by Bratko and Muggleton, one ILP application is a well known engineering method.
Which?
Accepted Answers:
In the article by Kolodner, she uses a different CBR model than the earlier described cycles of a CBR
system (RE*4)
Kolodner use the term ADAPTION for an important CBR phase. Which of the RE*4 phases does
adaption primarily relate to?
2,3
1,2,3,4
Accepted Answers:
2,3
In this chapter on Learning of Bayesian Network Structure, Neapolitan uses for the missing data case
one of the techniques also used in Re-inforcement learning for a similar situation. Which?
Accepted Answers:
In his COBWEB clustering system, Fisher uses domain knowledge to guide the clustering process, but
works within a certain clustering paradigm. Which?
Partitioning–based clustering
Density-based clustering
Hierarchical-based Clustering
Grid-based clustering
Accepted Answers:
Hierarchical-based Clustering
How does CBH 3 looks like after having handled thes instances through depth first search?
{ (Large ? ?) (Small ? ? ) }
Accepted Answers:
What is the entropy for a decision tree data-set with 9 positive and 5 negative examples.
0.740
0.840
0.940
Accepted Answers:
0.940
3. Instance-based Learning
For the two feature vectors (1,0,1,0,1,0,1) and (0,0,1,1,1, 1,1). What is the manhattan distance
between the two vectors?
Accepted Answers:
4. A certain kind of mathematical operation is essential for the so called Kernel Trick
Vector product
Inner product
Cartesian product
Accepted Answers:
Inner product
5. Clustering techniques
What is the proximity matrix between the two clusters AB and CD given the distance
matrix =
A B C D
A 0 1 3 2
B 1 0 2 3
C 3 2 0 1
D 2 3 1 0
AB CD
AB 0 2
CD 2 0
AB CD
AB 0 1
CD 1 0
AB CD
AB 0 3
CD 3 0
Accepted Answers:
AB CD
AB 0 2
CD 2 0
6. In k-NN algorithm, given a set of training examples and the value of k < n, where n is the size of the
training set, the algorithm predicts the class of a test example to be the
most frequent class among the classes of the k farthest training examples.
Accepted Answers:
Accepted Answers:
X = [4, 0, 0, 5, 1, 0, 0]
Y = [5, 5, 4, 0, 0, 0, 0]
0.53
0.43
0.17
0.38
Accepted Answers:
0.38
9. What is the value of information gain in the following partitioning?:
0.25
0.47
0.34
0.19
Accepted Answers:
0.34
Assignment 4b
As per our records you have not submitted this assignment.
Generalization as Search
https://aitopics.org/download/classics:275C39EF
Decision Trees Learning Algorithms
J.R. Quinlan, 1986, Induction of Decision Trees, Machine Learning 1: 81-106, 1986 © 1986
Kluwer Academic Publishers
http://hunch.net/~coms-4771/quinlan.pdf
Instance-based Learning
http://ssg.mit.edu/cal/abs/2000_spring/np_dens/classification/cover67.pdf
Cortes, Corinna, and Vladimir Vapnik, 1995, "Support-vector networks." Machine learning
20.3
https://link.springer.com/content/pdf/10.1007/BF00994018.pdf
Clustering techniques
https://pdfs.semanticscholar.org/a718/b85520bea702533ca9a5954c33576fd162b0.pdf
1. Generalization as search
What is the Storage requirement for Breadth First Search Concept Learning
p= # positive examples n= # negative examples s= # of hypotheses
O(p+n)
O(s+n)
O(s+p)
Accepted Answers:
O(s+n)
Around 20%
Around 15%
Around 10%
Accepted Answers:
Around 10%
3. Instance-based Learning
According to the seminal paper by Hart the concept of k-nearest neighbour is inspired by some
earlier approach. Which?
Proximity Analysis
Similarity Analysis
Discrimination Analysis
Accepted Answers:
Discrimination Analysis
4. In the seminal paper on SVM by Vapnik one particuar application area was chosen. Which?
Digit recognition
Image Recognition
Speech Recognition
Accepted Answers:
Digit recognition
5. Clustering techniques
The k-means clustering method is an instance of a more general class of methods. Which ?
Density Clustering
Partitioning Clustering
Hierarchical Clustering
Accepted Answers:
Partitioning Clustering
Assignment 3a
1. What is the term for a Decision Tree learning method that creates multiple trees?
Accepted Answers:
2. What is the term for the probability of a hypothesis before a new evidence E is observed in the
context of Bayesian reasoning?
A POSTERIORI
A PRIORI
UNCONDITIONAL
Accepted Answers:
A PRIORI
3. What is the name of this ANN Activation function ?
Accepted Answers:
4. What is the name of the genetic algorithm operator that exchange values of two strings upto a
certain position?
Accepted Answers:
SDD resolution
SDL resolution
SLD resolution
Accepted Answers:
SLD resolution
6. A graph is traversed as ordered by the figures in the above graph. What is the term for this kind of
traversal?
Kant path
Euler path
Hamilton path
Hamilton path
7.
Accepted Answers:
8. How are the 14 dataitems in the provided dataset distributed on the leafs of the decision tree
below?
a=2 b=3 c =4 d=2 e=3
Accepted Answers:
Has fur
Accepted Answers:
A 11101110
B 00110100
A two point crossover operation between position 2 and 7 should be performed to give two new
chromosoms. Which constellation is correct?
11101110, 00101100
11110110 , 00101100
11100110, 00110100
Accepted Answers:
11110110 , 00101100
11.
0.14
0.014
0.0014
Accepted Answers:
0.0014
12.
0.5
0.9
1.2
Accepted Answers:
0.9
Assignment 3b
1.Quinlan, J. R. , 1986, Induction of decision trees, Machine Learning. 1: 81–106,
https://link.springer.com/content/pdf/10.1007/BF00116251.pdf
2. Xin Zou and Wen Long Yue, A Bayesian Network Approach to Causation Analysis of Road
Accidents Using Netica
https://pdfs.semanticscholar.org/0a9e/a477abb8e3c286b77cef2b68da582d720e20.pdf
5. Luc De Raedt and Kristian Kersting, 2008, Probabilistic Inductive Logic Programming,
Lecture Notes in Computer Science, (LNCS, volume 4911),
https://people.csail.mit.edu/kersting/ecmlpkdd05_pilp/pilp.pdf
1. What is the general term used for refer to top down inductive analysis techniques for Decision
trees?
CART
ACLS
TDIDT
Accepted Answers:
TDIDT
2. Two kinds of learning is possible for Bayesian Networks. One kind is STRUCTURE Learning. What is
the other kind called?
Accepted Answers:
3. In his 1986 paper, Rumelhart outline a rule for providing feedback to an ANN. What is it called?
ERROR RULE
DELTA RULE
LOSS RULE
Accepted Answers:
DELTA RULE
4. What is the term for an example or data-item in the terminology of Genetic Algorithms?
Accepted Answers:
5. De Raedt describes three types of learning within Inductive Logic Programming. Which is the most
commonly used?
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
Accepted Answers:
What is the opposite of a Generalization relation in a Concept Hierarchy?
Accepted Answers:
Accepted Answers:
Predict whether the price of petrol will increase in the next month.
Accepted Answers:
Predict the height of a person.
Weight of a person
Area of a city
Income of a person
Accepted Answers:
Assignment 2b
1. Richard Bellman, 1953, The Theory of Dynamic Programming, MEMO rand Corporation
https://www.rand.org/content/dam/rand/pubs/papers/2008/P550.pdf
www.dsglynn.univ-
paris8.fr/Chpater_2_sections_1_2_Ungerer_Schmid_2006_Introduction_Cognitive_Linguistics.pdf
http://web.mit.edu/6.435/www/Valiant84.pdf
4. Nela Gurevich, Shaul Markovitch and Ehud Rivlin, 2006, Active Learning with Near
Misses.
https://medium.com/machine-learning-101/chapter-2-svm-support-vector-machine-theory-
f0812effc72
1. Which term does Richard Bellman use in his original paper on Dynamic Programming to refer to
state changes?
Actions
Transformations
Decisions
Accepted Answers:
Decisions
Canis
Dog
Poodle
Accepted Answers:
Dog
3. Valiant analyses learning for a specific kind of functions. Which kind of function?
Accepted Answers:
(Type: String) Boolean
4. The work on Near Misses in Machine Learning can be traced to a well known researcher in
Artificial Intelligence in 1983. What was his surname?
Accepted Answers:
Accepted Answers:
PANDORA
PANGEA
PANDEMONIUM
Accepted Answers:
PANDEMONIUM
2. Which researcher is known for having made the first implementation of an artificial neural
network in 1956?
JOHN HOLLAND
MARVIN MINSKY
IRWIN SHAW
Accepted Answers:
MARVIN MINSKY
3. On which lcalculus did John McCarthy base the LISP programming language?
FUNCTIONAL CALCULUS
DIFFERENTIAL CALCULUS
LAMBDA CALCULUS
Accepted Answers:
LAMBDA CALCULUS
4. Newell and Simon made two pioneer contributions to early Artificial Intelligence (1955 and 1959
respectively). Name one of the two systems that they created.
LOGIC THEORIST
LOGIC PLANNER
ARTIFICIAL THEORIST
Accepted Answers:
LOGIC THEORIST
5. What was the name of Solmonoffs first contribution in 1957 to what he later named non semantic
machine learning?
INDUCTIVE LEARNER
INDUCTIVE ENGINE
Accepted Answers:
http://www.cse.chalmers.se/~coquand/AUTOMATA/mcp.pdf
https://www.csee.umbc.edu/courses/471/papers/turing.pdf
3. John McCartey, 1955, A proposal for the Dartmouth summer Research Project on
Artificial Intelligence´.
https://web.archive.org/web/20080930164306/http://www-
formal.stanford.edu/jmc/history/dartmouth/dartmouth.html
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.368.2254&rep=rep1&type=pdf
1. In the paper by McCulloch and Pitt, the authors choose a logical calculus for their model of neuron
activity. What was the name of the Logician that had defined the specific kind of symbolic logic
choosen?
CARNAP
CANTOR
GÖDEL
Accepted Answers:
CARNAP
2. In the paper by Turing, he has a section which is of relevance for Machine Learning. How does he
name that section?
INFERENCE MACHINES
LEARNING MACHINES
LEARNING COMPUTERS
Accepted Answers:
LEARNING MACHINES
3. In the proposal for the Darthmouth Summer School, two sections were specially relevant for
Machine Learning. Name one of these sections?
NEURON NETS
NEURAL NETS
NEURAL LEARNING
Accepted Answers:
NEURON NETS
4. In the paper by Samuel, he describes two learning procedures. Name one of these procedures?
BOOTSTRAP LEARNING
THEORY LEARNING
ROTE LEARNING
Accepted Answers:
ROTE LEARNING
5. In the paper by Rosenblatt, the first instance of his percepton has a specific name based on his
chosen application area. What was the name?
PROTOPERCEPTRON
PHOTOPERCEPTRON
VOICEPERCEPTRON
Accepted Answers:
PHOTOPERCEPTRON