Discussion
okay so consider the operation that starts with a list of length n of numbers (say [2, 1, 3, 0]) and produces a 2d array where each row is also length n and has zeros at every index except the index that corresponds to the value from the first list (i.e., [[0,0,1,0],[0,1,0,0],[0,0,0,1],[1,0,0,0]])
is there a more specific and/or less technical term for this operation other than "one-hot encoding"?
@aparrish does it help to focus on the domain-specific parts of the operation instead? I don't know weaving so I'm probably saying this wrong but I mean something derived from a phrase like "convert shafts to threading"
@jamey yeah it might have to be something like this, it's just a mouthful for a function name haha
(I say "more specific" because—from what i can tell—in one-hot encoding, it's only important that each state/vocabulary item has a unique representation, not that the index of the bit should specifically correspond to some ordering in whatever is being encoded)
@aparrish (I won't have any more information for you regardless of you clarifying things for me, but is your input list exactly a permutation of the numbers 0..(n-1) always?
or if not is it always a list of distinct numbers?
I'm not quite grokking what the domain of the input is.)
@gaditb oh good point! the input in this case is always positive integers with no repeats, but not always in a contiguous range (i.e., you might have [1, 2, 3, 7, 19] as an input)
@aparrish Wouldn't each row need to be max( $input$ ) long, not n=len( $input$ ) ?
Like in your example, the rows would need to be length 19, so that the last one could be [0, 0, ..., 0, 0, 1] ?
You need to log in to see that page.
Install bonfire.cafe
Get the full app experience
@aparrish I don't think this is better but the other electronics thing this reminds me of is a demux/demultiplexer