data mining & data ware house set 2 Detailed Explanation And More Example

Question : 1

Kohonen self-organizing map referred to

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

b) It automatically maps an external signal space into a system’s internal representational space. They are useful in the performance of classification tasks

c) A process where an individual learns how to carry out a certain task when making a transition from a situation in which the task cannot be carried out to a situation in which the same task under the same circumstances can be carried out.

d) None of these

Question : 2

Integrated is

a) The amount of information with in data as opposed to the amount of redundancy or noise

b) One of the defining aspects of a data warehouse

c) Restriction that requires data in one column of a database table to the a subset of another-column.

d) None of these

Question : 3

Data cleaning is

a) Large collection of data mostly stored in a computer system

b) The removal of noise errors and incorrect input from a database

c) The systematic description of the syntactic structure of a specific database. It describes the structure of the attributes the tables and foreign key relationships.

d) None of these

Question : 4

Multi-dimensional knowledge is

a) A class of learning algorithms that try to derive a Prolog program from examples

b) A table with n independent attributes can be seen as an n- dimensional space

c) A prediction made using an extremely simple method, such as always predicting the same output.

d) None of these

Question : 5

Operational database is

a) A measure of the desired maximal complexity of data mining algorithms

b) A database containing volatile data used for the daily operation of an organization

c) Relational database management system

d) None of these

Question : 6

Perceptron is

a) General class of approaches to a problem.

b) Performing several computations simultaneously.

c) Structures in a database those are statistically relevant.

d) Simple forerunner of modern neural networks, without hidden layers.