map list to bin numbers












1












$begingroup$


Does WL have the equivalent of Matlab's discretize or NumPy's digitize? I.e., a function that takes a length-N list and a list of bin edges and returns a length-N list of bin numbers, mapping each list item to its bin number?






list-manipulation data







share|improve this question











$endgroup$












  • $begingroup$
    HistogramList seems similar. This could also be done efficiently with GroupBy and some easy little Compile-d selection determiner. Or maybe hit it first with Sort then write something that only checks the next bin up. Again, can be easily Compile-d.
    $endgroup$
    – b3m2a1
    6 hours ago












  • $begingroup$
    I need it to work like a map (in terms of the order of the items in the resulting list). Of course it is possible to write something ...
    $endgroup$
    – Alan
    5 hours ago












  • $begingroup$
    Related: 140577
    $endgroup$
    – Carl Woll
    1 hour ago












  • $begingroup$
    Did you try BinCounts? I guess it is what you need.
    $endgroup$
    – Rom38
    24 mins ago
















1












$begingroup$


Does WL have the equivalent of Matlab's discretize or NumPy's digitize? I.e., a function that takes a length-N list and a list of bin edges and returns a length-N list of bin numbers, mapping each list item to its bin number?






list-manipulation data







share|improve this question











$endgroup$












  • $begingroup$
    HistogramList seems similar. This could also be done efficiently with GroupBy and some easy little Compile-d selection determiner. Or maybe hit it first with Sort then write something that only checks the next bin up. Again, can be easily Compile-d.
    $endgroup$
    – b3m2a1
    6 hours ago












  • $begingroup$
    I need it to work like a map (in terms of the order of the items in the resulting list). Of course it is possible to write something ...
    $endgroup$
    – Alan
    5 hours ago












  • $begingroup$
    Related: 140577
    $endgroup$
    – Carl Woll
    1 hour ago












  • $begingroup$
    Did you try BinCounts? I guess it is what you need.
    $endgroup$
    – Rom38
    24 mins ago














1












1








1





$begingroup$


Does WL have the equivalent of Matlab's discretize or NumPy's digitize? I.e., a function that takes a length-N list and a list of bin edges and returns a length-N list of bin numbers, mapping each list item to its bin number?






list-manipulation data







share|improve this question











$endgroup$




Does WL have the equivalent of Matlab's discretize or NumPy's digitize? I.e., a function that takes a length-N list and a list of bin edges and returns a length-N list of bin numbers, mapping each list item to its bin number?






list-manipulation data




list-manipulation data






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 1 hour ago









Carl Woll

73k396189




73k396189










asked 6 hours ago









AlanAlan

6,6331125




6,6331125












  • $begingroup$
    HistogramList seems similar. This could also be done efficiently with GroupBy and some easy little Compile-d selection determiner. Or maybe hit it first with Sort then write something that only checks the next bin up. Again, can be easily Compile-d.
    $endgroup$
    – b3m2a1
    6 hours ago












  • $begingroup$
    I need it to work like a map (in terms of the order of the items in the resulting list). Of course it is possible to write something ...
    $endgroup$
    – Alan
    5 hours ago












  • $begingroup$
    Related: 140577
    $endgroup$
    – Carl Woll
    1 hour ago












  • $begingroup$
    Did you try BinCounts? I guess it is what you need.
    $endgroup$
    – Rom38
    24 mins ago


















  • $begingroup$
    HistogramList seems similar. This could also be done efficiently with GroupBy and some easy little Compile-d selection determiner. Or maybe hit it first with Sort then write something that only checks the next bin up. Again, can be easily Compile-d.
    $endgroup$
    – b3m2a1
    6 hours ago












  • $begingroup$
    I need it to work like a map (in terms of the order of the items in the resulting list). Of course it is possible to write something ...
    $endgroup$
    – Alan
    5 hours ago












  • $begingroup$
    Related: 140577
    $endgroup$
    – Carl Woll
    1 hour ago












  • $begingroup$
    Did you try BinCounts? I guess it is what you need.
    $endgroup$
    – Rom38
    24 mins ago
















$begingroup$
HistogramList seems similar. This could also be done efficiently with GroupBy and some easy little Compile-d selection determiner. Or maybe hit it first with Sort then write something that only checks the next bin up. Again, can be easily Compile-d.
$endgroup$
– b3m2a1
6 hours ago






$begingroup$
HistogramList seems similar. This could also be done efficiently with GroupBy and some easy little Compile-d selection determiner. Or maybe hit it first with Sort then write something that only checks the next bin up. Again, can be easily Compile-d.
$endgroup$
– b3m2a1
6 hours ago














$begingroup$
I need it to work like a map (in terms of the order of the items in the resulting list). Of course it is possible to write something ...
$endgroup$
– Alan
5 hours ago






$begingroup$
I need it to work like a map (in terms of the order of the items in the resulting list). Of course it is possible to write something ...
$endgroup$
– Alan
5 hours ago














$begingroup$
Related: 140577
$endgroup$
– Carl Woll
1 hour ago






$begingroup$
Related: 140577
$endgroup$
– Carl Woll
1 hour ago














$begingroup$
Did you try BinCounts? I guess it is what you need.
$endgroup$
– Rom38
24 mins ago




$begingroup$
Did you try BinCounts? I guess it is what you need.
$endgroup$
– Rom38
24 mins ago










2 Answers
2






active

oldest

votes


















4












$begingroup$

This is a very quick-n-dirty, but may serve as a simple example.



This creates a piecewise function following the first definition in Matlab's discretize documentation, then applies that to the data.



disc[data_, edges_] := Module[{e = Partition[edges, 2, 1], p, l},

   l = Length@e;

   Table[Piecewise[

                   Append[Table[{i, e[[i, 1]] <= x < e[[i, 2]]}, {i, l - 1}]

                          , {l,e[[l, 1]] <= x <= e[[l, 2]]}]

                   , "NaN"]

          , {x, data}]];


From the first example in the above referenced documentation:



data={1, 1, 2, 3, 6, 5, 8, 10, 4, 4};

edges={2, 4, 6, 8, 10};



disc[data,edges]



{NaN,NaN,1,1,3,2,4,4,2,2}




I'm sure there are more efficient/elegant solutions, and will revisit as time permits.






share|improve this answer









$endgroup$





















    0












    $begingroup$

    Here's a version based on Nearest:



    digitize[edges_] := DigitizeFunction[edges, Nearest[edges -> "Index"]]
    
digitize[data_, edges_] := digitize[edges][data]
    

    
DigitizeFunction[edges_, nf_NearestFunction][data_] := With[{init = nf[data][[All, 1]]},
    
    init + UnitStep[data - edges[[init]]] - 1
    
]


    For example:



    SeedRandom[1]
    
data = RandomReal[10, 10]
    
digitize[data, {2, 4, 5, 7, 8}]



    {8.17389, 1.1142, 7.89526, 1.87803, 2.41361, 0.657388, 5.42247, 2.31155, 3.96006, 7.00474}



    {5, 0, 4, 0, 1, 0, 3, 1, 1, 4}




    Note that I broke up the definition of digitize into two pieces, so that if you do this for multiple data sets with the same edges list, you only need to compute the nearest function once.






    share|improve this answer











    $endgroup$














      Your Answer





      StackExchange.ifUsing("editor", function () {
      return StackExchange.using("mathjaxEditing", function () {
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      });
      });
      }, "mathjax-editing");

      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "387"
      };
      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%2fmathematica.stackexchange.com%2fquestions%2f194844%2fmap-list-to-bin-numbers%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      4












      $begingroup$

      This is a very quick-n-dirty, but may serve as a simple example.



      This creates a piecewise function following the first definition in Matlab's discretize documentation, then applies that to the data.



      disc[data_, edges_] := Module[{e = Partition[edges, 2, 1], p, l},
      
   l = Length@e;
      
   Table[Piecewise[
      
                   Append[Table[{i, e[[i, 1]] <= x < e[[i, 2]]}, {i, l - 1}]
      
                          , {l,e[[l, 1]] <= x <= e[[l, 2]]}]
      
                   , "NaN"]
      
          , {x, data}]];


      From the first example in the above referenced documentation:



      data={1, 1, 2, 3, 6, 5, 8, 10, 4, 4};
      
edges={2, 4, 6, 8, 10};
      

      
disc[data,edges]



      {NaN,NaN,1,1,3,2,4,4,2,2}




      I'm sure there are more efficient/elegant solutions, and will revisit as time permits.






      share|improve this answer









      $endgroup$


















        4












        $begingroup$

        This is a very quick-n-dirty, but may serve as a simple example.



        This creates a piecewise function following the first definition in Matlab's discretize documentation, then applies that to the data.



        disc[data_, edges_] := Module[{e = Partition[edges, 2, 1], p, l},
        
   l = Length@e;
        
   Table[Piecewise[
        
                   Append[Table[{i, e[[i, 1]] <= x < e[[i, 2]]}, {i, l - 1}]
        
                          , {l,e[[l, 1]] <= x <= e[[l, 2]]}]
        
                   , "NaN"]
        
          , {x, data}]];


        From the first example in the above referenced documentation:



        data={1, 1, 2, 3, 6, 5, 8, 10, 4, 4};
        
edges={2, 4, 6, 8, 10};
        

        
disc[data,edges]



        {NaN,NaN,1,1,3,2,4,4,2,2}




        I'm sure there are more efficient/elegant solutions, and will revisit as time permits.






        share|improve this answer









        $endgroup$
















          4












          4








          4





          $begingroup$

          This is a very quick-n-dirty, but may serve as a simple example.



          This creates a piecewise function following the first definition in Matlab's discretize documentation, then applies that to the data.



          disc[data_, edges_] := Module[{e = Partition[edges, 2, 1], p, l},
          
   l = Length@e;
          
   Table[Piecewise[
          
                   Append[Table[{i, e[[i, 1]] <= x < e[[i, 2]]}, {i, l - 1}]
          
                          , {l,e[[l, 1]] <= x <= e[[l, 2]]}]
          
                   , "NaN"]
          
          , {x, data}]];


          From the first example in the above referenced documentation:



          data={1, 1, 2, 3, 6, 5, 8, 10, 4, 4};
          
edges={2, 4, 6, 8, 10};
          

          
disc[data,edges]



          {NaN,NaN,1,1,3,2,4,4,2,2}




          I'm sure there are more efficient/elegant solutions, and will revisit as time permits.






          share|improve this answer









          $endgroup$



          This is a very quick-n-dirty, but may serve as a simple example.



          This creates a piecewise function following the first definition in Matlab's discretize documentation, then applies that to the data.



          disc[data_, edges_] := Module[{e = Partition[edges, 2, 1], p, l},
          
   l = Length@e;
          
   Table[Piecewise[
          
                   Append[Table[{i, e[[i, 1]] <= x < e[[i, 2]]}, {i, l - 1}]
          
                          , {l,e[[l, 1]] <= x <= e[[l, 2]]}]
          
                   , "NaN"]
          
          , {x, data}]];


          From the first example in the above referenced documentation:



          data={1, 1, 2, 3, 6, 5, 8, 10, 4, 4};
          
edges={2, 4, 6, 8, 10};
          

          
disc[data,edges]



          {NaN,NaN,1,1,3,2,4,4,2,2}




          I'm sure there are more efficient/elegant solutions, and will revisit as time permits.







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 4 hours ago









          ciaociao

          17.4k138109




          17.4k138109























              0












              $begingroup$

              Here's a version based on Nearest:



              digitize[edges_] := DigitizeFunction[edges, Nearest[edges -> "Index"]]
              
digitize[data_, edges_] := digitize[edges][data]
              

              
DigitizeFunction[edges_, nf_NearestFunction][data_] := With[{init = nf[data][[All, 1]]},
              
    init + UnitStep[data - edges[[init]]] - 1
              
]


              For example:



              SeedRandom[1]
              
data = RandomReal[10, 10]
              
digitize[data, {2, 4, 5, 7, 8}]



              {8.17389, 1.1142, 7.89526, 1.87803, 2.41361, 0.657388, 5.42247, 2.31155, 3.96006, 7.00474}



              {5, 0, 4, 0, 1, 0, 3, 1, 1, 4}




              Note that I broke up the definition of digitize into two pieces, so that if you do this for multiple data sets with the same edges list, you only need to compute the nearest function once.






              share|improve this answer











              $endgroup$


















                0












                $begingroup$

                Here's a version based on Nearest:



                digitize[edges_] := DigitizeFunction[edges, Nearest[edges -> "Index"]]
                
digitize[data_, edges_] := digitize[edges][data]
                

                
DigitizeFunction[edges_, nf_NearestFunction][data_] := With[{init = nf[data][[All, 1]]},
                
    init + UnitStep[data - edges[[init]]] - 1
                
]


                For example:



                SeedRandom[1]
                
data = RandomReal[10, 10]
                
digitize[data, {2, 4, 5, 7, 8}]



                {8.17389, 1.1142, 7.89526, 1.87803, 2.41361, 0.657388, 5.42247, 2.31155, 3.96006, 7.00474}



                {5, 0, 4, 0, 1, 0, 3, 1, 1, 4}




                Note that I broke up the definition of digitize into two pieces, so that if you do this for multiple data sets with the same edges list, you only need to compute the nearest function once.






                share|improve this answer











                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  Here's a version based on Nearest:



                  digitize[edges_] := DigitizeFunction[edges, Nearest[edges -> "Index"]]
                  
digitize[data_, edges_] := digitize[edges][data]
                  

                  
DigitizeFunction[edges_, nf_NearestFunction][data_] := With[{init = nf[data][[All, 1]]},
                  
    init + UnitStep[data - edges[[init]]] - 1
                  
]


                  For example:



                  SeedRandom[1]
                  
data = RandomReal[10, 10]
                  
digitize[data, {2, 4, 5, 7, 8}]



                  {8.17389, 1.1142, 7.89526, 1.87803, 2.41361, 0.657388, 5.42247, 2.31155, 3.96006, 7.00474}



                  {5, 0, 4, 0, 1, 0, 3, 1, 1, 4}




                  Note that I broke up the definition of digitize into two pieces, so that if you do this for multiple data sets with the same edges list, you only need to compute the nearest function once.






                  share|improve this answer











                  $endgroup$



                  Here's a version based on Nearest:



                  digitize[edges_] := DigitizeFunction[edges, Nearest[edges -> "Index"]]
                  
digitize[data_, edges_] := digitize[edges][data]
                  

                  
DigitizeFunction[edges_, nf_NearestFunction][data_] := With[{init = nf[data][[All, 1]]},
                  
    init + UnitStep[data - edges[[init]]] - 1
                  
]


                  For example:



                  SeedRandom[1]
                  
data = RandomReal[10, 10]
                  
digitize[data, {2, 4, 5, 7, 8}]



                  {8.17389, 1.1142, 7.89526, 1.87803, 2.41361, 0.657388, 5.42247, 2.31155, 3.96006, 7.00474}



                  {5, 0, 4, 0, 1, 0, 3, 1, 1, 4}




                  Note that I broke up the definition of digitize into two pieces, so that if you do this for multiple data sets with the same edges list, you only need to compute the nearest function once.







                  share|improve this answer














                  share|improve this answer



                  share|improve this answer








                  edited 1 hour ago

























                  answered 1 hour ago









                  Carl WollCarl Woll

                  73k396189




                  73k396189






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Mathematica 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%2fmathematica.stackexchange.com%2fquestions%2f194844%2fmap-list-to-bin-numbers%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

                      الفوسفات في المغرب

                      Image
                      قطار ينقل فوسفات من منطقة خريبكة متجه نحو الدار البيضاء. ديار عمال بمصانع الفوسفات بمدينة آسفي. المحتوى هنا ينقصه الاستشهاد بمصادر. يرجى إيراد مصادر موثوق بها. أي معلومات غير موثقة يمكن التشكيك بها وإزالتها. (أغسطس 2015) الفوسفات في المغرب هو ثالث مصدر عالمي للفوسفات، ويتوفر المغرب على %75 من الاحتياطي العالمي  [بحاجة لمصدر] ويتوزع بنسب متفاوتة بين عدة مناطق أساسية وهي: وادي زم بن جرير بوكراع خريبكة اليوسفية أولاد عبدون كنتور واد الذهب مستقلة. هذه الأخيرة لم تفتح بعد للاستغلال. الصادرات الحامض الفوسفوري P205 تمتص الهند %50 من ا لصادرات الإجمالية آسيا (دون روسيا)%59 أوروبا %30 أمريكا اللاتينية %11 أسمدة صلبة أوروبا 38 % أمريكا اللاتينية %30 آسيا (دون روسيا) 22 % أستراليا 9 % بوابة المغرب هذه بذرة مقالة عن علم الاقتصاد أو موضوع متعلق به بحاجة للتوسيع. شارك في تحريرها. This page is only for reference, If you need detailed information, please check here
                      Read more

                      Four equal circles intersect: What is the area of the small shaded portion and its height

                      Image
                      3 $begingroup$ In terms of $R$ which is the radius of all four circles, what is the area of the intersection region of these four equal circles and the height of the marked arrow in the figure? The marked arrow is along the line CD, also the midpoint of all the circles are points A, B, C and D. Looking for a very short intuitive solution. I have checked similar questions on this site for example this and this. geometry circle share | cite | improve this question edited 2 hours ago Abdulhameed asked 2 hours ago ...
                      Read more

                      جامعة ليفربول

                      Image
                      جامعة ليفربول University of Liverpool الأسماء السابقة كلية ليفربول الجامعية (1882-1884) جامعة فيكتوريا في ليفربول (1884-1903) معلومات التأسيس 1882 (منذ 137 سنة) الإنتماءات رابطة الجامعات الأوروبية مجموعة راسل جامعات القرميد الأحمر المنحة المالية 143.5 مليون £ النوع جامعة عامة الكليات 6 الموقع الجغرافي إحداثيات 53°24′22″N 2°58′01″W  /  53.406°N 2.967°W  / 53.406; -2.967   المدينة ليفربول المكان   إنجلترا البلد   المملكة المتحدة رقم الهاتف 7942000 151 (44+) إحصاءات الطلاب 17,405 (سنة 2008) عضوية مجموعة رسل [1] أورسيد [2]   طلاب الدراسات العليا 3,860 الموقع www.liverpool.ac.uk تعديل   جامعة ليفربول مبنى فكتوريا جامعة ليفربول (بالإنجليزية: The University of Liverpool )) إحدى الجامعات البريطانية العريقة، تقع في مدينة ليفربول على الساحل الشمالي الغربي من أنجلترا . وهي عضو في مجموعة راسل للجامعات وتعتبر من ضمن جامعات الطوب الأحمر الستة. محتويات ...
                      Read more