Dmw Quiz-c1

15 Questions | Attempts: 229
Share

SettingsSettingsSettings
Dmw Quiz-c1 - Quiz

.


Questions and Answers
  • 1. 

    A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.

    • A.

      Decision Tree

    • B.

      Graph

    • C.

      Neural Network

    • D.

      Tree

    Correct Answer
    A. Decision Tree
  • 2. 

    Root node depends upon

    • A.

      Lowest value of Information Gain

    • B.

      Highest value of Information Gain

    • C.

      Gini Index

    • D.

      Entropy

    Correct Answer
    B. Highest value of Information Gain
  • 3. 

    Example of Lazy Learner

    • A.

      ID3

    • B.

      SVM

    • C.

      ANN

    • D.

      K-NN

    Correct Answer
    D. K-NN
  • 4. 

    Kernel Trick is a concept of

    • A.

      ID3

    • B.

      SVM

    • C.

      ANN

    • D.

      K-NN

    Correct Answer
    B. SVM
  • 5. 

    Maximum margin is represented by

    • A.

      1/||w||

    • B.

      2w

    • C.

      2/||w||

    • D.

      1/||2w||

    Correct Answer
    C. 2/||w||
  • 6. 

    Bayesian classifiers is

    • A.

      A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.

    • B.

      Any mechanism employed by a learning system to constrain the search space of a hypothesis

    • C.

      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.

    • D.

      None of these

    Correct Answer
    A. A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.
  • 7. 

    Background knowledge referred to

    • A.

      It is a form of automatic learning.

    • B.

      A neural network that makes use of a hidden layer

    • C.

      Additional acquaintance used by a learning algorithm to facilitate the learning process

    • D.

      None of these

    Correct Answer
    C. Additional acquaintance used by a learning algorithm to facilitate the learning process
  • 8. 

    Bias is

    • A.

      A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory

    • B.

      Any mechanism employed by a learning system to constrain the search space of a hypothesis

    • C.

      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.

    • D.

      Pre data Analysis Approach

    Correct Answer
    B. Any mechanism employed by a learning system to constrain the search space of a hypothesis
  • 9. 

    Case-based learning is

    • A.

      A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory.

    • B.

      Any mechanism employed by a learning system to constrain the search space of a hypothesis

    • C.

      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.

    • D.

      It is a form of automatic learning.

    Correct Answer
    C. 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.
  • 10. 

    Classification is

    • A.

      A subdivision of a set of examples into a number of classes

    • B.

      The task of assigning a classification to a set of examples

    • C.

      A measure of the accuracy, of the classification of a concept that is given by a certain theor

    • D.

      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.

    Correct Answer
    A. A subdivision of a set of examples into a number of classes
  • 11. 

    Binary attribute are

    • A.

      Systems that can be used without knowledge of internal operations

    • B.

      The natural environment of a certain species

    • C.

      In general, these values will be 0 and 1 and .they can be coded as one bit

    • D.

      Mutual exclusion classifier

    Correct Answer
    C. In general, these values will be 0 and 1 and .they can be coded as one bit
  • 12. 

    Euclidean distance measure is

    • A.

      A stage of the KDD process in which new data is added to the existing selection.

    • B.

      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

    • C.

      The distance between two points as calculated using the Pythagoras theorem

    • D.

      None of these

    Correct Answer
    C. The distance between two points as calculated using the Pythagoras theorem
  • 13. 

    Hidden knowledge referred to

    • A.

      A set of databases from different vendors, possibly using different database paradigms

    • B.

      An approach to a problem that is not guaranteed to work but performs well in most cases

    • C.

      Information that is hidden in a database and that cannot be recovered by a simple SQL query

    • D.

      None of these

    Correct Answer
    C. Information that is hidden in a database and that cannot be recovered by a simple SQL query
  • 14. 

    Enumeration is referred to

    • A.

      A  stage of the KDD process in which new data is added to the existing selection.

    • B.

      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

    • C.

      The distance between two points as calculated using the Pythagoras theorem.

    • D.

      None of these

    Correct Answer
    B. 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
  • 15. 

    Incremental learning referred to

    • A.

      Machine-learning involving different techniques

    • B.

      The learning algorithmic analyzes the examples on a systematic basis and makes incremental adjustments to the theory that is learned

    • C.

      Learning by generalizing from examples

    • D.

      The process of finding the right formal representation of a certain body of knowledge in order to represent it in a knowledge-based system

    Correct Answer
    B. The learning algorithmic analyzes the examples on a systematic basis and makes incremental adjustments to the theory that is learned

Quiz Review Timeline +

Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.

  • Current Version
  • Feb 27, 2019
    Quiz Edited by
    ProProfs Editorial Team
  • Mar 29, 2018
    Quiz Created by
    Shreya
Back to Top Back to top
Advertisement
×

Wait!
Here's an interesting quiz for you.

We have other quizzes matching your interest.