logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

you will perform a data linkage on two real-world datasets and explore different classification algorithms

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Introduction

For this project, you will perform a data linkage on two real-world datasets (Part 1) and explore different classification algorithms (Part 2).

The project is to be coded in Python 3. Eight (8) relevant data sets can be downloaded from LMS and are available on Juptyer Hub:

ˆ datasets for Part 1: Data Linkage

  • csv

  • csv

  • amazon google csv

  • amazon csv

  • google csv

  • amazon google truth csv

ˆ datasets for Part 2: Classification:

  • csv

  • csv

Please note that your solution program should behave the same way as intended if a similar but different input dataset in an identical format is used. Hard-coding any part of solution will attract a heavy mark-deduction. 

Part 1 - Data Linkage (12 marks)

Amazon and Google both have product databases. They would like to link the same products in order to perform joint market research.

Marking guide for Task 1-A:

Na¨ıve data linkage without blocking (4 marks)

  • mark Not reproducible - code does not pass the test script given:  this could    be due to the source file is not named py and the output file task1a.csv is not produced.

The output is hardcoded or the output is completely incorrect.

  • mark The output is in the format as At least one of Precision or Recall are below 0.6.

  • marks The output is in the format as specified. Both Precision and Recall are above 6.

  • marks The output is in the format as specified. Both Precision and Recall are above 8.

  • marks The output is in the format as specified. Both Precision and Recall are above 9.

Marking guide for Task 1-B

Blocking for efficient data linkage (4 marks)

  • mark Not reproducible - code does not pass the test script given:  this could    be due to the source file is not named py and the output files amazon blocks.csv and google blocks.csv are not produced; or

The output is hardcoded or the output is completely incorrect, or The blocking method is not linear in time complexity.

  • mark The output is in the format as specified. PC is below 0.4 and/or RR is below 6.

  • marks The output is in the format as specified. PC is above 0.4 and RR is above 0.6.

  • marks The output is in the format as specified. PC is above 0.6 and RR is above 0.8.

  • marks The output is in the format as specified. PC is above 0.8 and RR is above 0.9.

Marking guide for Task 1-C:

Report on the Data Linkage Project (4 marks)

Scoring method: How the product comparison works

 1 mark  the comparison functions, final scoring function and threshold are appropriate and are clearly and succinctly described, including any preprocessing applied.

0.5 mark  Description of the product comparison is understandable but somewhat unclear. It contains insufficient or excessive unnecessary or incorrect information. Missing some key information on the methods applied.

  • mark The description misses key information about the product com- parison method and/or is

Evaluation of the overall performance of the product comparison

 mark Evaluation of the performance is clear and succinct; the potential improvements are sensible and not overly

0.5 marks            Evaluation of the performance lacks sufficient details or contains excessive information to give clarity and/or the potential improvements are not convincing or are overly simplistic.

  • mark Evaluation of the performance is substantially incorrect and/or the potential improvements are incorrect or

Blocking method: How the blocking method works

 mark The blocking method is appropriate and is clearly and succinctly described; includes any preprocessing

0.5 mark            Description of the blocking method is understandable but some- what unclear. It contains insufficient or excessive unnecessary information or some incorrect information.

  • mark The description misses key information about the blocking method and/or is

Evaluation of the blocking method

  • mark Evaluation of the blocking performance is clear and succinct and the overall performance relates well to the measures

The potential improvements are sensible and convincing.

The time-complexity of the blocking method is correct and clearly indicated or can be clearly inferred.

0.5 mark            Evaluation of the blocking performance is somewhat unclear. It lacks sufficient details or contains excessive information to give clarity; or

Overall performance is not well related to the measures used; or The potential improvements are not convincing; or

The time-complexity of the blocking method and its correctness are unclear.

0 mark               The evaluation of the blocking performance is substantially incor- rect, or the potential improvements are incorrect or missing.

Marking guide for Task 2-A:

Comparing Classification Algorithms (3 marks)

Please note that your solution program should behave the same way as intended if a similar but different input dataset in an identical format is used. Hard-coding any part of the solution will attract a heavy mark-deduction.

Failure to pass the test script will result in 0 mark for the task.

 mark Not reproducible - code does not pass the test script given:  this could    be due to the source file is not named py and the output file task2a.csv is not produced.

The classification accuracy of the three classifiers are not printed to stan- dard output.

The output is hardcoded or the output is completely incorrect.

  • mark The output file csv is correct but the classification accuracies are substantially incorrect.

  • marks The classification accuracies for some of the classifiers are slightly

  • marks The output file csv is produced and has correct number of rows/columns and has correct values.

The classification accuracies are correct for all three classifiers.

Marking guide for Task 2-B:

Feature Engineering and Selection(6 marks)

Please note that your solution program should behave the same way as intended if a similar but different input dataset in an identical format is used. Hard-coding any part of the solution will attract a heavy mark-deduction.

Failure to pass the test script will result in 0 mark for the task.

 Overall

 mark Not reproducible - code does not pass the test script given: this could be due to the source file not being named py.

Feature engineering – interaction terms

 mark Evidence of correct implementation of interaction term pairs. Output that support the correct implementation produced and the outputs are

0.5 mark      Evidence of partially correct implementation of interaction term pairs. Output that support the implementation produced and the outputs are partially correct.

0 mark        No output is produced as supporting evidence of implementation of this sub- task (even if the sub-task is implemented in task2b.py)

 Feature engineering – clustering

 2 marks Evidence of correct implementation of feature engineered from clustering. Outputs that support the correct implementation produced and the outputs are correct.

Evidence of implementing a good choice of k for k-means clustering. Outputs that support a good selection of k produced.

1 mark Implementation of feature engineering from clustering and choice of k for k- means clustering are largely correct but contain some minor issues.

Appropriate outputs as evidence of the implementation are produced but choice of k is hard-coded or inappropriate.

  • mark No output is produced as supporting evidence of implementation of this sub-  task (even if the sub-task is implemented in py)

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. 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. The LineItem class will represent an individual

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

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

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

expert
Um e HaniScience

851 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

959 Answers

Hire Me
expert
Husnain SaeedComputer science

565 Answers

Hire Me
expert
Atharva PatilComputer science

636 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30