We consider how state similarity in average reward Markov decision processes (MDPs) may be described by pseudometrics. Introducing the notion of adequate pseudometrics which are we...
Our goal is for robots to learn conceptual systems su cient for natural language and planning. The learning should be autonomous, without supervision. The rst steps in building a ...
Distributed representations of words are attractive since they provide a means for measuring word similarity. However, most approaches to learning distributed representations are ...
Abstract. Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A...
Most recommender systems present recommended products in lists to the user. By doing so, much information is lost about the mutual similarity between recommended products. We prop...
Martijn Kagie, Michiel C. van Wezel, Patrick J. F....