Timeline for How to use and understand entropy for pattern detection?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5 at 22:34 | comment | added | whuber♦ | I suspect it would be critically important, because "pattern detection" based on entropy requires evaluating local neighborhoods of each pixel, which are completely determined by the sorting. (If you aren't paying attention to neighborhoods, then there isn't anything left of the "pattern" apart from the frequencies of the possible pixel colors.) See stats.stackexchange.com/questions/17109 for a basic example of how this works. | |
| Mar 1 at 18:05 | comment | added | Vladimir Mikheev | Pattern here is sigmoid (bright blue). Trials sorted on the basis of fixation duration (but I don't think it is important here) | |
| Mar 1 at 15:22 | comment | added | whuber♦ | On what basis are the trials sorted and what specifically do you mean by a "pattern"? After all, virtually any method of sorting the rows according to some property of each row will yield a visualization that does not appear random. | |
| Mar 1 at 14:45 | history | edited | Vladimir Mikheev | CC BY-SA 4.0 |
added 105 characters in body
|
| S Mar 1 at 14:44 | review | First questions | |||
| Mar 1 at 15:23 | |||||
| S Mar 1 at 14:44 | history | asked | Vladimir Mikheev | CC BY-SA 4.0 |