.
Decision Tree
Graph
Neural Network
Tree
Lowest value of Information Gain
Highest value of Information Gain
Gini Index
Entropy
ID3
SVM
ANN
K-NN
ID3
SVM
ANN
K-NN
1/||w||
2w
2/||w||
1/||2w||
A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
Any mechanism employed by a learning system to constrain the search space of a hypothesis
An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
None of these
It is a form of automatic learning.
A neural network that makes use of a hidden layer
Additional acquaintance used by a learning algorithm to facilitate the learning process
None of these
A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory
Any mechanism employed by a learning system to constrain the search space of a hypothesis
An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
Pre data Analysis Approach
A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
Any mechanism employed by a learning system to constrain the search space of a hypothesis
An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
It is a form of automatic learning.
A subdivision of a set of examples into a number of classes
The task of assigning a classification to a set of examples
A measure of the accuracy, of the classification of a concept that is given by a certain theor
An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation.
Systems that can be used without knowledge of internal operations
The natural environment of a certain species
In general, these values will be 0 and 1 and .they can be coded as one bit
Mutual exclusion classifier
A stage of the KDD process in which new data is added to the existing selection.
The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
The distance between two points as calculated using the Pythagoras theorem
None of these
A set of databases from different vendors, possibly using different database paradigms
An approach to a problem that is not guaranteed to work but performs well in most cases
Information that is hidden in a database and that cannot be recovered by a simple SQL query
None of these
A stage of the KDD process in which new data is added to the existing selection.
The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them
The distance between two points as calculated using the Pythagoras theorem.
None of these
Machine-learning involving different techniques
The learning algorithmic analyzes the examples on a systematic basis and makes incremental adjustments to the theory that is learned
Learning by generalizing from examples
The process of finding the right formal representation of a certain body of knowledge in order to represent it in a knowledge-based system
Quiz Review Timeline +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
Wait!
Here's an interesting quiz for you.