An integrated mobile content recommendation system

Many features have been added to mobile devices to assist the user's information consumption. However, there are limitations due to information overload on the devices, hardware usability and capacity. As a result, content filtering in a mobile recommendation system plays a vital role in the solution to this problem. A system that utilises content filtering can recommend content which matches a user's needs based on user preferences with a higher accuracy rate. However, mobile content recommendation systems have problems and limitations related to cold start and sparsity. The problems can be viewed as first time connection and first content rating for non-interactive recommendation systems where information is insufficient to predict mobile content which will match with a user's needs. In addition, how to find relevant items for the content recommendation system which are related to a user's profile is also a concern. An integrated model that combines the user group identification and mobile content filtering for mobile content recommendation was proposed in this study in order to address the current limitations of the mobile content recommendation system. The model enhances the system by finding the relevant content items that match with a user's needs based on the user's profile. A prototype of the client-side user profile modelling is also developed to demonstrate the concept. The integrated model applies clustering techniques to determine groups of users. The content filtering implemented classification techniques to predict the top content items. After that, an adaptive association rules technique was performed to find relevant content items. These approaches can help to build the integrated model. Experimental results have demonstrated that the proposed integrated model performs better than the comparable techniques such as association rules and collaborative filtering. These techniques have been used in several recommendation systems. The integrated model performed better in terms of finding relevant content items which obtained higher accuracy rate of content prediction and predicted successful recommended relevant content measured by recommendation metrics. The model also performed better in terms of rules generation and content recommendation generation. Verification of the proposed model was based on real world practical data. A prototype mobile content recommendation system with client-side user profile has been developed to handle the revisiting user issue. In addition, context information, such as time-of-day and time-of-week, could also be used to enhance the system by recommending the related content to users during different time periods. Finally, it was shown that the proposed method implemented fewer rules to generate recommendation for mobile content users and it took less processing time. This seems to overcome the problems of first time connection and first content rating for non-interactive recommendation systems

Online optimization for user-specific hybrid recommender systems

User-specific hybrid recommender systems aim at harnessing the power of multiple recommendation algorithms in a user-specific hybrid scenario. While research has previously focused on self-learning hybrid configurations, such systems are often too complex to take out of the lab and are seldom tested against real-world requirements. In this work, we describe a self-learning user-specific hybrid recommender system and assess its ability towards meeting a set of pre-defined requirements relevant to online recommendation scenarios: responsiveness, scalability, system transparency and user control. By integrating a client-server architectural design, the system was able to scale across multiple computing nodes in a very flexible way. A specific user-interface for a movie recommendation scenario is proposed to illustrate system transparency and user control possibilities, which integrate directly in the hybrid recommendation process. Finally, experiments were performed focusing both on weak and strong scaling scenarios on a high performance computing environment. Results showed performance to be limited only by the slowest integrated recommendation algorithm with very limited hybrid optimization overhead

AI Dining Suggestion App

Trying to decide what to eat can sometimes be challenging and time-consuming for people. Google and Yelp have large scale data sets of restaurant information as well as Application Program Interfaces (APIs) for using them. This restaurant data includes time, price range, traffic, temperature, etc. The goal of this project is to build an app that eases the process of finding a restaurant to eat. This app has a Tinder-like user friendly User Interface (UI) design to change the common way that lists of restaurants are presented to users on mobile apps. It also uses the help of Artificial Intelligence (AI) with neural networks to train both supervised and unsupervised learning models that can learn from one\u27s dining pattern over time to make better suggestions at any time

Distributed Improved Deep Prediction for Recommender System using an Ensemble Learning

If online businesses possess valuable interest for suggesting their items by scoring them, then digital advertising gains their profits depending on their promotions or marketing task. Web users cannot be certain that the products handled via big-data recommendation are either advanced or interesting to their needs. In recent decades, recommender system models have been widely used to analyses large quantities of information. Amongst, a Distributed Improved Prediction with Matrix Factorization (MF) and Random Forest (RF) called DIPMF model exploits individual’s desires, choices and social context together for predicting the ratings of a particular item. But, the RF scheme needs high computation power and time for learning process. Also, its outcome was influenced by the training parameters. Hence this article proposes a Distributed Improved Deep Prediction with MF and ensemble learning (DIDPMF) model is proposed to decrease the computational difficulty of RF learning and increasing the efficiency of rating prediction. In this DIDPMF, a forest attribute extractor is ensemble with the Deep Neural Network (fDNN) for extracting the sparse attribute correlations from an extremely large attribute space. So, incorporating RF over DNN has the ability to provide prediction outcomes from all its base trainers instead of a single estimated possibility rate. This fDNN encompasses forest module and DNN module. The forest module is employed as an attribute extractor to extract the sparse representations from the given raw input data with the supervision of learning outcomes. First, independent decision trees are constructed and then ensemble those trees to obtain the forest. After, this forest is fed to the DNN module which acts as a learner to predict the individual’s ratings with the aid of novel attribute representations. Finally, the experimental results reveal that the DIDPMF outperforms than the other conventional recommender systems