Szerző: Mihai Nan
In the heart of the Kingdom lies the Royal Diamond Store, where precious stones
of all shapes and sizes are carefully kept.
The store's guardian wants to discover how valuable the diamonds are,
based on their physical and aesthetic characteristics, but the price scrolls
have been lost over time.
To help, the royal council created a dataset:
train.csv – diamonds already evaluated, with all features and their pricetest.csv – new diamonds, with features filled in, but no priceYour task is to uncover the secrets of diamond value using data analysis and predictive models.
Each row in train.csv and test.csv represents a diamond described by the following features:
Fair, Good, Very Good, Premium, Ideal)D … J), D being the bestClassify diamonds in test.csv based on weight (carat):
Light if carat < 0.5Medium if 0.5 ≤ carat < 1.5Heavy if carat ≥ 1.5Calculate the proportion of depth to table for each diamond in test:
proportion = depth / table
Determine the approximate volume of each diamond using:
volume = x * y * z
Build a method capable of estimating diamond value (price)
for each diamond in test.csv.
Evaluation is performed using MAE (Mean Absolute Error):
Score for the last task:
Subtask 1 answers are evaluated exactly.
For subtasks 2 and 3, answers are evaluated up to 2 decimal places.
cut, color, clarity) can be converted to numericThe submission.csv file must contain one line per test row
and per subtask:
subtaskID datapointID answer
SampleID from testSampleID = 1023:subtaskID datapointID answer
1 1023 Medium
2 1023 0.619
3 1023 0.34
4 1023 4578