{
  "id": 24138,
  "title": "my failure report",
  "url": "/competitions/bosch-production-line-performance/discussion/24138",
  "author_name": "",
  "post_date": "2016-10-06T11:15:51.037Z",
  "votes": 6,
  "comment_count": 7,
  "views": 1302,
  "content": "<p>Hello.\nThis is what I tried. But  I didn't get a good grade(~0.25). What I would have missed.\nAlso, I hope this could help you.</p>\n\n<p>-- Numeric Data--</p>\n\n<ul>\n<li>Fourier transform,</li>\n<li>ftrl,  </li>\n<li>logistic regression, </li>\n<li>nearest neighbor, </li>\n<li>SVM,</li>\n<li>count number of NA    (each station), </li>\n<li>count    Negative/positive value  (each station),  </li>\n<li>difference, </li>\n<li>min/max/avg/SD (each station)</li>\n<li>cumulative sum\n....</li>\n</ul>\n\n<p>--Date Data--</p>\n\n<ul>\n<li>working hours  (max_value - min_value), </li>\n<li>standardization,</li>\n<li>difference\n...</li>\n</ul>\n\n<p>--Categorical Data--</p>\n\n<ul>\n<li>sparse matrix </li>\n</ul>\n\n<p>, pointing out my mistakes, thank you.</p>",
  "messages": [
    {
      "id": "137974",
      "postDate": "10/06/2016 11:15:51",
      "content": "<p>Hello.\nThis is what I tried. But  I didn't get a good grade(~0.25). What I would have missed.\nAlso, I hope this could help you.</p>\n\n<p>-- Numeric Data--</p>\n\n<ul>\n<li>Fourier transform,</li>\n<li>ftrl,  </li>\n<li>logistic regression, </li>\n<li>nearest neighbor, </li>\n<li>SVM,</li>\n<li>count number of NA    (each station), </li>\n<li>count    Negative/positive value  (each station),  </li>\n<li>difference, </li>\n<li>min/max/avg/SD (each station)</li>\n<li>cumulative sum\n....</li>\n</ul>\n\n<p>--Date Data--</p>\n\n<ul>\n<li>working hours  (max_value - min_value), </li>\n<li>standardization,</li>\n<li>difference\n...</li>\n</ul>\n\n<p>--Categorical Data--</p>\n\n<ul>\n<li>sparse matrix </li>\n</ul>\n\n<p>, pointing out my mistakes, thank you.</p>",
      "rawMarkdown": "Hello.\r\nThis is what I tried. But  I didn't get a good grade(~0.25). What I would have missed.\r\nAlso, I hope this could help you.\r\n\r\n-- Numeric Data--\r\n\r\n - Fourier transform,\r\n - ftrl,  \r\n - logistic regression, \r\n - nearest neighbor, \r\n - SVM,\r\n -  count number of NA    (each station), \r\n - count    Negative/positive value  (each station),  \r\n - difference, \r\n -  min/max/avg/SD (each station)\r\n - cumulative sum\r\n....\r\n\r\n\r\n\r\n--Date Data--\r\n\r\n - working hours  (max_value - min_value), \r\n - standardization,\r\n - difference\r\n...\r\n\r\n\r\n--Categorical Data--\r\n\r\n - sparse matrix \r\n\r\n\r\n, pointing out my mistakes, thank you.",
      "votes": null
    },
    {
      "id": "137988",
      "postDate": "10/06/2016 13:50:45",
      "content": "<p>A very prominent absence from your features are error rate features. Since train and test data sets overlap, you can determine the failure rate (e.g. on a machine level) for different time intervals and use these as features.</p>",
      "rawMarkdown": "A very prominent absence from your features are error rate features. Since train and test data sets overlap, you can determine the failure rate (e.g. on a machine level) for different time intervals and use these as features.",
      "votes": null
    },
    {
      "id": "138000",
      "postDate": "10/06/2016 14:32:09",
      "content": "<p>I am also in similar condition. Max CV score that I am able to attain is 0.252243. <br>\nThe features that I tried are -        </p>\n\n<p>--Numeric File-- <br>\n1.  Number of Non-NAN entries in each Id. <br>\n2.  Number of Non-NAN entries in each Id per stationwise &amp; linewise. <br>\n3.  Sum of Numeric features per stationwise &amp; linewise for each Id.       </p>\n\n<p>--Date File--   </p>\n\n<p>As was shown by beluga in his &quot;Date Exploration&quot; Kernel that 0.01 = 6 min. I ordered the date file in ascending order as per station S3 since it has least NaNs (This I did so that my data would be arranged in ascending time order. So that I can find any pattern, if there is any between Time &amp; Ids. I am assuming that Bosch has anonymized the earliest date in the data as 0). Then I calculated - <br>\n1. Min_Time &amp; Max_Time for each Id. <br>\n2. Time_Difference (Max_Time - Min_Time) for each Id. <br>\n3.  Since 0.01= 6 min. This gives 1 hr = 0.1, 1 day = 2.39, 1 week = 16.75, 1 month = 71.7, 1 year = 872.35. <br>\nFrom this I created year feature, week feature, day of week feature, hour feature. Day of week &amp; hour feature were furthur divided into Start_Day, End_Day &amp; Start_Hour, End_Hour respectively.        </p>\n\n<p>Apart from above features, I am also thinking of creating some more features mentioned below -         </p>\n\n<ol>\n<li>If product passes through S32 then 1 else 0. Similarly if it passes through S32 but not S34 then 1 else 0,  and S32 but not S33 then 1 else 0.        </li>\n<li>Grouping Ids on the basis of time. Since train &amp; test set both shares same time period. So if there is a faulty product made at a particular time, then there is a fair chance that the products manufactured near the same timeline will be faulty.             </li>\n</ol>",
      "rawMarkdown": "I am also in similar condition. Max CV score that I am able to attain is 0.252243.          \r\nThe features that I tried are -        \r\n  \r\n--Numeric File--        \r\n1.  Number of Non-NAN entries in each Id.                   \r\n2.  Number of Non-NAN entries in each Id per stationwise & linewise.       \r\n3.  Sum of Numeric features per stationwise & linewise for each Id.       \r\n\r\n--Date File--   \r\n\r\nAs was shown by beluga in his \"Date Exploration\" Kernel that 0.01 = 6 min. I ordered the date file in ascending order as per station S3 since it has least NaNs (This I did so that my data would be arranged in ascending time order. So that I can find any pattern, if there is any between Time & Ids. I am assuming that Bosch has anonymized the earliest date in the data as 0). Then I calculated -      \r\n1. Min_Time & Max_Time for each Id.        \r\n2. Time_Difference (Max_Time - Min_Time) for each Id.       \r\n3.  Since 0.01= 6 min. This gives 1 hr = 0.1, 1 day = 2.39, 1 week = 16.75, 1 month = 71.7, 1 year = 872.35.    \r\nFrom this I created year feature, week feature, day of week feature, hour feature. Day of week & hour feature were furthur divided into Start_Day, End_Day & Start_Hour, End_Hour respectively.        \r\n\r\nApart from above features, I am also thinking of creating some more features mentioned below -         \r\n   \r\n1.  If product passes through S32 then 1 else 0. Similarly if it passes through S32 but not S34 then 1 else 0,  and S32 but not S33 then 1 else 0.        \r\n2. Grouping Ids on the basis of time. Since train & test set both shares same time period. So if there is a faulty product made at a particular time, then there is a fair chance that the products manufactured near the same timeline will be faulty.",
      "votes": null
    },
    {
      "id": "138103",
      "postDate": "10/07/2016 07:59:42",
      "content": "<p>@Abhilash Awasthi </p>\n\n<p>oh, I also tried it.  As mentioned by @gingerman, it is  very prominent absence. \nThat's because we typically begin at the wrong starting point.</p>\n\n<hr>\n\n<p>I spend lot of time, and i tried various method. But i faced false starts and mistakes.</p>\n\n<p>What&#8217;s the best way to analysis data and feature engineering?</p>\n\n<p>I am desperate for any suggestion kaggler can offer. </p>\n\n<p>Thanks.</p>",
      "rawMarkdown": "Abhilash Awasthi \r\n\r\noh, I also tried it.  As mentioned by @gingerman, it is  very prominent absence. \r\nThat's because we typically begin at the wrong starting point.\r\n\r\n----------\r\n\r\nI spend lot of time, and i tried various method. But i faced false starts and mistakes.\r\n\r\nWhat’s the best way to analysis data and feature engineering?\r\n\r\nI am desperate for any suggestion kaggler can offer. \r\n\r\nThanks.",
      "votes": null
    },
    {
      "id": "138126",
      "postDate": "10/07/2016 10:02:41",
      "content": "<p>I cannot call myself a seasoned Kaggler but this was my first competiton that I tried to actively compete in over a longer time. This was in part because of the unavailibility of running strong scripts directly from the platform which constantly through me back and frustrated me in other competitions. Still, it has been a challenging trip - the first weeks I have made millions of silly mistakes like wrong merge keys, putting to many features into the model at the same time, etc. But my biggest mistake has initially been thinking to much about tuning xgboost, playing around with the MCC rounding rule (most of my submissions are identical data with different roundings) and simply not realizing that it is just not that simple.</p>\n\n<p>Taking a step back, thinking a little I started combining the data sets especially taking into account temporal structure and the manufacturing perspective of paths through the factory. It was this thinking plus the upcoming discussion on the magical feature which made me look harder and being more successful in implementing structurally better solutions than incremental, minimal improvements due to fine-tuning of the ML-algorithm. Essentially, the latter I take it can be done in the last week, together with ensembling, stacking etc. Before you even start thinking about it one should construct simple models with strong meta-features. And to this end, this competition offers a host of opportunities. What I found especially appealing was the fact that for once one could easily understand the underlying reality despite the anonymization of the data. See for example my attempt at plotting the shopfloor: <a href=\"https://www.kaggle.com/gingerman/bosch-production-line-performance/shopfloor-visualization\">https://www.kaggle.com/gingerman/bosch-production-line-performance/shopfloor-visualization</a></p>",
      "rawMarkdown": "I cannot call myself a seasoned Kaggler but this was my first competiton that I tried to actively compete in over a longer time. This was in part because of the unavailibility of running strong scripts directly from the platform which constantly through me back and frustrated me in other competitions. Still, it has been a challenging trip - the first weeks I have made millions of silly mistakes like wrong merge keys, putting to many features into the model at the same time, etc. But my biggest mistake has initially been thinking to much about tuning xgboost, playing around with the MCC rounding rule (most of my submissions are identical data with different roundings) and simply not realizing that it is just not that simple.\r\n\r\nTaking a step back, thinking a little I started combining the data sets especially taking into account temporal structure and the manufacturing perspective of paths through the factory. It was this thinking plus the upcoming discussion on the magical feature which made me look harder and being more successful in implementing structurally better solutions than incremental, minimal improvements due to fine-tuning of the ML-algorithm. Essentially, the latter I take it can be done in the last week, together with ensembling, stacking etc. Before you even start thinking about it one should construct simple models with strong meta-features. And to this end, this competition offers a host of opportunities. What I found especially appealing was the fact that for once one could easily understand the underlying reality despite the anonymization of the data. See for example my attempt at plotting the shopfloor: https://www.kaggle.com/gingerman/bosch-production-line-performance/shopfloor-visualization",
      "votes": null
    },
    {
      "id": "138197",
      "postDate": "10/07/2016 16:08:09",
      "content": "<p>@gingerman. Thank you very much. </p>\n\n<p>Somethimes, Many people lose time tuning ML-algorithm, like me.\nHowever, 'Looking Data' is always the most important thing.\nGet back to basics and see if there is any way I can improve my prediction.</p>",
      "rawMarkdown": "gingerman. Thank you very much. \r\n\r\nSomethimes, Many people lose time tuning ML-algorithm, like me.\r\nHowever, 'Looking Data' is always the most important thing.\r\nGet back to basics and see if there is any way I can improve my prediction.",
      "votes": null
    },
    {
      "id": "138594",
      "postDate": "10/09/2016 17:26:28",
      "content": "<p>Noob question. How do you use fourier transform and turn it into a feature? I thought about this for a long time but i cant seem to make sense of it</p>",
      "rawMarkdown": "Noob question. How do you use fourier transform and turn it into a feature? I thought about this for a long time but i cant seem to make sense of it",
      "votes": null
    },
    {
      "id": "480131",
      "postDate": "02/27/2019 20:15:20",
      "content": "<p>Hey did you find the answer? If, yes please share it.. It will be helpful for me</p>",
      "rawMarkdown": "Hey did you find the answer? If, yes please share it.. It will be helpful for me",
      "votes": null
    }
  ],
  "comments": [
    {
      "id": 137988,
      "author_name": "gingerman",
      "author_url": "",
      "post_date": "10/06/2016 13:50:45",
      "content": "<p>A very prominent absence from your features are error rate features. Since train and test data sets overlap, you can determine the failure rate (e.g. on a machine level) for different time intervals and use these as features.</p>",
      "votes": null,
      "replies": []
    },
    {
      "id": 138000,
      "author_name": "abhilashawasthi",
      "author_url": "",
      "post_date": "10/06/2016 14:32:09",
      "content": "<p>I am also in similar condition. Max CV score that I am able to attain is 0.252243. <br>\nThe features that I tried are -        </p>\n\n<p>--Numeric File-- <br>\n1.  Number of Non-NAN entries in each Id. <br>\n2.  Number of Non-NAN entries in each Id per stationwise &amp; linewise. <br>\n3.  Sum of Numeric features per stationwise &amp; linewise for each Id.       </p>\n\n<p>--Date File--   </p>\n\n<p>As was shown by beluga in his &quot;Date Exploration&quot; Kernel that 0.01 = 6 min. I ordered the date file in ascending order as per station S3 since it has least NaNs (This I did so that my data would be arranged in ascending time order. So that I can find any pattern, if there is any between Time &amp; Ids. I am assuming that Bosch has anonymized the earliest date in the data as 0). Then I calculated - <br>\n1. Min_Time &amp; Max_Time for each Id. <br>\n2. Time_Difference (Max_Time - Min_Time) for each Id. <br>\n3.  Since 0.01= 6 min. This gives 1 hr = 0.1, 1 day = 2.39, 1 week = 16.75, 1 month = 71.7, 1 year = 872.35. <br>\nFrom this I created year feature, week feature, day of week feature, hour feature. Day of week &amp; hour feature were furthur divided into Start_Day, End_Day &amp; Start_Hour, End_Hour respectively.        </p>\n\n<p>Apart from above features, I am also thinking of creating some more features mentioned below -         </p>\n\n<ol>\n<li>If product passes through S32 then 1 else 0. Similarly if it passes through S32 but not S34 then 1 else 0,  and S32 but not S33 then 1 else 0.        </li>\n<li>Grouping Ids on the basis of time. Since train &amp; test set both shares same time period. So if there is a faulty product made at a particular time, then there is a fair chance that the products manufactured near the same timeline will be faulty.             </li>\n</ol>",
      "votes": null,
      "replies": []
    },
    {
      "id": 138103,
      "author_name": "niks2000",
      "author_url": "",
      "post_date": "10/07/2016 07:59:42",
      "content": "<p>@Abhilash Awasthi </p>\n\n<p>oh, I also tried it.  As mentioned by @gingerman, it is  very prominent absence. \nThat's because we typically begin at the wrong starting point.</p>\n\n<hr>\n\n<p>I spend lot of time, and i tried various method. But i faced false starts and mistakes.</p>\n\n<p>What&#8217;s the best way to analysis data and feature engineering?</p>\n\n<p>I am desperate for any suggestion kaggler can offer. </p>\n\n<p>Thanks.</p>",
      "votes": null,
      "replies": []
    },
    {
      "id": 138126,
      "author_name": "gingerman",
      "author_url": "",
      "post_date": "10/07/2016 10:02:41",
      "content": "<p>I cannot call myself a seasoned Kaggler but this was my first competiton that I tried to actively compete in over a longer time. This was in part because of the unavailibility of running strong scripts directly from the platform which constantly through me back and frustrated me in other competitions. Still, it has been a challenging trip - the first weeks I have made millions of silly mistakes like wrong merge keys, putting to many features into the model at the same time, etc. But my biggest mistake has initially been thinking to much about tuning xgboost, playing around with the MCC rounding rule (most of my submissions are identical data with different roundings) and simply not realizing that it is just not that simple.</p>\n\n<p>Taking a step back, thinking a little I started combining the data sets especially taking into account temporal structure and the manufacturing perspective of paths through the factory. It was this thinking plus the upcoming discussion on the magical feature which made me look harder and being more successful in implementing structurally better solutions than incremental, minimal improvements due to fine-tuning of the ML-algorithm. Essentially, the latter I take it can be done in the last week, together with ensembling, stacking etc. Before you even start thinking about it one should construct simple models with strong meta-features. And to this end, this competition offers a host of opportunities. What I found especially appealing was the fact that for once one could easily understand the underlying reality despite the anonymization of the data. See for example my attempt at plotting the shopfloor: <a href=\"https://www.kaggle.com/gingerman/bosch-production-line-performance/shopfloor-visualization\">https://www.kaggle.com/gingerman/bosch-production-line-performance/shopfloor-visualization</a></p>",
      "votes": null,
      "replies": []
    },
    {
      "id": 138197,
      "author_name": "niks2000",
      "author_url": "",
      "post_date": "10/07/2016 16:08:09",
      "content": "<p>@gingerman. Thank you very much. </p>\n\n<p>Somethimes, Many people lose time tuning ML-algorithm, like me.\nHowever, 'Looking Data' is always the most important thing.\nGet back to basics and see if there is any way I can improve my prediction.</p>",
      "votes": null,
      "replies": []
    },
    {
      "id": 138594,
      "author_name": "abriosi",
      "author_url": "",
      "post_date": "10/09/2016 17:26:28",
      "content": "<p>Noob question. How do you use fourier transform and turn it into a feature? I thought about this for a long time but i cant seem to make sense of it</p>",
      "votes": null,
      "replies": [
        {
          "id": 480131,
          "author_name": "karthikmgk",
          "author_url": "",
          "post_date": "02/27/2019 20:15:20",
          "content": "<p>Hey did you find the answer? If, yes please share it.. It will be helpful for me</p>",
          "votes": null,
          "replies": []
        }
      ]
    }
  ],
  "raw_markdown_by_id": {
    "137974": "Hello.\r\nThis is what I tried. But  I didn't get a good grade(~0.25). What I would have missed.\r\nAlso, I hope this could help you.\r\n\r\n-- Numeric Data--\r\n\r\n - Fourier transform,\r\n - ftrl,  \r\n - logistic regression, \r\n - nearest neighbor, \r\n - SVM,\r\n -  count number of NA    (each station), \r\n - count    Negative/positive value  (each station),  \r\n - difference, \r\n -  min/max/avg/SD (each station)\r\n - cumulative sum\r\n....\r\n\r\n\r\n\r\n--Date Data--\r\n\r\n - working hours  (max_value - min_value), \r\n - standardization,\r\n - difference\r\n...\r\n\r\n\r\n--Categorical Data--\r\n\r\n - sparse matrix \r\n\r\n\r\n, pointing out my mistakes, thank you.",
    "137988": "A very prominent absence from your features are error rate features. Since train and test data sets overlap, you can determine the failure rate (e.g. on a machine level) for different time intervals and use these as features.",
    "138000": "I am also in similar condition. Max CV score that I am able to attain is 0.252243.          \r\nThe features that I tried are -        \r\n  \r\n--Numeric File--        \r\n1.  Number of Non-NAN entries in each Id.                   \r\n2.  Number of Non-NAN entries in each Id per stationwise & linewise.       \r\n3.  Sum of Numeric features per stationwise & linewise for each Id.       \r\n\r\n--Date File--   \r\n\r\nAs was shown by beluga in his \"Date Exploration\" Kernel that 0.01 = 6 min. I ordered the date file in ascending order as per station S3 since it has least NaNs (This I did so that my data would be arranged in ascending time order. So that I can find any pattern, if there is any between Time & Ids. I am assuming that Bosch has anonymized the earliest date in the data as 0). Then I calculated -      \r\n1. Min_Time & Max_Time for each Id.        \r\n2. Time_Difference (Max_Time - Min_Time) for each Id.       \r\n3.  Since 0.01= 6 min. This gives 1 hr = 0.1, 1 day = 2.39, 1 week = 16.75, 1 month = 71.7, 1 year = 872.35.    \r\nFrom this I created year feature, week feature, day of week feature, hour feature. Day of week & hour feature were furthur divided into Start_Day, End_Day & Start_Hour, End_Hour respectively.        \r\n\r\nApart from above features, I am also thinking of creating some more features mentioned below -         \r\n   \r\n1.  If product passes through S32 then 1 else 0. Similarly if it passes through S32 but not S34 then 1 else 0,  and S32 but not S33 then 1 else 0.        \r\n2. Grouping Ids on the basis of time. Since train & test set both shares same time period. So if there is a faulty product made at a particular time, then there is a fair chance that the products manufactured near the same timeline will be faulty.",
    "138103": "Abhilash Awasthi \r\n\r\noh, I also tried it.  As mentioned by @gingerman, it is  very prominent absence. \r\nThat's because we typically begin at the wrong starting point.\r\n\r\n----------\r\n\r\nI spend lot of time, and i tried various method. But i faced false starts and mistakes.\r\n\r\nWhat’s the best way to analysis data and feature engineering?\r\n\r\nI am desperate for any suggestion kaggler can offer. \r\n\r\nThanks.",
    "138126": "I cannot call myself a seasoned Kaggler but this was my first competiton that I tried to actively compete in over a longer time. This was in part because of the unavailibility of running strong scripts directly from the platform which constantly through me back and frustrated me in other competitions. Still, it has been a challenging trip - the first weeks I have made millions of silly mistakes like wrong merge keys, putting to many features into the model at the same time, etc. But my biggest mistake has initially been thinking to much about tuning xgboost, playing around with the MCC rounding rule (most of my submissions are identical data with different roundings) and simply not realizing that it is just not that simple.\r\n\r\nTaking a step back, thinking a little I started combining the data sets especially taking into account temporal structure and the manufacturing perspective of paths through the factory. It was this thinking plus the upcoming discussion on the magical feature which made me look harder and being more successful in implementing structurally better solutions than incremental, minimal improvements due to fine-tuning of the ML-algorithm. Essentially, the latter I take it can be done in the last week, together with ensembling, stacking etc. Before you even start thinking about it one should construct simple models with strong meta-features. And to this end, this competition offers a host of opportunities. What I found especially appealing was the fact that for once one could easily understand the underlying reality despite the anonymization of the data. See for example my attempt at plotting the shopfloor: https://www.kaggle.com/gingerman/bosch-production-line-performance/shopfloor-visualization",
    "138197": "gingerman. Thank you very much. \r\n\r\nSomethimes, Many people lose time tuning ML-algorithm, like me.\r\nHowever, 'Looking Data' is always the most important thing.\r\nGet back to basics and see if there is any way I can improve my prediction.",
    "138594": "Noob question. How do you use fourier transform and turn it into a feature? I thought about this for a long time but i cant seem to make sense of it",
    "480131": "Hey did you find the answer? If, yes please share it.. It will be helpful for me"
  },
  "source": "meta"
}