Research/Develop Event-UserData relationship sorting algorithm

[jamrreed]

Gotta figure out how to sort the events on the "search for events" page. Initial sorting will be done somewhat based on the front page algorithm but combined with the new user data criteria until they filter the results.

[jamrreed]

This will extend the decaying notion of the previous issue. In that issue we determined a formula for decay:
P = 0.5N + C(1-e^(x - k))
We introduce another constant to change the position, T for tag.
One way to possibly implement an added position relative to tags is to collect a list of tags that each user is associated to based on the events they have been associated with. There will be a total number of tags for each type of tag. Given a sorted list, we can say that T can represent multiple values to be added (if the event in question has multiple tags.)

For example, we have Tag1, Tag2, Tag3, Tag4, Tag5.
The event is listed as Tag2, Tag3.
The user has, based on previous events, 50 Tag1, 0 Tag2, 75Tag3, 10Tag4, 0 Tag 5. Total tags = 165.
Because event has 2 and 3 , we get an average amount (75 / 165 ) + ( 0 / 165) due to event having Tag 3 and Tag2.
T becomes 75/175 (then multiply by constant).
So we have T= (75/175) * A, where A is some constant we determine that represents how weighted the tag is.