Talk:Segmentation/Best Segment

From Robowiki
< Talk:Segmentation
Revision as of 14:47, 3 April 2011 by Nat (talk | contribs) (my approach + question)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

I was reading about oldwiki:Segmentation/BestSegment and oldwiki:Segmentation/Prioritizing. Basically my approach is base on slope and peak recognition. I call it "Peak Obviousness". I think the result is pretty decent, but I am not sure which VCS data is consider more "obvious". Note that my approach only works with real number in range of [0,1] (only smoothed and averaged VCS data set).

From the oldwiki page, using the information gain method, there are problems with the segment {0,0,0,0,0,3,3,3,3,3} and segment {2,2,2,2,2,5,2,2,2,2}. Converted these to float, my method consider the later segment better by large margin (0.130 vs 0.330). But these segments is what I am not sure with:

* {0, 1, 2, 3, 6, 5, 3, 2, 1, 0}
* {0, 2, 4, 6, 5, 6, 4, 2, 1, 0}
* {0, 2, 4, 6, 0, 6, 4, 2, 1, 0} 
* {0, 2, 4, 6, 6, 6, 4, 2, 1, 0}

(Note: I converted them to integer for reader's sake) My current method rate the first array 0.442, the second 0.168, the third 0.325 and the last 0.239. I am not sure which segment is consider better in Robocode's world. What do you guys think?