{
  "fetched_at": "2026-10-19T09:36:46Z",
  "source_url": "https://www.kaggle.com/competitions/11-761-project/data",
  "pages": [
    {
      "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>There is no maximum team size.</p>\r\n    <h3>Submission Limits</h3>\r\n    <p>You may submit a maximum of 2 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>TBA</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>2/1/2014 12:00 AM UTC</strong></p>\r\n\t<!-- End Base Rules -->\r\n<p>The rules page is a bit special: it will auto-update the text based on the parameters of the competition. The rules you need to add here are any additional rules relating to dataset usage. You may also put grading information here.</p>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "data-description",
      "content": "<p> This is where you find the dataset as described in the overview </p>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "Description",
      "content": "<style>\n  h1 {text-align: center; color: red; font-weight: bold}\n  p {margin-left: 25}\n  ul, ol {margin-left: 45}\n</style>\n\n<p>The year is 1050 BC near the warm beaches of the Mediterranean Sea. The Martians have invaded. It is a time when earthlings have to unite against the colonial Martians who are conspiring against us to take over the planet. The Martians can time travel too! They travel to the year 1997 to a small town in the United Kingdom and pick up three things, an English Grammar book, Good-Turing’s paper, and newspapers from a local market. Their aim is to destroy Earth retroactively. They come back to the year 1050 BC and alter everything in Earthling’s civilizations history to make them never land on Mars, their beloved land. \nModern day language and the alphabet was in the formative stages in 1050 BC. The Phoenician alphabet is the oldest verified consonantal alphabet. The Martians now have a diabolical plan. They want to spread nonsensical news amongst the Phoenicians for them to believe this nonsensical news is valid language. If language had never developed, do you think humans could have ever sent out missions to Mars? \nThe one thing Martians are good at is statistics (They do have Good-Turing’s paper after all). They develop a trigram language model using the GT paper, which they will use to generate nonsensical news in the Phoenician alphabet using the newspapers they picked up from the year 1997. You are a local in Greece, and an independent researcher, who wants to stop the martians from succeeding by removing all the fake articles from circulation. Your job is to distinguish between the fake and real articles that are being circulated in your town by using your statistics knowledge which Prof. Bhiksha has taught you in your dreams. (Well, CMU 11-761 Fall 2018 course has a dream edition too).\n</p>\n\n<p>Here are the files at your disposal:</p>\nThe following files can be found in the data section of kaggle:\n<li><span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\"><b>\n  corpus</b><br>\n<p> The collection of newpapers the Martians took from 1997 in the Phoenician alphabet. You may use this to build your own language models. </p></li>\n  <li><span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\"><b>\n  trainingSet</b><br>\n    </span><span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\">1000\n    articles, 500 real and 500 fake, of varying lengths.<br>\n    Articles are separated by the separator `~~~~~'.<br>\n    The tags &lt;s&gt; and &lt;/s&gt; represent begin and end of sentence,\n    respectively.</span></li>\n  <li><span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\"><b>\n  trainingSetLabels</b><br>\n    Contains the correct labels for <b>trainingSet</b>.&nbsp; A `0' means the\n    article is fake and `1' means it is real.</span></li>\n  <li><span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\"><b>\n  developmentSet</b><br>\n    Contains 200 articles, 100 real and 100 fake, in the same format as <b>trainingSet</b>.<br>\n    Note: </span><i>Articles were truncated </i>to meet the following length <span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\">(#\n    of sentences) </span>distribution for each category:\n    <table border=\"1\" width=\"42%\">\n      <tbody><tr>\n        <td width=\"42%\">Number of sentences</td>\n        <td width=\"58%\">Number of articles with this number of sentences</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">1</td>\n        <td width=\"58%\">20</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">2</td>\n        <td width=\"58%\">10</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">3</td>\n        <td width=\"58%\">10</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">4</td>\n        <td width=\"58%\">10</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">5</td>\n        <td width=\"58%\">10</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">7</td>\n        <td width=\"58%\">10</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">10</td>\n        <td width=\"58%\">10</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">15</td>\n        <td width=\"58%\">10</td>\n      </tr>\n      <tr>\n        <td width=\"42%\">20</td>\n        <td width=\"58%\">10</td>\n      </tr>\n    </tbody></table>\n    <p><i>[</i><i>Note: the set on which you will be tested (\"test\n    set\") will have the same format, approximately the same number of real and fake articles, and the same length distributions as this development set.&nbsp;\n    Of course, the shorter the truncated article, the harder the classification\n    decision.]&nbsp;</i></p></li>\n  <li><span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\"><b>\n  developmentSetLabels<br>\n    </b>Contains the correct labels for <b>developmentSet</b>, in the same\n    format as <b>trainingSetLabels</b>.</span></li>\n<li><span style=\"mso-fareast-font-family:&quot;MS Mincho&quot;\"><b>\n  testSet</b><br>\n<p> The format is the same as in trainingSet and developmentSet. You are required to submit your final predictions on this testSet. Your output file must contain 200 lines with predictions (0/1)  \n</ul>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    },
    {
      "name": "Evaluation",
      "content": "<p>There are 2 evaluation metrics Hard and soft metric. We will be evaluating the hard metric on kaggle. For this, for each article in the test set, you will output the first line as <b> id,category </b> (no whitespace after comma) and the subsequent lines in that format, where id is the document number indexed from 1 and category is 0/1 (You will submit only this file to Kaggle). For the soft metric: For each article in the test set, your program should output the two\nposteriors: P(fake|article) and P(true|article) (which of course should sum to\none), in that order.&nbsp; It should also output a classification decision: 0\nfor \"fake\", 1 for \"true\".&nbsp; Typically (but not\nnecessarily), the latter would be 1 if P(true|article)&gt;0.5, 0 otherwise, with\nsome tie-breaking for the 0.5 case.&nbsp; These three numbers should be output\non the same line, separated by a single space, one line per article, e.g.:<br>\n0.791243&nbsp;0.208757&nbsp;0</br>\n0.300781&nbsp;0.699219&nbsp;1</p>\n<p>The performance of your program on the test set will be judged in the\nfollowing two ways:<br>\n&nbsp;&nbsp;&nbsp; 1. \"Hard\" metric:&nbsp; % correct classification<br>\n&nbsp;&nbsp;&nbsp; 2. \"Soft\" metric: average log posterior of the\ncorrect label [ P(correct_label|article) ].&nbsp; (You won't know the correct\nlabel of the test set, but the grading program will).&nbsp; This is akin to the\nlog perplexity of predicting the \"language\" consisting of the two\n\"words\", TRUE and FAKE. It will be wise to avoid giving your prediction a probability of 1, unless you are absolutely sure (think about what will happen it you are actually wrong.)</p>\n<p>You are free to use the given files in any way you wish.&nbsp; One reasonable\napproach would be to study the differences between the true and fake articles in\nthe 1000 article <b>trainingSet</b>, using both manual \"detective\nwork\" and automatic statistical analysis, and use this to suggest various\naspects along which the two differ, optimizing parameters on this training\nset.&nbsp; The 200 article <b>developmentSet</b> can be used to (1) test and\nvalidate suggested improvements, and perhaps to (2) optimize a few additional\nparameters.&nbsp; You would also use the development set to (3) estimate the\nexpected performance of your program on new data.&nbsp; Note though that the\nmore you use the development set for (1) and (2), the more your solution will\nadjust itself to that set, and the less accurate would be the estimate derived\nin (3).&nbsp;</p>\n<p>You are encouraged to use any and every statistical technique or concept that\nwe learned in class (and others too).&nbsp; And, perhaps more importantly, you\nare encouraged to use anything you learned about the properties of language (and\nof trigram models...). You are free to use external resources.</p>\n<h3> Teams: </h3>\n<p>For this project you will form groups of <b>exactly three</b> people.\n  <b><i>You are required to form your team no later than Nov 10th, and you must email Pramati (pkalwad@andrew.cmu.edu) your group members by then </i></b>. One email per team, with other team members cced. In your report, please clearly state who did what in this project.</p>\n<h3>Your grade will be affected by the following considerations:</h3>\n<p>\n&nbsp;&nbsp;&nbsp; 1. Performance of your program, on both hard and soft\nmetrics.&nbsp;  Hard metric will be calculated on Kaggle, soft metric will be done after the competition is over by the TAs.<br>\n&nbsp;&nbsp;&nbsp; 2. The extent to which you exhibited understanding of\nstatistical techniques and sound statistical methodology.<br>\n&nbsp;&nbsp;&nbsp; 3. The extent to which you exhibited understanding of the\nproperties of language.<br>\n&nbsp;&nbsp;&nbsp; 4. Creativity and elegance of your solution.</p>\n<h3>What to hand in:</h3>\n<p>\n&nbsp;&nbsp;&nbsp; 1. A tar.gz or zip archive containing your code, ready to run.\n<br>\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;You can develop wherever you wish, but it must compile and run on Andrew's UNIX login servers so the TAs can test your code.<br>\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; The code should be invocable by\nissuing the command <b>./RunMe</b> in that directory (<b>RunMe</b> could be an\nexecutable or a shell script).<br>\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; If your program makes use of any\nfiles, they must reside in that same directory, and be accessed via hard-coded\nfilenames.&nbsp; <br>\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Your program should take its input\n(in the format of <b>developmentSet)</b> from stdin, and write its output to\nstdout. We will run your program with the command: <br>\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ./RunMe < testSet.dat > testOutput.dat <br>\n&nbsp;&nbsp;&nbsp; 2. The performance measures of your program on the\nDevelopment set (both metrics).<br>\n&nbsp;&nbsp;&nbsp; 3. A clear but concise write-up detailing your work,\nincluding all the ideas you tried (even those that didn't work!) and their\nimpact.<br>\n&nbsp;&nbsp;&nbsp; 4. A clear description of what each group member\ncontributed.<br>\n&nbsp;&nbsp;&nbsp; 5. Comments on this assignment and on your experience with\nit, and suggestions for improvements.</p>\n<p>\nPlease name your report pdf file in the form of FirstName_LastName_project_report.pdf and submit it via Canvas. Remember to also submit your code as FirstName_LastName_project_code.zip\n</p>\n<h3>Project presentation:</h3>\n  <p>Project presentation will be on Dec 3rd and Dec 5th. Half of the teams will present on Dec 3rd, and the other half on Dec, the 5th. The date assignment and presentation order will be decided by lottery, and in order not to discriminate, will only be announced on Dec 3rd 11:30 am -- 30 minutes before the first presentation. Each group has exactly 15 minutes for a presentation. There will be Q&A (not included in the 15 minutes). Each team member should have approximately same amount of time to present his/her part of work. You will not be graded individually on your presentation. </p>\n<h3>Code, Report and Presentation Slides:</h3>\n<p>\nPlease prepare the slides for your in-class presentation.  <font color=\"red\"><b>You must submit your code, report and your slides for your in-class presentation by ***Sunday Dec 2nd, 11:59 pm***.</b></font> </p>\n\n<h1> Good luck and have fun! </h1>",
      "isPublished": false,
      "hasIsPublished": false,
      "postTitle": "",
      "hasPostTitle": false,
      "mimeType": "",
      "hasMimeType": false
    }
  ]
}