EMD Based Semantic User Similarity using Past Travel Histories

The cost-effective and easy availability of handheld mobile devices and ubiquity of location acquisition services such as GPS and GSM networks has helped expedient logging and sharing of location histories of mobile users. This work aims to find semantic user similarity using their past travel histories. Application of the semantic similarity measure can be found in tourism-related recommender systems and information retrieval. The paper presents Earth Mover’s Distance (EMD) based semantic user similarity measure using users' GPS logs. The similarity measure is applied and evaluated on the GPS dataset of 182 users collected from April 2007 to August 2012 by Microsoft's GeoLife project. The proposed similarity measure is compared with conventional similarity measures used in literature such as Jaccard, Dice, and Pearsons’ Correlation. The percentage improvement of EMD based approach over existing approaches in terms of average RMSE is 10.70%, and average MAE is 5.73%.

EMD-Based Semantic User Similarity Using Past Travel Histories

The cost-effective and easy availability of handheld mobile devices and ubiquity of location acquisition services such as GPS and GSM networks has helped expedient logging and sharing of location histories of mobile users. This work aims to find semantic user similarity using their past travel histories. Application of the semantic similarity measure can be found in tourism-related recommender systems and information retrieval. The paper presents Earth Mover’s Distance (EMD) based semantic user similarity measure using users' GPS logs. The similarity measure is applied and evaluated on the GPS dataset of 182 users collected from April 2007 to August 2012 by Microsoft's GeoLife project. The proposed similarity measure is compared with conventional similarity measures used in literature such as Jaccard, Dice, and Pearsons’ Correlation. The percentage improvement of EMD based approach over existing approaches in terms of average RMSE is 10.70%, and average MAE is 5.73%.

Collaborative Filtering Recommendation Algorithm Based on TF-IDF and User Characteristics

The recommendation algorithm is a very important and challenging issue for a personal recommender system. The collaborative filtering recommendation algorithm is one of the most popular and effective recommendation algorithms. However, the traditional collaborative filtering recommendation algorithm does not fully consider the impact of popular items and user characteristics on the recommendation results. To solve these problems, an improved collaborative filtering algorithm is proposed, which is based on the Term Frequency-Inverse Document Frequency (TF-IDF) method and user characteristics. In the proposed algorithm, an improved TF-IDF method is used to calculate the user similarity on the basis of rating data first. Secondly, the multi-dimensional characteristics information of users is used to calculate the user similarity by a fuzzy membership method. Then, the above two user similarities are fused based on an adaptive weighted algorithm. Finally, some experiments are conducted on the movie public data set, and the experimental results show that the proposed method has better performance than that of the state of the art.

Movie Recommendation Model from Data through Online Streaming

With the Pandemic era and easy availability of internet, potential of digital movie and tv series industry is in huge demand. Hence it has led to developing an automatic movie recommendation engine and has become a popular issue. Some of these problems can be solved or at least be minimized if we take the right decisions on what kind of movies to ignore, what movies to consider. This paper examines the recommendations that are obtained with considering the sample movies that have never got an above-average rating, where average rating is defined here as the mid-value between 0 and maximum rating used, for example, 2.5 in 1 to 5 rating scale. The technique used is “collaborative filtering”. Comparison of different pre-training model, it is tried to maximize the effectiveness of semantic understanding and make the recommendation be able to reflect meticulous perception on the relationship between user utilisation and user preference. Keywords: movie recommendation system, user similarity, user similarity, consumption pattern

A Tag And Social Network Based Recommender System

In the era of the Internet, information overload is a growing problem which refers to the inability of a person to make a decision because the amount of information that she/he needs to process is huge. To solve this problem, recommender systems were proposed to apply various algorithms to recognize users’ preferences and generate recommendations which are likely match the user’s interest on various items. In this thesis, we aim to improve the effectiveness of the recommendation by incorporating the social data into the traditional recommendation algorithms. Hence, we first propose a new user similarity metric that not only considers tagging activities of users, but also incorporates their social relationships, such as friendships and memberships, in measuring the nearest neighbours. Subsequently, we define a new recommendation method which makes use of both user-to-user similarity and item-to-item similarity. Experimental outcomes on a Last.fm dataset show positive results of our proposed approach.

A Tag And Social Network Based Recommender System

In the era of the Internet, information overload is a growing problem which refers to the inability of a person to make a decision because the amount of information that she/he needs to process is huge. To solve this problem, recommender systems were proposed to apply various algorithms to recognize users’ preferences and generate recommendations which are likely match the user’s interest on various items. In this thesis, we aim to improve the effectiveness of the recommendation by incorporating the social data into the traditional recommendation algorithms. Hence, we first propose a new user similarity metric that not only considers tagging activities of users, but also incorporates their social relationships, such as friendships and memberships, in measuring the nearest neighbours. Subsequently, we define a new recommendation method which makes use of both user-to-user similarity and item-to-item similarity. Experimental outcomes on a Last.fm dataset show positive results of our proposed approach.

Trust Prediction for Online Social Networks with Integrated Time-Aware Similarity

Online social networks gain increasing popularity in recent years. In online social networks, trust prediction is significant for recommendations of high reputation users as well as in many other applications. In the literature, trust prediction problem can be solved by several strategies, such as matrix factorization, trust propagation, and -NN search. However, most of the existing works have not considered the possible complementarity among these mainstream strategies to optimize their effectiveness and efficiency. In this article, we propose a novel trust prediction approach named iSim : an integrated time-aware similarity-based collaborative filtering approach leveraging on user similarity, which integrates three kinds of factors to measure user similarity, including vector space similarity, time-aware matrix factorization, and propagated trust. This article is the first work in the literature employing time-aware matrix factorization and propagated trust in the study of similarity. Additionally, we use several methods like adding inverted index to reduce the time complexity of iSim , and provide its theoretical time bound. Moreover, we also provide the detailed overview and theoretical analysis of the existing works. Finally, the extensive experiments with real-world datasets show that iSim achieves great improvement for both efficiency and effectiveness over the state-of-the-art approaches.