Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

Similar documents
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

A Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 10.

Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

A Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 10.

Table Of Contents: xix Foreword to Second Edition

Contents. Foreword to Second Edition. Acknowledgments About the Authors

Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

2. (a) Briefly discuss the forms of Data preprocessing with neat diagram. (b) Explain about concept hierarchy generation for categorical data.

SCHEME OF COURSE WORK. Data Warehousing and Data mining

DATA WAREHOUING UNIT I

Contents. Preface to the Second Edition

Lectures for the course: Data Warehousing and Data Mining (IT 60107)

A Review on Cluster Based Approach in Data Mining

3. Which of the following is volatile? [ ] A) Bubble memory B) RAM C) ROM D) Magneticdisk

Chapter 6: Basic Concepts: Association Rules. Basic Concepts: Frequent Patterns. (absolute) support, or, support. (relative) support, s, is the

Introduction to Data Mining

R07. FirstRanker. 7. a) What is text mining? Describe about basic measures for text retrieval. b) Briefly describe document cluster analysis.

Data mining fundamentals

DATA MINING LECTURE 7. Hierarchical Clustering, DBSCAN The EM Algorithm

Clustering in Ratemaking: Applications in Territories Clustering

Intro to Artificial Intelligence


D B M G Data Base and Data Mining Group of Politecnico di Torino

DATA MINING AND WAREHOUSING

Association Pattern Mining. Lijun Zhang

Data Mining: An experimental approach with WEKA on UCI Dataset

Data mining: concepts and algorithms

Code No: R Set No. 1

Time: 3 hours. Full Marks: 70. The figures in the margin indicate full marks. Answers from all the Groups as directed. Group A.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

9. Conclusions. 9.1 Definition KDD

PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore

A Review: Techniques for Clustering of Web Usage Mining

AUTONOMOUS. Department of Computer Science and Engineering

Efficient and Effective Clustering Methods for Spatial Data Mining. Raymond T. Ng, Jiawei Han

Chapter 1, Introduction

2. Department of Electronic Engineering and Computer Science, Case Western Reserve University

Data Mining Concepts

COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK

Domestic electricity consumption analysis using data mining techniques

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Clustering Part 4 DBSCAN

DBSCAN. Presented by: Garrett Poppe

A STUDY OF SOME DATA MINING CLASSIFICATION TECHNIQUES

This tutorial has been prepared for computer science graduates to help them understand the basic-to-advanced concepts related to data mining.

Clustering Techniques

Supervised vs unsupervised clustering

Data Mining. Introduction. Hamid Beigy. Sharif University of Technology. Fall 1395

Data Mining: Concepts and Techniques. Chapter March 8, 2007 Data Mining: Concepts and Techniques 1

Data Mining and Knowledge Discovery Practice notes Numeric prediction and descriptive DM

Data Mining. Introduction. Hamid Beigy. Sharif University of Technology. Fall 1394

6. Learning Partitions of a Set

CT75 DATA WAREHOUSING AND DATA MINING DEC 2015

Discovery of Agricultural Patterns Using Parallel Hybrid Clustering Paradigm

A k-means Clustering Algorithm on Numeric Data

Tribhuvan University Institute of Science and Technology MODEL QUESTION

Data Mining and Knowledge Discovery: Practice Notes

Introduction to Web Clustering

SVM: Multiclass and Structured Prediction. Bin Zhao

Lecture Topic Projects 1 Intro, schedule, and logistics 2 Data Science components and tasks 3 Data types Project #1 out 4 Introduction to R,

Chapter 4: Mining Frequent Patterns, Associations and Correlations

Chapter 28. Outline. Definitions of Data Mining. Data Mining Concepts

CS570: Introduction to Data Mining

Lecture 11: Classification

Knowledge Discovery in Databases

What to come. There will be a few more topics we will cover on supervised learning

Cse634 DATA MINING TEST REVIEW. Professor Anita Wasilewska Computer Science Department Stony Brook University

CS377: Database Systems Data Warehouse and Data Mining. Li Xiong Department of Mathematics and Computer Science Emory University

INF4820. Clustering. Erik Velldal. Nov. 17, University of Oslo. Erik Velldal INF / 22

Data Mining and Knowledge Discovery: Practice Notes

Data Mining and Knowledge Discovery Practice notes: Numeric Prediction, Association Rules

GUJARAT TECHNOLOGICAL UNIVERSITY MASTER OF COMPUTER APPLICATIONS (MCA) Semester: IV

Naïve Bayes for text classification

University of Florida CISE department Gator Engineering. Clustering Part 4

UNIT V CLUSTERING, APPLICATIONS AND TRENDS IN DATA MINING. Clustering is unsupervised classification: no predefined classes

Kapitel 4: Clustering

Characterizing Data Mining Algorithms and Applications: Do they impact processor and system design?

Clustering in Data Mining

Data warehousing and Phases used in Internet Mining Jitender Ahlawat 1, Joni Birla 2, Mohit Yadav 3

Notes. Reminder: HW2 Due Today by 11:59PM. Review session on Thursday. Midterm next Tuesday (10/10/2017)

Unsupervised Learning

Data Clustering With Leaders and Subleaders Algorithm

Visualization and text mining of patent and non-patent data

Analyzing Outlier Detection Techniques with Hybrid Method

A Roadmap to an Enhanced Graph Based Data mining Approach for Multi-Relational Data mining

Supervised and Unsupervised Learning (II)

CS145: INTRODUCTION TO DATA MINING

ECG782: Multidimensional Digital Signal Processing

Correlative Analytic Methods in Large Scale Network Infrastructure Hariharan Krishnaswamy Senior Principal Engineer Dell EMC

St.MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad

University of Florida CISE department Gator Engineering. Clustering Part 5

CSE 5243 INTRO. TO DATA MINING

COMP 465: Data Mining Still More on Clustering

Effectiveness of Freq Pat Mining

CS145: INTRODUCTION TO DATA MINING

Heuristic subset clustering for consideration set analysis

Multi-label classification using rule-based classifier systems

Midterm Examination CS540-2: Introduction to Artificial Intelligence

Transcription:

Code No: 126VW Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 DATA WAREHOUSING AND DATA MINING Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. The a priori frequent itemset discovery algorithm moves in the lattice. A) Upward. B) Downward. C) Breadth wise. D)both upward and downward. 2. If a set is a frequent set and no superset of this set is a frequent set, then it is called. A) Maximal frequent set. B) Border set. C) Lattice. D) Infrequent sets. 3. is an example for case based-learning. A) Decision trees. B) Neural networks. C) Genetic algorithm. D) K-nearest neighbor. 4. is an essential process where intelligent methods are applied to extract data patterns. A) Data warehousing B) Data mining C) Text mining D) Data selection 5. is the process of finding a model that describes and distinguishes data classes or concepts. A) Data Characterization B) Data Classification C) Data discrimination D) Data selection 6. Data mining can also applied to other forms such as A) Data streams B) Sequence data C) Text data D)All of the Mentioned 7. The algorithm can be applied in cleaning data. A) Search. B) Pattern recognition. C) Learning. D) Clustering. 8. Which of the following clustering analysis method uses multi resolution approach A) STUNT. B) OPTICS. C) CLIQUE. D) Wave Cluster. 9. Which type of following clustering computes augmented cluster ordering A) OPTICS. B) CLIQUE. C) STING. D) CLUSTER. 10. Pick out a k-medoid algorithm. A) DBSCAN. B) BIRCH. C) PAM. D) CURE. Cont 2

Code No: 126VW :2: Set No. 1 II Fill in the Blanks 11. A priori algorithm is otherwise called as 12. The first phase of A Priori algorithm is. 13. Bayesian Belief Networks specify 14. Naive Bayes classifiers are 15. Are the components that define a Bayesian Belief Network 16. Bayesian Belief Networks also known as 17. k-nearest neighbor is same as 18. The partition algorithm uses 19. DBSCAN stands for 20. The Hierarchical Clustering algorithm finally produced by -ooo-

Code No: 126VW Set No. 2 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 DATA WAREHOUSING AND DATA MINING Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. is an essential process where intelligent methods are applied to extract data patterns. A) Data warehousing B) Data mining C) Text mining D) Data selection 2. is the process of finding a model that describes and distinguishes data classes or concepts. A) Data Characterization B) Data Classification C) Data discrimination D) Data selection 3. Data mining can also applied to other forms such as A) Data streams B) Sequence data C) Text data D)All of the Mentioned 4. The algorithm can be applied in cleaning data. A) Search. B) Pattern recognition. C) Learning. D) Clustering. 5. Which of the following clustering analysis method uses multi resolution approach A) STUNT. B) OPTICS. C) CLIQUE. D) Wave Cluster. 6. Which type of following clustering computes augmented cluster ordering A) OPTICS. B) CLIQUE. C) STING. D) CLUSTER. 7. Pick out a k-medoid algorithm. A) DBSCAN. B) BIRCH. C) PAM. D) CURE. 8. The a priori frequent itemset discovery algorithm moves in the lattice. A) Upward. B) Downward. C) Breadth wise. D)both upward and downward. 9. If a set is a frequent set and no superset of this set is a frequent set, then it is called. A) Maximal frequent set. B) Border set. C) Lattice. D) Infrequent sets. 10. is an example for case based-learning. A) Decision trees. B) Neural networks. C) Genetic algorithm. D) K-nearest neighbor. Cont 2

Code No: 126VW :2: Set No. 2 II Fill in the Blanks 11. Naive Bayes classifiers are 12. Are the components that define a Bayesian Belief Network 13. Bayesian Belief Networks also known as 14. k-nearest neighbor is same as 15. The partition algorithm uses 16. DBSCAN stands for 17. The Hierarchical Clustering algorithm finally produced by 18. A priori algorithm is otherwise called as 19. The first phase of A Priori algorithm is. 20. Bayesian Belief Networks specify -ooo-

Code No: 126VW Set No. 3 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 DATA WAREHOUSING AND DATA MINING Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. Data mining can also applied to other forms such as A) Data streams B) Sequence data C) Text data D)All of the Mentioned 2. The algorithm can be applied in cleaning data. A) Search. B) Pattern recognition. C) Learning. D) Clustering. 3. Which of the following clustering analysis method uses multi resolution approach A) STUNT. B) OPTICS. C) CLIQUE. D) Wave Cluster. 4. Which type of following clustering computes augmented cluster ordering A) OPTICS. B) CLIQUE. C) STING. D) CLUSTER. 5. Pick out a k-medoid algorithm. A) DBSCAN. B) BIRCH. C) PAM. D) CURE. 6. The a priori frequent itemset discovery algorithm moves in the lattice. A) Upward. B) Downward. C) Breadth wise. D)both upward and downward. 7. If a set is a frequent set and no superset of this set is a frequent set, then it is called. A) Maximal frequent set. B) Border set. C) Lattice. D) Infrequent sets. 8. is an example for case based-learning. A) Decision trees. B) Neural networks. C) Genetic algorithm. D) K-nearest neighbor. 9. is an essential process where intelligent methods are applied to extract data patterns. A) Data warehousing B) Data mining C) Text mining D) Data selection 10. is the process of finding a model that describes and distinguishes data classes or concepts. A) Data Characterization B) Data Classification C) Data discrimination D) Data selection Cont 2

Code No: 126VW :2: Set No. 3 II Fill in the Blanks 11. Bayesian Belief Networks also known as 12. k-nearest neighbor is same as 13. The partition algorithm uses 14. DBSCAN stands for 15. The Hierarchical Clustering algorithm finally produced by 16. A priori algorithm is otherwise called as 17. The first phase of A Priori algorithm is. 18. Bayesian Belief Networks specify 19. Naive Bayes classifiers are 20. Are the components that define a Bayesian Belief Network -ooo-

Code No: 126VW Set No. 4 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. III Year, II Sem., II Mid-Term Examinations, April-2018 DATA WAREHOUSING AND DATA MINING Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative: 1. Which of the following clustering analysis method uses multi resolution approach A) STUNT. B) OPTICS. C) CLIQUE. D) Wave Cluster. 2. Which type of following clustering computes augmented cluster ordering A) OPTICS. B) CLIQUE. C) STING. D) CLUSTER. 3. Pick out a k-medoid algorithm. A) DBSCAN. B) BIRCH. C) PAM. D) CURE. 4. The a priori frequent itemset discovery algorithm moves in the lattice. A) Upward. B) Downward. C) Breadth wise. D)both upward and downward. 5. If a set is a frequent set and no superset of this set is a frequent set, then it is called. A) Maximal frequent set. B) Border set. C) Lattice. D) Infrequent sets. 6. is an example for case based-learning. A) Decision trees. B) Neural networks. C) Genetic algorithm. D) K-nearest neighbor. 7. is an essential process where intelligent methods are applied to extract data patterns. A) Data warehousing B) Data mining C) Text mining D) Data selection 8. is the process of finding a model that describes and distinguishes data classes or concepts. A) Data Characterization B) Data Classification C) Data discrimination D) Data selection 9. Data mining can also applied to other forms such as A) Data streams B) Sequence data C) Text data D)All of the Mentioned 10. The algorithm can be applied in cleaning data. A) Search. B) Pattern recognition. C) Learning. D) Clustering. Cont 2

Code No: 126VW :2: Set No. 4 II Fill in the Blanks 11. The partition algorithm uses 12. DBSCAN stands for 13. The Hierarchical Clustering algorithm finally produced by 14. A priori algorithm is otherwise called as 15. The first phase of A Priori algorithm is. 16. Bayesian Belief Networks specify 17. Naive Bayes classifiers are 18. Are the components that define a Bayesian Belief Network 19. Bayesian Belief Networks also known as 20. k-nearest neighbor is same as -ooo-

2024 © technodocbox.com Privacy Policy | Terms of Service | Feedback