Difference between revisions of "User:Starrynte/DCLSHResearch"
Jump to navigation
Jump to search
(18 seasons, more to be added) |
(added details and TC2K7 results) |
||
| Line 1: | Line 1: | ||
| − | Experimenting with a new way of doing [[Dynamic Clustering]]: Locality Sensitive Hashing, | + | Experimenting with a new way of doing [[Dynamic Clustering]]: Locality Sensitive Hashing. Basically, the idea with LSH is that you reduce the data point down to 1 or 2 dimensions (for now, we'll say 1). Then, you place the reduced data point into bins. The idea is that data points that are close together will fall into the same bin. Then, when you search, you just get the bin of the query and search through that. |
| − | + | ||
| − | + | This will be the basis of the gun for [[Cannon]], so it will have to fit in a micro. | |
==Versions== | ==Versions== | ||
| − | * '''0000:''' Distance and Lateral Velocity, no weighting, 32 LSH bins | + | * '''0000:''' Distance and Lateral Velocity, no weighting, 32 LSH bins, euclidean distance |
| − | * '''0001:''' Realized I could use arrays instead of a Hashtable, | + | * '''0001:''' Realized I could use arrays instead of a Hashtable, saved codesize. Also a few bugfixes |
| − | * '''0002:''' | + | * '''0002:''' 0001 with bugfixes |
==Challenges== | ==Challenges== | ||
===[[Targeting Challenge 2K7|Targeting Challenge 2K7 (Fast Learning)]]=== | ===[[Targeting Challenge 2K7|Targeting Challenge 2K7 (Fast Learning)]]=== | ||
| Line 25: | Line 25: | ||
!No Surf | !No Surf | ||
!Total | !Total | ||
| + | !Seasons | ||
!Comment | !Comment | ||
|- | |- | ||
| − | | | + | | 0002 || [[User:Starrynte|Starrynte]] || 57.93 || 63.25 || 59.36 || 56.67 || 63.37 || '''60.12''' || 75.48 || 71.52 || 60.87 || 68.59 || 67.59 || '''68.81''' || '''64.46''' || 30.0 seasons || |
|} | |} | ||
Revision as of 04:57, 23 September 2009
Experimenting with a new way of doing Dynamic Clustering: Locality Sensitive Hashing. Basically, the idea with LSH is that you reduce the data point down to 1 or 2 dimensions (for now, we'll say 1). Then, you place the reduced data point into bins. The idea is that data points that are close together will fall into the same bin. Then, when you search, you just get the bin of the query and search through that.
This will be the basis of the gun for Cannon, so it will have to fit in a micro.
Versions
- 0000: Distance and Lateral Velocity, no weighting, 32 LSH bins, euclidean distance
- 0001: Realized I could use arrays instead of a Hashtable, saved codesize. Also a few bugfixes
- 0002: 0001 with bugfixes
Challenges
Targeting Challenge 2K7 (Fast Learning)
| Name | Author | CC | RMX | SHA | WS | WOE | Surf | DM | FT | GG | RMC | WLO | No Surf | Total | Seasons | Comment |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0002 | Starrynte | 57.93 | 63.25 | 59.36 | 56.67 | 63.37 | 60.12 | 75.48 | 71.52 | 60.87 | 68.59 | 67.59 | 68.81 | 64.46 | 30.0 seasons |
