Match the following : Codes :List - I List - II a. Classification i. Principal component analysis b. Clustering ii. Branch and Bound c. Feature Extraction iii. K-nearest neighbour d. Feature Selection iv. K-means
| a | b | c | d |
| iii | iv | i | ii |
K-nearest neighbour assigns a label using known neighbours, so it is a classification method (a-iii), while K-means groups unlabelled data into clusters (b-iv).
Principal component analysis builds new features as combinations of old ones, which is feature extraction (c-i).
Branch and bound searches subsets of existing features optimally, which is feature selection (d-ii).
Hence, a-iii, b-iv, c-i, d-ii.
Fact-less fact table in a data warehouse contains
__________ allows selection of the relevant information necessary for the data warehouse.
__________ system is market oriented and is used for data analysis by knowledge workers including Managers, Executives and Analysts.
A data cube C, has n dimensions, and each dimension has exactly p distinct values in the base cuboid. Assume that there are no concept hierarchies associated with the dimensions. What is the maximum number of cells possible in the data cube, C ?
Which of the following table contains the primary information in the data warehouse?
Which of the following is characteristic of an MIS ?
An enormous collection of data on various topics from a variety of internal and external sources, compiled by a firm for its own use or for use by its clients, is called :
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R
Assertion A: OLAP systems are optimized for complex queries and analysis.
Reason R: OLTP systems are designed for transactions processing with large read-only queries.
In the light of the above statements, choose the most appropriate answer from the options given below