0% found this document useful (0 votes)
16 views

DMDW Ques

Dataware house and data mining

Uploaded by

nagalakr1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views

DMDW Ques

Dataware house and data mining

Uploaded by

nagalakr1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Subject Name: Datawarehousing and Mining

UNIT-I

1. Explain data mining as a step in the process of knowledge discovery.


2. Draw and explain the architecture of typical data mining system.
3. a) Briefly discuss about data integration.
b) Briefly discuss the data smoothing techniques.
4. a) Briefly discuss about data transformation.
b) Briefly discuss about data reduction technique.
5. Explain about concept hierarchy generation for categorical data.

UNIT-II

1. Differentiate OLTP and OLAP


2. Briefly discuss about data warehouse architecture. (OR)
Explain the three-tier data warehousing architecture.
3. What are the differences between fact and dimension table?
4. Explain with example the different schemas for multidimensional databases.
(Star Schema, Snow Flake Schema (SFS), Fact Constellation Schema)
5. What is data mining? Give its applications?
6. What is data ware housing? Give its applications?
7. Briefly compare the discovery-driven cube, multi-feature and virtual warehouse. Use an
example to explain your point.

UNIT-III

1. List and describe any four primitives for specifying a data mining task.
2. Explain the syntax for task-relevant data specification.
3. Write the syntax for the following data mining primitives,
a) The kind of knowledge to be mined
b) Measures of pattern interestingness.
4. Describe why concept hierarchies are useful in data mining?
5. Discuss briefly about data mining query languages.
6. Discuss the process of designing graphical user interface based on a data mining query
language.
UNIT-IV

1. What is concept description? Explain.


2. What are the differences between concept description in large data bases and OLAP?
3. State and explain algorithm for attribute-oriented induction.
4. Explain about the graph displays of basic statistical class description.
5. Write short notes for the following in detail,
a) Measuring the central tendency
b) Measuring the dispersion of data.
6. Explain the various ways to measure the dispersion of data.

UNIT-V

1. Discuss about mining frequent item sets without candidate generation.


2. Explain the apriori algorithm with example.
3. Discuss about mining multilevel association rules from transcation databases in detail.
4. Discuss about constraint-based association mining.
5. What are rule-constraints? How are they classified?

UNIT-VI

1. How does tree pruning work? What are some enhancements to basic decision tree
induction?
2. Describe the working procedures of simple Bayesian classifier.
3. Explain training Bayesian belief networks.
4. Write the back propagation algorithm and explain.
5. Explain the process of measuring the accuracy of a classifier.
UNIT-VII

1. Give two objects represented by the tuples(22,1,42,10) and (20,0,36,8),


a) Compute the Euclidean distance between the two objects
b) Compute the Manhattan distance between the two objects
c) Compute the Minkowski distance between the two objects, using q=3.
2. Explain DBSCAN algorithm with suitable example.
3. Explain about outlier analysis.
4. How does CLIQUE work?
5. Explain about statistical-based outlier detection and deviation –based outlier detection.
6. Suppose that the data mining task is to cluster the following eight points (with (x,y)
representing location) into three clusters.
A1(2,10),A2(2,5),A3(8,4),B1(5,8),B2(7,5),B3(6,4),C1(1,2),C2(4,9).
The distance function is Euclidean distance. Suppose initially we assign A1,B1, and C1 as
the center of each cluster, respectively. Use the k-mean algorithm to show only
a) The three cluster centers after the first round execution and
b) The final three clusters.

UNIT-VIII

1. Explain spatial data cube construction and spatial OLAP.


2. Give an account on spatial data mining.
3. Explain mining spatial association rules and co-location patterns.
4. What is multimedia database? Explain mining multimedia databases.
5. Explain the four major components of trend analysis for characterizing time series data.

You might also like