{
  "fetched_at": "2026-10-20T07:37:03Z",
  "source_url": "https://www.kaggle.com/competitions/anomaly-detection-challenges/data",
  "pages": [
    {
      "name": "data-description",
      "content": "<p>Description of data set can be found in german.describe.pdf which is downloadable in the additional data area. </p>\r\n<h2>File descriptions</h2>\r\n<ul>\r\n<li><strong>german.adcg.tr</strong> - the training set features</li>\r\n<li><strong>german.adcg.tr.label</strong> - the training set labels</li>\r\n<li><strong>german.adcg.tt</strong> - the test set</li>\r\n<li><strong>german.describe.pdf </strong>- description of the data set</li>\r\n<li><strong>german.test.submission.txt</strong> - sample of submission file</li>\r\n</ul>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "Description",
      "content": "<p>In information security domain, anomaly detection gains its own importance from researchers day by day. It is discovered that occasionally emerged frauds or intrusions in modern information systems have incurred significant loss when the suspicious activities were not detected or inefficiently processed. Therefore, numerous efforts have been devoted to devise effective detection methods, and then proceed to automation of anomaly identification in real time.</p>\r\n<p>In this practical course, we challenge students with a set of well designated learning tasks, which require the participants to understand the task scenario entirely and to design their own algorithms to identify corresponding anomalies.</p>\r\n<p>The competition on discovering the anomalies will be conducted based on the performance of their algorithms.</p>\r\n<h2>Contacts</h2>\r\n<p><img src=\"https://storage.googleapis.com/kaggle-media/competitions/inclass/3785/media/TUMLogo_mZlu_Vollfl_blau_RGB.png\" alt=\"TUM logo\" width=\"128\" height=\"41\" style=\"color: #333333; font-size: 1em; line-height: 1.5em;\" /></p>\r\n<p><strong>Department of computer science, Chair of IT Security     </strong></p>\r\n<p><em>See details in <a href=\"http://ml.sec.in.tum.de/adcg\" target=\"_blank\">ADCG SS'14 Homepage</a></em></p>\r\n<h2>Acknowledgements</h2>\r\n<p>We thank <a href=\"http://www.sec.in.tum.de/claudia-eckert/\" target=\"_blank\"><strong>Prof.Dr.Claudia Eckert</strong></a> for supporting us on this practical course.</p>",
      "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. </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>For submission of your results, you should give a format strictly as follows. </p>\r\n<p>First column indicates the unique Id of samples which exactly matches the test data set. Second column forms the predictions of your model which can be either 1 (positive, anomaly), or 0 (negative, normal sample). Columns are divided by comma. You should also include a header line at the top. Example,</p>\r\n<pre>Id,Predicts<br />1,1<br /><span style=\"font-size: 14px; line-height: 1.4em;\">2,0<br />3,1<br /></span><span style=\"font-size: 14px; line-height: 1.4em;\">4,0<br />5,0<br /></span><span style=\"font-size: 14px; line-height: 1.4em;\">etc.<br /></span></pre>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "rules",
      "content": "\r\n\t<!-- Begin Base Rules -->\r\n    <h3>One account per participant</h3>\r\n    <p>You cannot sign up to Kaggle from multiple accounts and therefore you cannot submit from multiple accounts.</p>\r\n    <h3>No private sharing outside teams</h3>\r\n    <p>\r\n        Privately sharing code or data outside of teams is not permitted.\r\n        It's okay to share code if made available to all participants on the forums.\r\n    </p>\r\n    <h3>Team Mergers</h3>\r\n    <p>Team mergers are not allowed in this competition.</p>\r\n\r\n    <h3>Team Limits</h3>\r\n    <p>The maximum size of a team is 2 participants.</p>\r\n    <h3>Submission Limits</h3>\r\n    <p>You may submit a maximum of 5 entries per day.</p>\r\n    <p>You may select up to 2 final submissions for judging.</p>\r\n    <h3>Competition Timeline</h3>\r\n    <p>Start Date: <strong>4/6/2014 2:52 PM UTC</strong></p>\r\n    <p>Merger Deadline: <strong>None</strong></p>\r\n    <p>Entry Deadline: <strong>None</strong></p>\r\n    <p>End Date: <strong>4/21/2014 11:59 PM UTC</strong></p>\r\n\t<!-- End Base Rules -->\r\n<p><strong>Visibility</strong></p>\r\n<p>The competition is opened to public, although the general purpose is subject to a practical course hosted in Technische Universität München. All registered students are ought to submit their results online.</p>\r\n<p><strong>What is the team size?</strong></p>\r\n<p>The team can be formed up to two registered students.</p>\r\n<p><strong>What are the credits?</strong></p>\r\n<p>Only registered students in TUM can get credits in the end of competition. Non-participants of the practical course can as well get ranked by uploading results, if they are interested.</p>\r\n<p><strong>How are the credits are evaluated?</strong></p>\r\n<p>Participants (registered students) are required to take part in each session in class. They ought to present their results in public and also hand in a short report (maximal 2 pages). Credits are evaluated based on their performance and also the results.</p>\r\n<p><strong>How to avoid cheating?</strong></p>\r\n<p>Teams are required to complete the challenges individually. If teams present similar reports/results, they are forced to proceed to a check-phase to defend themselves. <strong> </strong></p>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    }
  ]
}