in reply to Finding The Best Cluster Problem
To clarify (or not :):
Eg. sum( @sim[top..bottom; left..right] ) / (bottom-top) * (right-left); (pretending that we could do 2D slices).
Which would make the problem: Find the rectangular subset with the largest average value; and if two subsets have the same average, favour the largest subset?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Finding The Best Cluster Problem
by neversaint (Deacon) on May 16, 2007 at 10:15 UTC | |
by BrowserUk (Patriarch) on May 16, 2007 at 11:00 UTC | |
by jdporter (Paladin) on May 16, 2007 at 16:08 UTC | |
by BrowserUk (Patriarch) on May 16, 2007 at 10:29 UTC | |
by neversaint (Deacon) on May 16, 2007 at 13:57 UTC | |
by BrowserUk (Patriarch) on May 16, 2007 at 14:20 UTC |