Advanced Analytics and Deep Learning Models. Группа авторов. Читать онлайн. Newlib. NEWLIB.NET

Автор: Группа авторов
Издательство: John Wiley & Sons Limited
Серия:
Жанр произведения: Программы
Год издания: 0
isbn: 9781119792413
Скачать книгу
every criteria preference as contexts and the last one issuing preferred criteria ratings as contexts. Their demonstrations are depending on two practical rating datasets. It reveals that managing criteria priorities as contexts can upgrade the efficiency of module recommendations if those are being selected very carefully. They have used a hybrid model which selects criteria preference as contexts and solve remaining part in traditional way. They have illustrated this proposed model and got very efficient result and the model becomes the winner of their experiment [19].

      Now, we will see its experimental evaluation and result to ensure its efficiency.

       3.4.3.1 Evaluation Setting

      They have very limited datasets which have multiple-criteria ratings for experiment. For this research, they use two popular real-world datasets: TripAdvisor dataset and Yahoo! Movies dataset. Successively, they used 80% of rated moves or hotels for training purposes and rest 20% for the testing purpose. They evaluated and compared the algorithms which are declared placed to calculate the prediction of rating. They predicted in general ratings mentioned by users on every item for test set, along with calculate efficiency by the very popular mean absolute error method [19].

       3.4.3.2 Experimental Result

      First, biased MF does not require more details like multi-criteria ratings or contexts. So, for this reason, it is the worst model here. As FCM carries outpour efficiency than the Agg method in the TripAdvisor dataset, so applying contexts as criteria preference will not be inadequate choice every time. Choosing the most influential criteria, PCM performs better Agg in those two datasets. Eventually, they observed, HCM is the finest predictive model with the shortest mean absolute error. It has enough to provide remarkable improvements compared with other models and depends on the statistical paired t-test. To be more specific, it is fit to acquire 4.7% and 8.7% improvements in balancing with the aggregation model, 6.7% and 6.9% improvements compared with the FCM, in the TripAdvisor and Yahoo! Movies datasets, respectively. They have proved that HCM performs better than PCM in this experiment [19].

      3.4.4 Utility-Based Multi-Criteria Recommender Systems by Zheng

      In this research activity, they introduced a utility-based multi-criteria recommendation algorithm. In this algorithm, they studied customer expectations by dissimilar learning to rank approaches. Their experimental outputs are depending on practical datasets. It demonstrates the usefulness of these approaches [3].

       3.4.4.1 Experimental Dataset

      They evaluated the efficiency of recommender form on the top 10 recommendations by using accuracy and NDCG to calculate the efficiency. To calculate the utility scores, they used three measures. By applying Pearson correlation, they get little improved results rather than applying cosine similarity. They found that Euclidean distance was the bad choice. They represented the best outcome by using Pearson correlation [3].

       3.4.4.2 Experimental Result

Bar graph depicts the experimental result.

      3.4.5 Multi-Criteria Clustering Approach by Wasid and Ali

      In this research activity, they suggested a clustering method to use multiple-criteria rating into conventional recommendation system successfully. To generate more on the mark recommendations, they evaluate the intra-cluster client matches by applying Mahalanobis distance approach. Then, they collated their method with the conventional CF [2].

      Now, we will take a look on their experimental evaluation and result for its efficiency.

       3.4.5.1 Experimental Evaluation

      To implement this proposed approach, they have used Yahoo! Movies dataset. This dataset consists of 62,156 rating provides by 6,078 users on 976 movies. To make it simple, they have extracted those clients that have rated to minimum 20 movies. This condition satisfies 484 users and 945 movies, and they have total 19,050 ratings. Then, every client’s rating is splitted arbitrarily into training and testing set. They took 70% of data for training purpose and remaining 30% of data for testing purpose. Then, they calculate the distance between clients successfully. They selected top 30 most equivalent users for the neighborhood set formation. To evaluate this proposed approach, they used the most popular Mean Absolute Error (MAE) performance matrix. MAE is very popular because of its simplicity and accuracy as we have seen before. It matches the goal of the experiment. The mean absolute error estimates the derivation of actual and predicted client ratings [2].

       3.4.5.2 Result and Analysis