19 research outputs found

    Adversarial Online Collaborative Filtering

    Full text link
    We investigate the problem of online collaborative filtering under no-repetition constraints, whereby users need to be served content in an online fashion and a given user cannot be recommended the same content item more than once. We start by designing and analyzing an algorithm that works under biclustering assumptions on the user-item preference matrix, and show that this algorithm exhibits an optimal regret guarantee, while being fully adaptive, in that it is oblivious to any prior knowledge about the sequence of users, the universe of items, as well as the biclustering parameters of the preference matrix. We then propose a more robust version of this algorithm which operates with general matrices. Also this algorithm is parameter free, and we prove regret guarantees that scale with the amount by which the preference matrix deviates from a biclustered structure. To our knowledge, these are the first results on online collaborative filtering that hold at this level of generality and adaptivity under no-repetition constraints. Finally, we complement our theoretical findings with simple experiments on real-world datasets aimed at both validating the theory and empirically comparing to standard baselines. This comparison shows the competitive advantage of our approach over these baselines

    X-hinter: a framework for implementing social oriented recommender systems

    No full text
    Accordingly to the nature of data-driven applications that produce information overload, users need a support to make choices, even without sufficient personal experience of the alternatives. In this context, social networking techniques could be useful applied for finding affinities between users and filter information in a personalized way. After proposing a generalized model for social recommender systems, called X-Hinter, we describe a Java API that provides a set of libraries and tools to build social filtering systems in a wide range of domains. A prototype implementation, named DeHinter, shows the feasibility of the proposed approach in a P2P file sharing application

    DeHinter: A Social-oriented Peer-to-Peer Recommender System

    No full text
    DeHinter is a Peer-to-Peer (P2P) recommender system that exploits social filtering techniques in order to implement a fully decentralized resource sharing platform. The system provides to users a way to share, search and retrieve contents in a scalable, flexible and efficient way. The spontaneous relationships between users that show similar interests shape highly connected thematic clusters that can be exploited to provide personalized advices. DeHinter's goal is to reduce the impact of the information overload providing a decentralized, autonomous and efficient way to filter contents exploiting social-oriented phenomena. The P2P communication layer of DeHinter is based on the P2P Gnutella protocol, that is a fully distributed overlay network. Main features: - Starts from the evidence that affinities between Gnutella users form scale-free and small world patterns. - Implement a distributed recommender engine able to suggest contents in a transparent way. - Fully decentralized and autonomous. - Exploits a de facto “word of mouth” mechanism. - Independent from content metadata descriptions or a specific ontology. - Users can give both implicit and explicit feedbacks. - Simple, completely anonymous and protecting users privacy mechanism to gather usage data for evaluation purposes

    X-Hinter

    No full text
    Social applications are rapidly popularizing collaborative tools for indexing, retrieval, access and distribution of content over the Internet. Very recently navigational paradigm has emerged due to the diffusion of folksonomies within popular tagging systems (e.g., Flickr, del.icio.us, and so on); in fact, folksonomies have been showed to overperform monolithic hierarchical classifications in social domains where many users with different mental attitudes and vocabularies are active. Moreover, social tagging provides us with a powerful way to manage online resources collaboratively. Users can freely choose words to describe resources and therefore resources get descriptions from various users represented as sets of tags, collectively forming a folksonomy. Tags are widely used in many Web 2.0 and social media Web sites, by which users can organize their own collections, discover interesting resources, and find friends with similar interests. Annotations are proved to be a useful source for aggregated services like social search, social link suggestion or personalized recommendation services. The descriptive power of folksonomies can be exploited to provide a recommender engine to cope with the problem of information overloading in digital media dataset. The X-Hinter project provides a REST API in python that provides the following services to social applications and mashups: - A Tagging Service that enables the users to annotate media content and services with the possibility to search and navigate them according to the tag space. - A Rating Service that provides a way to collect explicit feedbacks on content - A Recommender Service that suggests to the users media content related to their personal taste
    corecore