{
  "fetched_at": "2026-10-20T01:27:36Z",
  "source_url": "https://www.kaggle.com/competitions/applai-delta-competition-b/data",
  "pages": [
    {
      "name": "rules",
      "content": "This is a page where you can include rules that participants must accept before joining. You may wish to include rules like:\n\n - Don't cheat!\n - Apply yourself!\n - Have fun!",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "data-description",
      "content": "Attribute Information:\nEach candidate is described by 8 continuous variables, and a single class variable. The first four are simple statistics obtained from the integrated pulse profile (folded profile). This is an array of continuous variables that describe a longitude-resolved version of the signal that has been averaged in both time and frequency . The remaining four variables are similarly obtained from the DM-SNR curve . These are summarised below:\n\n- Mean of the integrated profile.\n- Standard deviation of the integrated profile.\n- Excess kurtosis of the integrated profile.\n- Skewness of the integrated profile.\n- Mean of the DM-SNR curve.\n- Standard deviation of the DM-SNR curve.\n- Excess kurtosis of the DM-SNR curve.\n- Skewness of the DM-SNR curve.\n- Class\nHTRU 2 Summary\n17,898 total examples.\n1,639 positive examples.\n16,259 negative examples.\n\nSource: https://archive.ics.uci.edu/ml/datasets/HTRU2\n\nDr Robert Lyon\nUniversity of Manchester\nSchool of Physics and Astronomy\nAlan Turing Building\nManchester M13 9PL\nUnited Kingdom\nrobert.lyon '@' manchester.ac.uk",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "Description",
      "content": "\n    PREDICTING A PULSAR STAR\nDr Robert Lyon\n\nHTRU2 is a data set which describes a sample of pulsar candidates collected during the High Time Resolution Universe Survey .\n\nPulsars are a rare type of Neutron star that produce radio emission detectable here on Earth. They are of considerable scientific interest as probes of space-time, the inter-stellar medium, and states of matter .\n\nAs pulsars rotate, their emission beam sweeps across the sky, and when this crosses our line of sight, produces a detectable pattern of broadband radio emission. As pulsars\nrotate rapidly, this pattern repeats periodically. Thus pulsar search involves looking for periodic radio signals with large radio telescopes.\n\nEach pulsar produces a slightly different emission pattern, which varies slightly with each rotation . Thus a potential signal detection known as a 'candidate', is averaged over many rotations of the pulsar, as determined by the length of an observation. In the absence of additional info, each candidate could potentially describe a real pulsar. However in practice almost all detections are caused by radio frequency interference (RFI) and noise, making legitimate signals hard to find.\n\nMachine learning tools are now being used to automatically label pulsar candidates to facilitate rapid analysis. Classification systems in particular are being widely adopted,\nwhich treat the candidate data sets as binary classification problems. Here the legitimate pulsar examples are a minority positive class, and spurious examples the majority negative class.\n\nThe data set shared here contains 16,259 spurious examples caused by RFI/noise, and 1,639 real pulsar examples. These examples have all been checked by human annotators.\n\nEach row lists the variables first, and the class label is the final entry. The class labels used are 0 (negative) and 1 (positive).\n\nAttribute Information:\nEach candidate is described by 8 continuous variables, and a single class variable. The first four are simple statistics obtained from the integrated pulse profile (folded profile). This is an array of continuous variables that describe a longitude-resolved version of the signal that has been averaged in both time and frequency . The remaining four variables are similarly obtained from the DM-SNR curve . These are summarised below:\n\nMean of the integrated profile.\nStandard deviation of the integrated profile.\nExcess kurtosis of the integrated profile.\nSkewness of the integrated profile.\nMean of the DM-SNR curve.\nStandard deviation of the DM-SNR curve.\nExcess kurtosis of the DM-SNR curve.\nSkewness of the DM-SNR curve.\nClass\nHTRU 2 Summary\n17,898 total examples.\n1,639 positive examples.\n16,259 negative examples.\n\nSource: https://archive.ics.uci.edu/ml/datasets/HTRU2\n\nDr Robert Lyon\nUniversity of Manchester\nSchool of Physics and Astronomy\nAlan Turing Building\nManchester M13 9PL\nUnited Kingdom\nrobert.lyon '@' manchester.ac.uk\n",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "Evaluation",
      "content": "<p>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:</p>\r\n<hr />\r\n<p>The evaluation metric for this competition is <a href=\"https://www.kaggle.com/wiki/MeanFScore\"> Mean F1-Score</a>. 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:</p>\r\n<p>\\[ F1 = 2\\frac{p \\cdot r}{p+r}\\ \\ \\mathrm{where}\\ \\ p = \\frac{tp}{tp+fp},\\ \\ r = \\frac{tp}{tp+fn} \\]</p>\r\n<p>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.</p>\r\n<h2>Submission Format</h2>\r\n<p><strong>For every author in the dataset</strong>, 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).</p>\r\n<p>The file should contain a header and have the following format:</p>\r\n<pre>AuthorId,DuplicateAuthorIds<br />1,1<br /><span style=\"font-size: 14px; line-height: 1.4em;\">8,8<br />9,9 10<br /></span><span style=\"font-size: 14px; line-height: 1.4em;\">10,10 9<br /></span><span style=\"font-size: 14px; line-height: 1.4em;\">etc.</span></pre>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    }
  ]
}