Vjylku

Does it makes sense to buy a new cycle to learn riding?

Calculate Levenshtein distance between two strings in Python

Why is my log file so massive? 22gb. I am running log backups

Why do we use polarized capacitors?

Domain expired, GoDaddy holds it and is asking more money

Pristine Bit Checking

Email Account under attack (really) - anything I can do?

Are objects structures and/or vice versa?

LWC and complex parameters

How could a lack of term limits lead to a "dictatorship?"

Could a US political party gain complete control over the government by removing checks & balances?

What is the command to reset a PC without deleting any files

Is every set a filtered colimit of finite sets?

Re-submission of rejected manuscript without informing co-authors

Is this food a bread or a loaf?

How to move the player while also allowing forces to affect it

Filling an area between two curves

Information to fellow intern about hiring?

Crop image to path created in TikZ?

Can I find out the caloric content of bread by dehydrating it?

If a centaur druid Wild Shapes into a Giant Elk, do their Charge features stack?

What is the meaning of "of trouble" in the following sentence?

Symmetry in quantum mechanics

How to answer pointed "are you quitting" questioning when I don't want them to suspect

map list to bin numbers

quantilization (if that is a word)Map efficiently over duplicates in listGenerating a list of cubefree numbersIs there an equivalent to MATLAB's linspace?Convert a list of hexadecimal numbers to decimalTaking one list Mod a second listlist of items and group of alternative itemsHow find numbers in this list of inequalities?Selecting list entries with a True False index list of similar lengthReplace element in array by checking condition in another listAttempting to fill a table with the number of elements in each bin and make a table with the elements in the bins?

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

edited 1 hour ago

Carl Woll

73k396189

asked 6 hours ago

AlanAlan

6,6331125

$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
  30 mins ago
  

  
  
  
  

add a comment | 

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

edited 1 hour ago

Carl Woll

73k396189

asked 6 hours ago

AlanAlan

6,6331125

$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
  30 mins ago
  

  
  
  
  

add a comment | 

$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

edited 1 hour ago

Carl Woll

73k396189

asked 6 hours ago

AlanAlan

6,6331125

$endgroup$

share|improve this question

edited 1 hour ago

Carl Woll

73k396189

asked 6 hours ago

AlanAlan

6,6331125

share|improve this question

edited 1 hour ago

Carl Woll

73k396189

asked 6 hours ago

AlanAlan

6,6331125

edited 1 hour ago

Carl Woll

73k396189

edited 1 hour ago

Carl Woll

73k396189

asked 6 hours ago

AlanAlan

6,6331125

asked 6 hours ago

AlanAlan

6,6331125

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

answered 4 hours ago

ciaociao

17.4k138109

$endgroup$

add a comment | 

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

edited 1 hour ago

answered 1 hour ago

Carl WollCarl Woll

73k396189

$endgroup$

add a comment | 

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

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

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

Name

Email

Required, but never shown

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

answered 4 hours ago

ciaociao

17.4k138109

$endgroup$

add a comment | 

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

answered 4 hours ago

ciaociao

17.4k138109

$endgroup$

add a comment | 

$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

answered 4 hours ago

ciaociao

17.4k138109

$endgroup$

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}]];

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

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



disc[data,edges]

share|improve this answer

answered 4 hours ago

ciaociao

17.4k138109

answered 4 hours ago

ciaociao

17.4k138109

answered 4 hours ago

ciaociao

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

edited 1 hour ago

answered 1 hour ago

Carl WollCarl Woll

73k396189

$endgroup$

add a comment | 

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

edited 1 hour ago

answered 1 hour ago

Carl WollCarl Woll

73k396189

$endgroup$

add a comment | 

$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

edited 1 hour ago

answered 1 hour ago

Carl WollCarl Woll

73k396189

$endgroup$

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

]

SeedRandom[1]

data = RandomReal[10, 10]

digitize[data, {2, 4, 5, 7, 8}]

share|improve this answer

edited 1 hour ago

answered 1 hour ago

Carl WollCarl Woll

73k396189

answered 1 hour ago

Carl WollCarl Woll

73k396189

answered 1 hour ago

Carl WollCarl Woll

73k396189