1200 users for 1200 movies Ratings values $\in {1, ..., 5}$ Value $= 0$ for unrated ones
Description:
I was given a data matrix containing movie ratings made by users extracted from Netflix database. Any particular user has rated only a small fraction of the movies so the data matrix was only partially filled. The goal was to predict all the remaining entries of the matrix. I approached it by building a Gaussian Mixture Model (GMM) for collaborative filtering educating it with Expectation Maximization algorithm.
Goal: Develop algorithm able to learn how to play Text Quest and complete its quests in the most efficient way.
Result: Efficiency $0.99$ of theoretical maximum
Methods:
Markov Decision Processes
Feed forward neural network
Description
Text quest. It's space consist of locations. Each location contains set of intractable objects. Agent can interact with objects in his current location or move to other locations. Agent and engine interact with each other via text.
Each turn:
engine provide text description of current location and active quest
agent submit action in "action" "object" format, for instance, "eat apple"
Agent goal - move to specific location and perform specific action to complete quest as fast as possible.