Hello I am a layman trying to analyze game data from League of Legends, specifically looking at predicting the win rate for a given champion given an item build.
Outline
A player can own up to 6 items at the end of a game. They could have purchased these items in different orders or adjusted their inventory position during the course of the game.
In this fashion the dataset may contain the following rows with:
champion id | items ids | win(1)/loss(0)
----------------------------------------------------------------------------
45 | [3089, 3135, 3151, 3157, 3165, 3285] | 1
45 | [3151, 3285, 3135, 3089, 3157, 3165] | 1
45 | [3165, 3285, 3089, 3135, 3157, 3151] | 0
While the items are in a different order the build is the same, my initial thought would be to simply multiply the item ids as this would give me an integer value representing that combination of 6 items.
While there are hundreds of items, in reality a champion draws off a small subset (~20) of those to form the core (3 items) of their build. A game may also finish before players have had time to purchase 6 items:
items ids
------------------------------------------
[3089, XXXX, 3151, 3285, 3165, 0000]
[XXXX, 3285, XXXX, 3165, 3151, 0000]
[3165, 3285, 3089, XXXX, 0000, 0000]
XXXX item from outside core subset
0000 empty inventory slot
As item 3089 compliments champion 45 core builds that have item 3089 have a higher win rate than core builds which are missing item 3089.
The size of the data set available for each champion varies between 10000 and 100000. The mean is probably around 35000.
Questions
- Is this a suitable problem for supervised classification?
- How should I approach finding groups of core items and their win rates?