Estimating box size from the contentsChoosing best methods for estimating the unknown parameters in a linear regression modelEstimating destination according to previous dataEstimating probability using boltzmann machineCan the size of a pooling layer be learned?Estimating expected revenue generationEstimating data set size for grammar extractionClassifier training long time due to the size dataEntropy in a closed boxTraining detector without bounding box dataSize of Output vector from AvgW2V Vectorizer is less than Size of Input data

Mac Pro install disk keeps ejecting itself

Rivers without rain

Document starts having heaps of errors in the middle, but the code doesn't have any problems in it

US visa is under administrative processing, I need the passport back ASAP

What route did the Hindenburg take when traveling from Germany to the U.S.?

Don’t seats that recline flat defeat the purpose of having seatbelts?

Are Boeing 737-800’s grounded?

How to pronounce 'C++' in Spanish

Is there really no use for MD5 anymore?

Phrase for the opposite of "foolproof"

How to stop co-workers from teasing me because I know Russian?

What is the strongest case that can be made in favour of the UK regaining some control over fishing policy after Brexit?

Fizzy, soft, pop and still drinks

How to verbalise code in Mathematica?

Apply MapThread to all but one variable

What's the polite way to say "I need to urinate"?

Why other Westeros houses don't use wildfire?

Noun clause (singular all the time?)

Do I have an "anti-research" personality?

Pass By Reference VS Pass by Value

Why was the Spitfire's elliptical wing almost uncopied by other aircraft of World War 2?

How do I reattach a shelf to the wall when it ripped out of the wall?

What language was spoken in East Asia before Proto-Turkic?

Sci fi novel series with instant travel between planets through gates. A river runs through the gates



Estimating box size from the contents


Choosing best methods for estimating the unknown parameters in a linear regression modelEstimating destination according to previous dataEstimating probability using boltzmann machineCan the size of a pooling layer be learned?Estimating expected revenue generationEstimating data set size for grammar extractionClassifier training long time due to the size dataEntropy in a closed boxTraining detector without bounding box dataSize of Output vector from AvgW2V Vectorizer is less than Size of Input data













0












$begingroup$


I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.



Here's an example of the input data:



box # | contents | box size
----- | --------------------------------- | ---------
1 | a widget, a doodad, and a trinket | 20x12x8
2 | 3 widgets | 12x12x12


However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:



rank | object count | object type
---- | ------------ | -----------
1 | 500,000 | doodad
2 | 350,000 | trinket
3 | 300,000 | widget
--- | snip | ---
50 | 6,000 | whatyoumacallits
--- | snip | ---
300 | 5 | quarts of blinker fluid


Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).



It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.










share|improve this question









$endgroup$
















    0












    $begingroup$


    I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.



    Here's an example of the input data:



    box # | contents | box size
    ----- | --------------------------------- | ---------
    1 | a widget, a doodad, and a trinket | 20x12x8
    2 | 3 widgets | 12x12x12


    However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:



    rank | object count | object type
    ---- | ------------ | -----------
    1 | 500,000 | doodad
    2 | 350,000 | trinket
    3 | 300,000 | widget
    --- | snip | ---
    50 | 6,000 | whatyoumacallits
    --- | snip | ---
    300 | 5 | quarts of blinker fluid


    Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).



    It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.










    share|improve this question









    $endgroup$














      0












      0








      0





      $begingroup$


      I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.



      Here's an example of the input data:



      box # | contents | box size
      ----- | --------------------------------- | ---------
      1 | a widget, a doodad, and a trinket | 20x12x8
      2 | 3 widgets | 12x12x12


      However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:



      rank | object count | object type
      ---- | ------------ | -----------
      1 | 500,000 | doodad
      2 | 350,000 | trinket
      3 | 300,000 | widget
      --- | snip | ---
      50 | 6,000 | whatyoumacallits
      --- | snip | ---
      300 | 5 | quarts of blinker fluid


      Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).



      It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.










      share|improve this question









      $endgroup$




      I'm currently on week 4 of my Coursera course on ML, so I have much to learn about data science. However, I got the opportunity to apply what I've learned at work, and I'd like some guidance. Our company ships random objects to customers in boxes. We'd like to be able to estimate how big boxes will be, given the random objects inside.



      Here's an example of the input data:



      box # | contents | box size
      ----- | --------------------------------- | ---------
      1 | a widget, a doodad, and a trinket | 20x12x8
      2 | 3 widgets | 12x12x12


      However, our list of items has a long tail. I did a count of total items shipped by object type, ordered by count descending. Here's the result:



      rank | object count | object type
      ---- | ------------ | -----------
      1 | 500,000 | doodad
      2 | 350,000 | trinket
      3 | 300,000 | widget
      --- | snip | ---
      50 | 6,000 | whatyoumacallits
      --- | snip | ---
      300 | 5 | quarts of blinker fluid


      Etc. By item number 340, the count is 1, and there are 360 distinct items. I think one way to approach this at first would be to only consider the top 50 items, and try to do a simple polynomial regression with 50 features to estimate L, W, and H (assuming each variable is less than the previous one).



      It won't be 100% accurate, but it will be better than wild guesses. But is there a better way to do this? Any advice is much appreciated.







      machine-learning






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked Mar 8 at 16:14









      SlotharioSlothario

      101




      101




















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          This is known as "3D Bin Packing Problem" in literature.



          https://en.wikipedia.org/wiki/Bin_packing_problem



          Since this is NP-Hard; Some of the approaches are :



          1. Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem

          2. Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930

          3. Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc





          share|improve this answer









          $endgroup$








          • 1




            $begingroup$
            Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
            $endgroup$
            – Slothario
            Mar 8 at 19:09










          • $begingroup$
            Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
            $endgroup$
            – Slothario
            Mar 8 at 19:12












          Your Answer








          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "557"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f46946%2festimating-box-size-from-the-contents%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          0












          $begingroup$

          This is known as "3D Bin Packing Problem" in literature.



          https://en.wikipedia.org/wiki/Bin_packing_problem



          Since this is NP-Hard; Some of the approaches are :



          1. Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem

          2. Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930

          3. Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc





          share|improve this answer









          $endgroup$








          • 1




            $begingroup$
            Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
            $endgroup$
            – Slothario
            Mar 8 at 19:09










          • $begingroup$
            Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
            $endgroup$
            – Slothario
            Mar 8 at 19:12
















          0












          $begingroup$

          This is known as "3D Bin Packing Problem" in literature.



          https://en.wikipedia.org/wiki/Bin_packing_problem



          Since this is NP-Hard; Some of the approaches are :



          1. Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem

          2. Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930

          3. Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc





          share|improve this answer









          $endgroup$








          • 1




            $begingroup$
            Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
            $endgroup$
            – Slothario
            Mar 8 at 19:09










          • $begingroup$
            Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
            $endgroup$
            – Slothario
            Mar 8 at 19:12














          0












          0








          0





          $begingroup$

          This is known as "3D Bin Packing Problem" in literature.



          https://en.wikipedia.org/wiki/Bin_packing_problem



          Since this is NP-Hard; Some of the approaches are :



          1. Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem

          2. Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930

          3. Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc





          share|improve this answer









          $endgroup$



          This is known as "3D Bin Packing Problem" in literature.



          https://en.wikipedia.org/wiki/Bin_packing_problem



          Since this is NP-Hard; Some of the approaches are :



          1. Heuristics : https://www.researchgate.net/publication/226249396_A_New_Heuristic_Algorithm_for_the_3D_Bin_Packing_Problem

          2. Deep Reinforcement Learning : https://arxiv.org/abs/1708.05930

          3. Ensemble : https://medium.com/@alitech_2017/alibabas-ai-solution-for-the-3d-bin-packing-problem-3ce66d730ecc






          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered Mar 8 at 18:43









          Shamit VermaShamit Verma

          1,6891414




          1,6891414







          • 1




            $begingroup$
            Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
            $endgroup$
            – Slothario
            Mar 8 at 19:09










          • $begingroup$
            Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
            $endgroup$
            – Slothario
            Mar 8 at 19:12













          • 1




            $begingroup$
            Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
            $endgroup$
            – Slothario
            Mar 8 at 19:09










          • $begingroup$
            Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
            $endgroup$
            – Slothario
            Mar 8 at 19:12








          1




          1




          $begingroup$
          Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
          $endgroup$
          – Slothario
          Mar 8 at 19:09




          $begingroup$
          Well, we aren't trying to find the optimal way to pack bins. We're asking, if a human packs a number of items into a bin, what will be the size of the bin based on past data? The past data of course is messy, too, and we don't always have reliable data on object size. It would be ideal to say "In the past, we've had three widgets and two trinkets, and the box size is typically LxWxH." Although this is a useful approach to the problem I'll consider.
          $endgroup$
          – Slothario
          Mar 8 at 19:09












          $begingroup$
          Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
          $endgroup$
          – Slothario
          Mar 8 at 19:12





          $begingroup$
          Actually, come to think of it, I believe a useful approach would be to run a bin packing algorithm on the input data but make it configurable by a few parameters (like padding, alternate placements, etc). And then I could create a cost function that I would try to minimize so that my bin packing algorithm matches the data available as closely as possible. Is that kind of what you're suggesting?
          $endgroup$
          – Slothario
          Mar 8 at 19:12


















          draft saved

          draft discarded
















































          Thanks for contributing an answer to Data Science Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f46946%2festimating-box-size-from-the-contents%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Adding axes to figuresAdding axes labels to LaTeX figuresLaTeX equivalent of ConTeXt buffersRotate a node but not its content: the case of the ellipse decorationHow to define the default vertical distance between nodes?TikZ scaling graphic and adjust node position and keep font sizeNumerical conditional within tikz keys?adding axes to shapesAlign axes across subfiguresAdding figures with a certain orderLine up nested tikz enviroments or how to get rid of themAdding axes labels to LaTeX figures

          Luettelo Yhdysvaltain laivaston lentotukialuksista Lähteet | Navigointivalikko

          Gary (muusikko) Sisällysluettelo Historia | Rockin' High | Lähteet | Aiheesta muualla | NavigointivalikkoInfobox OKTuomas "Gary" Keskinen Ancaran kitaristiksiProjekti Rockin' High