0% found this document useful (0 votes)
79 views2 pages

Question Bank Unit 4

The document contains a model question paper for the Data Analytics course with 20 questions covering various topics related to machine learning and data analytics. The course outcomes section lists 5 outcomes of the course, including understanding the need for machine learning to solve problems, learning various algorithms and how to evaluate models, understanding latest trends in machine learning, designing and applying appropriate machine learning algorithms to real-world problems, and optimizing and reporting expected accuracy of learned models. The questions cover topics like frequent itemset mining, k-means clustering, limited pass algorithms, Apriori algorithm, need for clustering, ProCLUS algorithm implementation, clustering in non-Euclidean space, market based modeling, comparing CLIQUE and ProCLUS, CLIQUE algorithm, handling

Uploaded by

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

Question Bank Unit 4

The document contains a model question paper for the Data Analytics course with 20 questions covering various topics related to machine learning and data analytics. The course outcomes section lists 5 outcomes of the course, including understanding the need for machine learning to solve problems, learning various algorithms and how to evaluate models, understanding latest trends in machine learning, designing and applying appropriate machine learning algorithms to real-world problems, and optimizing and reporting expected accuracy of learned models. The questions cover topics like frequent itemset mining, k-means clustering, limited pass algorithms, Apriori algorithm, need for clustering, ProCLUS algorithm implementation, clustering in non-Euclidean space, market based modeling, comparing CLIQUE and ProCLUS, CLIQUE algorithm, handling

Uploaded by

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

IMS Engineering College

NH-09, Adhyatmik Nagar, Near Dasna, Distt. Ghaziabad, U.P.


Tel: (0120) 4940000

Department of Computer Science & Engineering


Data Analytics(KCS-051) (2022-2023)

Model question paper 4


COURSE OUTCOMES

By the end of the course, students will be able to:


CO No. Description Bloom’s Level
C 305.1 To understand the need for machine learning for various problem solving K1, K2

C 305.2 To understand a wide variety of learning algorithms and how to evaluate K1, K3
models generated from data
C 305.3 To understand the latest trends in machine learning K2, K3
C 305.4 To design appropriate machine learning algorithms and apply the K4, K6
algorithms to a real-world problem
C 305.5 To optimize the models learned and report on the expected accuracy that K4, K5
can be achieved by applying the models

1. Why do we need to mine frequent item datasets in input data. Explain


2. Explain k- means clustering in detail
3. Write a short note on limited pass Algorithms?
4. Discuss APRIORI Algorithm.
5. What is the need of clustering in data analytics?
6. How to implement ProCLUS algo.
7. How can we implement clustering in non-Euclidean space?
8. Discuss the need of market based modeling in Data Analytics
9. Compare CLIQUE & ProCLUS algo.
10.Explain CLIQUE algorithm in detail.
11. What are the different ways to handle large datasets in main memory.
12. How to implement clustering for streams?
13.Write a short note on Hierarchical clustering.
14. How to check frequent item sets in a stream.
15. Explain the concept of parallelism in clustering.
16. What are the different ways of hierarchical clustering.
17.What do you mean by non Euclidean space in Data analytics.
18. Discuss the need of clustering when dealing with parallel data items
19.How to implement clustering with high D data.
20. Different agglomerative and divisive clustering techniques.

You might also like