logo Hurry, Grab up to 30% discount on the entire course
Order Now logo

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Henry BehrensAccounting
(5/5)

892 Answers

Hire Me
expert
Bill BaileyLaw
(5/5)

841 Answers

Hire Me
expert
Dawn FrenchComputer science
(4/5)

910 Answers

Hire Me
expert
StatAnalytica ExpertComputer science
(5/5)

662 Answers

Hire Me
Data Mining

Give examples of real-world implementations of both a temporal database and a time series database. Provide one example of a temporal database.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Data Mining

1  Objectives

This assignment aims to achieve the following general learning objectives:

To further investigate the topics of the end-to-end process of data mining, data preparation, exploratory data analysis, self-organizing maps, and clustering;

  • To provide an opportunity to conduct research on the above-mentioned topics;

  • To provide an opportunity to demonstrate insight into the above-mentioned

 

2 Plagiarism Policy

The Department of Computer Science considers plagiarism to be a serious offense. Disciplinary action will be taken against students who commit plagiarism. Plagiarism includes copying someone else’s work without consent, copying a friend’s work (even with consent) and copying material from the Internet. Copying will not be tolerated in this module.

For a formal definition of plagiarism, the student is referred to (from the main page of the University of Pretoria site, follow the Library quick link, and then click the Plagiarism link under the Services menu). If you have any questions regarding this please consult the lecturer to avoid any misunderstanding.

Note that all assignments submitted for this module implicitly agree to this plagiarism policy, and declare that the submitted work is the student’s own work. Assignments may be checked using the Turnitin system. After plagiarism checking, assignments will not be permanently stored on the Turnitin database.

 

Question 1: Introductory Concepts

  1. Give examples of real-world implementations of both a temporal database and a time series database. Provide one example of a temporal database, and one example of a time series database. Your examples must illustrate the differences between the two databases by focusing on what values are stored in

  2. Imagine that you have to implement a neural network, and are told to do so using Argue

against this decision by providing two reasons why MapReduce is not well suited for this implementation.       

 

Question 2: Data Preparation   

  1. One approach to deal with missing values is to replace missing values for a tuple with the attribute’s mean over the class of the tuple. Suggest two drawbacks associated with this approach, assuming that such class information exists for each tuple in the data

  2. Identify one disadvantage associated with noise smoothing by means of equiwidth

  3. Describe three drawbacks that are unique to the integration of hard copy data into a consolidated

Question 3: Exploratory Data Analysis

  1. Identify one general problem associated with all exploratory data analysis

  2. Briefly explain why scaling is so important for most data visualization

  3. Give an example of a real-world situation in which a cumulative histogram should be used, rather than

an ordinary histogram.      

  1. Consider Chernoff faces used as glyph Identify one advantage associated with this type

of visualization. 

 

Question 4: Self-Organising Maps 

  1. Briefly explain how a self-organizing map can still be trained in the presence of the missing attribute

  2. Self-organizing maps exhibit a phenomenon whereby certain neurons are identified as interpolating units (also known as interpolating neurons). Briefly explain why interpolating units are useful in Self- organising map based visualisations, such as U-matrices.

  3. Consider the SIG* Suggest why the process that adds differentiating conditions to the rule

set is likely to produce very large and complex rule sets.        

 

Question 5: Clustering

  1. Briefly explain why Manhattan distance is more robust to noise and outliers than Euclidean  distance

  2. One problem associated with scatter plots is that they only compare two attribute values, resulting in many scatter plots being generated if the data set being analysed has even a moderate number of attributes. Suggest a way in which a clustering algorithm could be used to organise a large number of scatter plots related to a single data set, so that it is easier to detect correlations between attributes

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme