N-Screen Aware Multicriteria Hybrid Recommender System Using Weight Based Subspace Clustering

This paper presents a recommender system for N-screen services in which users have multiple devices with different capabilities. In N-screen services, a user can use various devices in different locations and time and can change a device while the service is running. N-screen aware recommendation seeks to improve the user experience with recommended content by considering the user N-screen device attributes such as screen resolution, media codec, remaining battery time, and access network and the user temporal usage pattern information that are not considered in existing recommender systems. For N-screen aware recommendation support, this work introduces a user device profile collaboration agent, manager, and N-screen control server to acquire and manage the user N-screen devices profile. Furthermore, a multicriteria hybrid framework is suggested that incorporates the N-screen devices information with user preferences and demographics. In addition, we propose an individual feature and subspace weight based clustering (IFSWC) to assign different weights to each subspace and each feature within a subspace in the hybrid framework. The proposed system improves the accuracy, precision, scalability, sparsity, and cold start issues. The simulation results demonstrate the effectiveness and prove the aforementioned statements

Enhancing Collaborative Filtering Using Implicit Relations in Data

International audienceThis work presents a Recommender System (RS) that relies on distributed recommendation techniques and implicit relations in data. In order to simplify the experience of users, recommender systems pre-select and filter information in which they may be interested in. Users express their interests in items by giving their opinion (explicit data) and navigating through the web-page (implicit data). The Matrix Fac-torization (MF) recommendation technique analyze this feedback, but it does not take more heterogeneous data into account. In order to improve recommendations, the description of items can be used to increase the relations among data. Our proposal extends MF techniques by adding implicit relations in an independent layer. Indeed, using past preferences, we deeply analyze the implicit interest of users in the attributes of items. By using this, we transform ratings and predictions into " semantic values " , where the term semantic indicates the expansion in the meaning of ratings. The experimentation phase uses MovieLens and IMDb database. We compare our work against a simple Matrix Factorization technique. Results show accurate personalized recommendations. At least but not at last, both recommendation analysis and semantic analysis can be par-allelized, alleviating time processing in large amount of data

Enriching companion robots with enhanced reminiscence abilities

In this document I will go on discussing a project conceived by Professor Andrea Giovanni Nuzzolese and Alessandro Russo, both researchers and developers of some of the main aspects of project Mario at CNR Rome. MARIO is a robot, part of a robotics company called KOMPAÏ Robotics that deals with the production and management of Robots who take care of elderly people who suffer from dementia or who still need an aid; more generally speaking, there is talk of weak and lonely people within an organization and / or institutions (nursing homes ...) or in their own homes. There are numerous characteristics of MARIO, which ultimately contribute to all those which are the manufacturing objectives of KOMPAÏ Robotics. My project, or rather my contribution to MARIO, is to look for a specific method which let the robot show a specific set of photos to the user according to the expressions, feelings and emotions, the user will reveal. Example: the robot randomly chooses a marriage photo and the user suddenly start to laugh and to express positive feelings with positive words; the robot will try to understand if it’s a good photo for the user or not, and in the first case will continue to show the same kind of pictures while in the second case, will change completely set of photos to be shown. The pleasure of the subject expressed in relation to a photo must be subject to an index of interest between predefined and specified values that may be to show a certain interest in a picture or the subjects within the image or the situation that surrounds them

Blockchain-based data sharing for decentralized tourism destinations recommendation system

One thing that tourists need to plan their tourism activities is a recommendation system. The tourism destinations recommendation system in this study has three primary nodes, namely user, server, and sensor. Each node requires the ability to share data to produce recommendations that the user expects through their mobile devices. In this paper, we propose the data-sharing system scheme uses a blockchain-based decentralized network that each node can be connected directly to each other, to support the exchange of data between them. The block architecture used in the blockchain network has three main parts, namely block information, hashes, and data. Each type of node has a different structure and direction of data communication. Where the user node sends destination assessment data to the server node, then the server node sends data from the machine learning process to the user node. The sensor sends dynamic data about popularity, traffic, and weather to the user node as consideration for finalizing the generating recommendations process. In the process of sending data, each node in the blockchain network goes through several functions, including hashing, block validation, chaining block, and broadcast. We conduct web-based experiments and analysis of the data-sharing system to illustrate the system works. The experimental results show that the system handles data circulation with an average time of mine is 84.5 ms in sending multi-criteria assessment data from the user and 119.1 ms in sending data of machine learning result from the server