Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
The diversity of learning abilities between learners in the virtual classroom is wider than those in traditional classroom. It is difficult to prepare a suitable teaching material ...
This paper presents an unsupervised opinion analysis method for debate-side classification, i.e., recognizing which stance a person is taking in an online debate. In order to hand...
In this paper, we propose to develop the supervised classification method Fuzzy Pattern Matching to be in addition a non supervised one. The goal is to monitor dynamic systems with...