Data
jannis

jannis

active ARFF Publicly available Visibility: public Uploaded 16-08-2018 by Janek Thomas
0 likes downloaded by 1 people , 1 total downloads 0 issues 0 downvotes
  • chalearn Life Science Machine Learning study_218 study_271 study_240 study_424 study_425 study_426 study_226
Issue #Downvotes for this reason By


Loading wiki
Help us complete this description Edit
SOURCE: [ChaLearn Automatic Machine Learning Challenge (AutoML)](https://competitions.codalab.org/competitions/2321), [ChaLearn](https://automl.chalearn.org/data) This is a "supervised learning" challenge in machine learning. We are making available 30 datasets, all pre-formatted in given feature representations (this means that each example consists of a fixed number of numerical coefficients). The challenge is to solve classification and regression problems, without any further human intervention. The difficulty is that there is a broad diversity of data types and distributions (including balanced or unbalanced classes, sparse or dense feature representations, with or without missing values or categorical variables, various metrics of evaluation, various proportions of number of features and number of examples). The problems are drawn from a wide variety of domains and include medical diagnosis from laboratory analyses, speech recognition, credit rating, prediction or drug toxicity or efficacy, classification of text, prediction of customer satisfaction, object recognition, protein structure prediction, action recognition in video data, etc. While there exist machine learning toolkits including methods that can solve all these problems, it is still considerable human effort to find, for a given combination of dataset, task, metric of evaluation, and available computational time, the combination of methods and hyper-parameter setting that is best suited. Your challenge is to create the "perfect black box" eliminating the human in the loop. This is a challenge with code submission: your code will be executed automatically on our servers to train and test your learning machines with unknown datasets. However, there is NO OBLIGATION TO SUBMIT CODE. Half of the prizes can be won by just submitting prediction results. There are six rounds (Prep, Novice, Intermediate, Advanced, Expert, and Master) in which datasets of progressive difficulty are introduced (5 per round). There is NO PREREQUISITE TO PARTICIPATE IN PREVIOUS ROUNDS to enter a new round. The rounds alternate AutoML phases in which submitted code is "blind tested" in limited time on our platform, using datasets you have never seen before, and Tweakathon phases giving you time to improve your methods by tweaking them on those datasets and running them on your own systems (without computational resource limitation). NOTE: This dataset corresponds to one of the datasets of the challenge.

55 features

class (target)nominal4 unique values
0 missing
V1numeric49883 unique values
0 missing
V2numeric854 unique values
0 missing
V3numeric871 unique values
0 missing
V4numeric78429 unique values
0 missing
V5numeric80119 unique values
0 missing
V6numeric77198 unique values
0 missing
V7numeric79001 unique values
0 missing
V8numeric78272 unique values
0 missing
V9numeric76727 unique values
0 missing
V10numeric72445 unique values
0 missing
V11numeric73939 unique values
0 missing
V12numeric76580 unique values
0 missing
V13numeric78893 unique values
0 missing
V14numeric78948 unique values
0 missing
V15numeric79167 unique values
0 missing
V16numeric81910 unique values
0 missing
V17numeric81865 unique values
0 missing
V18numeric81469 unique values
0 missing
V19numeric77497 unique values
0 missing
V20numeric82216 unique values
0 missing
V21numeric81534 unique values
0 missing
V22numeric75989 unique values
0 missing
V23numeric80108 unique values
0 missing
V24numeric80124 unique values
0 missing
V25numeric82018 unique values
0 missing
V26numeric81783 unique values
0 missing
V27numeric81574 unique values
0 missing
V28numeric77513 unique values
0 missing
V29numeric857 unique values
0 missing
V30numeric82218 unique values
0 missing
V31numeric79105 unique values
0 missing
V32numeric78979 unique values
0 missing
V33numeric75973 unique values
0 missing
V34numeric78980 unique values
0 missing
V35numeric82248 unique values
0 missing
V36numeric81452 unique values
0 missing
V37numeric72571 unique values
0 missing
V38numeric869 unique values
0 missing
V39numeric72535 unique values
0 missing
V40numeric79167 unique values
0 missing
V41numeric81830 unique values
0 missing
V42numeric79012 unique values
0 missing
V43numeric76026 unique values
0 missing
V44numeric73851 unique values
0 missing
V45numeric78963 unique values
0 missing
V46numeric78410 unique values
0 missing
V47numeric76748 unique values
0 missing
V48numeric78323 unique values
0 missing
V49numeric72534 unique values
0 missing
V50numeric81484 unique values
0 missing
V51numeric79239 unique values
0 missing
V52numeric76003 unique values
0 missing
V53numeric50002 unique values
0 missing
V54numeric77225 unique values
0 missing

62 properties

83733
Number of instances (rows) of the dataset.
55
Number of attributes (columns) of the dataset.
4
Number of distinct values of the target attribute (if it is nominal).
0
Number of missing values in the dataset.
0
Number of instances with at least one value missing.
54
Number of numeric attributes.
1
Number of nominal attributes.
0
Percentage of binary attributes.
3.38
Second quartile (Median) of standard deviation of attributes of the numeric type.
Maximum entropy among attributes.
-1.59
Minimum kurtosis among attributes of the numeric type.
0
Percentage of instances having missing values.
Third quartile of entropy among attributes.
216.16
Maximum kurtosis among attributes of the numeric type.
-0.75
Minimum of means among attributes of the numeric type.
0
Percentage of missing values.
6.59
Third quartile of kurtosis among attributes of the numeric type.
125.44
Maximum of means among attributes of the numeric type.
Minimal mutual information between the nominal attributes and the target attribute.
98.18
Percentage of numeric attributes.
34.51
Third quartile of means among attributes of the numeric type.
Maximum mutual information between the nominal attributes and the target attribute.
4
The minimal number of distinct values among attributes of the nominal type.
1.82
Percentage of nominal attributes.
Third quartile of mutual information between the nominal attributes and the target attribute.
4
The maximum number of distinct values among attributes of the nominal type.
-10.43
Minimum skewness among attributes of the numeric type.
First quartile of entropy among attributes.
1.01
Third quartile of skewness among attributes of the numeric type.
2.48
Maximum skewness among attributes of the numeric type.
0.04
Minimum standard deviation of attributes of the numeric type.
-0.46
First quartile of kurtosis among attributes of the numeric type.
18.64
Third quartile of standard deviation of attributes of the numeric type.
60.75
Maximum standard deviation of attributes of the numeric type.
2.01
Percentage of instances belonging to the least frequent class.
1687
Number of instances belonging to the least frequent class.
0.36
First quartile of means among attributes of the numeric type.
0
Standard deviation of the number of distinct values among attributes of the nominal type.
Average entropy of the attributes.
0
Number of binary attributes.
First quartile of mutual information between the nominal attributes and the target attribute.
20.29
Mean kurtosis among attributes of the numeric type.
0.13
First quartile of skewness among attributes of the numeric type.
24.8
Mean of means among attributes of the numeric type.
0.25
First quartile of standard deviation of attributes of the numeric type.
0.36
Average class difference between consecutive instances.
Average mutual information between the nominal attributes and the target attribute.
Second quartile (Median) of entropy among attributes.
1.6
Entropy of the target attribute values.
An estimate of the amount of irrelevant information in the attributes regarding the class. Equals (MeanAttributeEntropy - MeanMutualInformation) divided by MeanMutualInformation.
-0.23
Second quartile (Median) of kurtosis among attributes of the numeric type.
0
Number of attributes divided by the number of instances.
4
Average number of distinct values among the attributes of the nominal type.
0.82
Second quartile (Median) of means among attributes of the numeric type.
Number of attributes needed to optimally describe the class (under the assumption of independence among attributes). Equals ClassEntropy divided by MeanMutualInformation.
-0.28
Mean skewness among attributes of the numeric type.
Second quartile (Median) of mutual information between the nominal attributes and the target attribute.
46.01
Percentage of instances belonging to the most frequent class.
12.04
Mean standard deviation of attributes of the numeric type.
0.37
Second quartile (Median) of skewness among attributes of the numeric type.
38522
Number of instances belonging to the most frequent class.
Minimal entropy among attributes.

20 tasks

12 runs - estimation_procedure: 10-fold Crossvalidation - evaluation_measure: mean_class_complexity - target_feature: class
2 runs - estimation_procedure: 33% Holdout set - evaluation_measure: predictive_accuracy - target_feature: class
0 runs - estimation_procedure: 20% Holdout (Ordered) - target_feature: class
0 runs - estimation_procedure: 10 times 10-fold Crossvalidation - target_feature: class
0 runs - estimation_procedure: 4-fold Crossvalidation - target_feature: class
0 runs - estimation_procedure: 10-fold Crossvalidation - evaluation_measure: predictive_accuracy - target_feature: class
0 runs - estimation_procedure: 10-fold Learning Curve - target_feature: class
0 runs - estimation_procedure: 10-fold Learning Curve - target_feature: class
0 runs - estimation_procedure: 10-fold Learning Curve - target_feature: class
0 runs - estimation_procedure: 10-fold Learning Curve - target_feature: class
0 runs - estimation_procedure: Interleaved Test then Train - target_feature: class
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
0 runs - estimation_procedure: 50 times Clustering
Define a new task