I've got a series of events (points, objects, letters, what have you) that occur during a labeled time period (category.) Events can happen during multiple categories. I want to find the event which is most representative of each category. Put another way, for each category, I want to find the event that happens most often that doesn't happen often in other categories.
How about a rough example of what I want to do? Here are some categories, and beneath them the events that belong to them:
I would like to have an algorithm that outputs:
- Apples: A
- Oranges: C
- Kiwis: B
I don't want D selected for any since it happens roughly equally in all categories