User:Starrynte/DCLSHResearch

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	Comments
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

Targeting Challenge RM

Name	Author	Aspd	Sprw	Fhqw	Yngw	FlMn	EASY	Tron	HTTC	RnMB	DlMc	Grbb	MEDIUM	SnDT	Cgrt	Frtn	WkOb	RkMc	HARD	TOTAL	Seasons	Comments
0002	Starrynte	75.61	82.73	76.67	88.58	76.78	80.08	76.80	74.37	71.28	75.45	61.37	71.85	57.67	56.86	70.94	67.49	69.50	64.49	72.14	50.0 seasons