{ "fetched_at": "2026-10-20T00:27:19Z", "source_url": "https://www.kaggle.com/competitions/dscmeetup3/data", "pages": [ { "name": "rules", "content": "This challenge will be guided by DSC rules which are summarized below:\n\n - Don't cheat!\n - Apply yourself!\n - Have fun!\n - One account per participant\n - You may submit as many entries as the platform allows within the competition time. (The Kaggle Platform allows up to 20 submissions within a 24 hour period but for this challenge, we’ve set it to 10 within a 24 hour period.)\n - Please make all submissions before the deadline.\n - You will be judged on your best-performing solution.\n - A team with a maximum of three (3) members is allowed.\n", "isPublished": false, "hasIsPublished": false, "postTitle": "", "hasPostTitle": false, "mimeType": "", "hasMimeType": false }, { "name": "data-description", "content": "Details about the columns in the dataset can be found below:\n\n - Customer Id\tIdentification number for the customer\n - Firstname\tyear of observation for the insured policy \n - Middlename\t\n - LastName\t\n - City\t\n - StateProvinceName\t\n - CountryRegionName\t\n - PostalCode\t\n - PhoneNumber\t\n - Birthdate\tCustomer’s date of birth\n - Education\t\n - Occupation\t\n - Gender\tGender. (M=Male, F=Female)\n - Marital Status\tMarital Status (M=Married, S=Single)\n - HomeOwnerFlag\tIs customer a home owner? (1=Yes, 0=No)\n - NumberCarsOwned\tNumber of cars owned by the customer\n - NumberChildrenAtHome\tNumber of customers’ children currently living with them\n - TotalChildren\tTotal children \n - YearlyIncome\tCustomers’ yearly income ($)\n - BuyScooter\tDid the customer buy scooter or not (1=Yes, 0=No)", "isPublished": false, "hasIsPublished": false, "postTitle": "", "hasPostTitle": false, "mimeType": "", "hasMimeType": false }, { "name": "Description", "content": "CityMov, is a well-known firm in the Automotive industry with a continuous drive to addressing traffic congestion. This drive led them to the manufacturing of a mini scooter and then wonder if their customers are likely to buy this new solution despite having other means of transportation.\n\nThe first release of the Scooter called (NeverLate) recorded much success and since then look forward to releasing the improved version.\n\nYou have been appointed as the Lead Data Scientist to build a predictive model to determine if a customer will buy this product or not.\n\nThe model will be based on the customer characteristics. The target variable, BuyScooter, is a:\n\n - 1 if the customer buys the scooter.\n - 0 if the customer didn’t.\n", "isPublished": false, "hasIsPublished": false, "postTitle": "", "hasPostTitle": false, "mimeType": "", "hasMimeType": false }, { "name": "Evaluation", "content": "

The evaluation pages describes how submissions will be scored and how students should format their submissions. You don't need a sub-title at the top (the page title appears above). For an example of a high quality evaluation page, see the 2013 KDD Cup page, which we have copied here:

\r\n
\r\n

The evaluation metric for this competition is Mean F1-Score. The F1 score, commonly used in information retrieval, measures accuracy using the statistics precision p and recall r. Precision is the ratio of true positives (tp) to all predicted positives (tp + fp). Recall is the ratio of true positives to all actual positives (tp + fn). The F1 score is given by:

\r\n

\\[ F1 = 2\\frac{p \\cdot r}{p+r}\\ \\ \\mathrm{where}\\ \\ p = \\frac{tp}{tp+fp},\\ \\ r = \\frac{tp}{tp+fn} \\]

\r\n

The F1 metric weights recall and precision equally, and a good retrieval algorithm will maximize both precision and recall simultaneously. Thus, moderately good performance on both will be favored over extremely good performance on one and poor performance on the other.

\r\n

Submission Format

\r\n

For every author in the dataset, submission files should contain two columns: AuthorId and DuplicateAuthorIds. DuplicateAuthorIds should be a space-delimited list. Every AuthorId counts as his/her own duplicate, and every duplicate should be listed under each of its respective ids. For example, if you suspect author A, B, and C are the same, you should list (A,A B C), (B,B A C), (C,C A B).

\r\n

The file should contain a header and have the following format:

\r\n
AuthorId,DuplicateAuthorIds
1,1
8,8
9,9 10
10,10 9
etc.
", "isPublished": false, "hasIsPublished": false, "postTitle": "", "hasPostTitle": false, "mimeType": "", "hasMimeType": false } ] }