scholarly journals A Personalized Music Recommender System Using User Contents, Music Contents and Preference Ratings

2020 ◽  
Vol 07 (01) ◽  
pp. 77-92
Author(s):  
Ja-Hwung Su ◽  
Chu-Yu Chin ◽  
Yi-Wen Liao ◽  
Hsiao-Chuan Yang ◽  
Vincent S. Tseng ◽  
...  
Keyword(s):  
Recommender System ◽  
Mean Squared Error ◽  
Communication Technologies ◽  
User Preference ◽  
Acoustic Features ◽  
Rating Data ◽  
The Arts ◽  
Online Music ◽  
Preference Ratings ◽  
Better Than

Recently, the advances in communication technologies have made music retrieval easier. Without downloading the music, the users can listen to music through online music websites. This incurs a challenging issue of how to provide the users with an effective online listening service. Although a number of past studies paid attention to this issue, the problems of new user, new item and rating sparsity are not easy to solve. To deal with these problems, in this paper, we propose a novel music recommender system that fuses user contents, music contents and preference ratings to enhance the music recommendation. For dealing with problem of new user, the user similarities are calculated by user profiles instead of traditional ratings. By the user similarities, the unknown ratings can be predicted using user-based Collaborative Filtering (CF). For dealing with problems of rating sparsity and new items, the unknown ratings are initialized by acoustic features and music genre ratings. Because the unknown ratings are initially imputed, the rating data will be enriched. Thereupon, the user preference can be predicted effectively by item-based CF. The evaluation results show that our proposed music recommender system performs better than the state-of-the-arts methods in terms of Root Mean Squared Error.

Evaluation for estimating of the PDF and the CDF of Generalized Inverted Exponential Distribution with Application in Industry

2020 ◽  
pp. 507-522
Author(s):  
Parisa Torkaman
Keyword(s):  
Least Squares ◽  
Exponential Distribution ◽  
Mean Squared Error ◽  
Weighted Least Squares ◽  
Real Data ◽  
Minimum Variance ◽  
Cumulative Distribution ◽  
Estimation Methods ◽  
Data Set ◽  
Better Than

The generalized inverted exponential distribution is introduced as a lifetime model with good statistical properties. This paper, the estimation of the probability density function and the cumulative distribution function of with five different estimation methods: uniformly minimum variance unbiased(UMVU), maximum likelihood(ML), least squares(LS), weighted least squares (WLS) and percentile(PC) estimators are considered. The performance of these estimation procedures, based on the mean squared error (MSE) by numerical simulations are compared. Simulation studies express that the UMVU estimator performs better than others and when the sample size is large enough the ML and UMVU estimators are almost equivalent and efficient than LS, WLS and PC. Finally, the result using a real data set are analyzed.

Effects of Personalized and Aggregate Top-N Recommendation Lists on User Preference Ratings

2021 ◽  
Vol 39 (2) ◽  
pp. 1-38
Author(s):  
Gediminas Adomavicius ◽  
Jesse Bockstedt ◽  
Shawn Curley ◽  
Jingjing Zhang
Keyword(s):  
Recommender Systems ◽  
Laboratory Experiments ◽  
User Preference ◽  
Online Retailer ◽  
Product Recommendations ◽  
Preference Ratings ◽  
User Ratings

Prior research has shown a robust effect of personalized product recommendations on user preference judgments for items. Specifically, the display of system-predicted preference ratings as item recommendations has been shown in multiple studies to bias users’ preference ratings after item consumption in the direction of the predicted rating. Top-N lists represent another common approach for presenting item recommendations in recommender systems. Through three controlled laboratory experiments, we show that top-N lists do not induce a discernible bias in user preference judgments. This result is robust, holding for both lists of personalized item recommendations and lists of items that are top-rated based on averages of aggregate user ratings. Adding numerical ratings to the list items does generate a bias, consistent with earlier studies. Thus, in contexts where preference biases are of concern to an online retailer or platform, top-N lists, without numerical predicted ratings, would be a promising format for displaying item recommendations.

scholarly journals A hybrid recommender system based-on link prediction for movie baskets analysis

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Mohammadsadegh Vahidi Farashah ◽  
Akbar Etebarian ◽  
Reza Azmi ◽  
Reza Ebrahimzadeh Dastjerdi
Keyword(s):  
Recommender System ◽  
Link Prediction ◽  
Mean Squared Error ◽  
Spatial Clustering ◽  
Randomized Algorithm ◽  
Similarity Criterion ◽  
Absolute Error ◽  
Similarity Criteria ◽  
Online Systems ◽  
Squared Error

AbstractOver the past decade, recommendation systems have been one of the most sought after by various researchers. Basket analysis of online systems’ customers and recommending attractive products (movies) to them is very important. Providing an attractive and favorite movie to the customer will increase the sales rate and ultimately improve the system. Various methods have been proposed so far to analyze customer baskets and offer entertaining movies but each of the proposed methods has challenges, such as lack of accuracy and high error of recommendations. In this paper, a link prediction-based method is used to meet the challenges of other methods. The proposed method in this paper consists of four phases: (1) Running the CBRS that in this phase, all users are clustered using Density-based spatial clustering of applications with noise algorithm (DBScan), and classification of new users using Deep Neural Network (DNN) algorithm. (2) Collaborative Recommender System (CRS) Based on Hybrid Similarity Criterion through which similarities are calculated based on a threshold (lambda) between the new user and the users in the selected category. Similarity criteria are determined based on age, gender, and occupation. The collaborative recommender system extracts users who are the most similar to the new user. Then, the higher-rated movie services are suggested to the new user based on the adjacency matrix. (3) Running improved Friendlink algorithm on the dataset to calculate the similarity between users who are connected through the link. (4) This phase is related to the combination of collaborative recommender system’s output and improved Friendlink algorithm. The results show that the Mean Squared Error (MSE) of the proposed model has decreased respectively 8.59%, 8.67%, 8.45% and 8.15% compared to the basic models such as Naive Bayes, multi-attribute decision tree and randomized algorithm. In addition, Mean Absolute Error (MAE) of the proposed method decreased by 4.5% compared to SVD and approximately 4.4% compared to ApproSVD and Root Mean Squared Error (RMSE) of the proposed method decreased by 6.05 % compared to SVD and approximately 6.02 % compared to ApproSVD.

Nonparametric Unidimensional Unfolding for Multicategory Data

1992 ◽  
Vol 4 ◽  
pp. 41-74 ◽  
Author(s):  
Wijbrandt H. van Schuur
Keyword(s):  
Republican Party ◽  
Rating Data ◽  
Presidential Candidates ◽  
Unfolding Model ◽  
Scaling Model ◽  
Dichotomous Data ◽  
Party Activists ◽  
Preference Ratings

This article describes a nonparametric unidimensional unfolding model for dichotomous data (van Schuur 1984) and shows how it can be extended to multicategory data such as Likert-type rating data. This extension is analogous to Molenaar's (1982) application of Mokken's (1970) nonparametric unidimensional cumulative scaling model. The model is illustrated with an analysis of five-point preference ratings given in 1980 to five political presidential candidates by Democratic and Republican party activists in Missouri.

Combining two soil property rasters using an adaptive gating approach

Soil Research ◽  
2015 ◽  
Vol 53 (8) ◽  
pp. 907 ◽  
Author(s):  
David Clifford ◽  
Yi Guo
Keyword(s):  
Confidence Intervals ◽  
Soil Property ◽  
Mean Squared Error ◽  
Geographic Space ◽  
Covariate Information ◽  
Squared Error ◽  
Inverse Variance ◽  
Machine Learning Approach ◽  
Further Development ◽  
Better Than

Given the wide variety of ways one can measure and record soil properties, it is not uncommon to have multiple overlapping predictive maps for a particular soil property. One is then faced with the challenge of choosing the best prediction at a particular point, either by selecting one of the maps, or by combining them together in some optimal manner. This question was recently examined in detail when Malone et al. (2014) compared four different methods for combining a digital soil mapping product with a disaggregation product based on legacy data. These authors also examined the issue of how to compute confidence intervals for the resulting map based on confidence intervals associated with the original input products. In this paper, we propose a new method to combine models called adaptive gating, which is inspired by the use of gating functions in mixture of experts, a machine learning approach to forming hierarchical classifiers. We compare it here with two standard approaches – inverse-variance weights and a regression based approach. One of the benefits of the adaptive gating approach is that it allows weights to vary based on covariate information or across geographic space. As such, this presents a method that explicitly takes full advantage of the spatial nature of the maps we are trying to blend. We also suggest a conservative method for combining confidence intervals. We show that the root mean-squared error of predictions from the adaptive gating approach is similar to that of other standard approaches under cross-validation. However under independent validation the adaptive gating approach works better than the alternatives and as such it warrants further study in other areas of application and further development to reduce its computational complexity.

scholarly journals Application of Improved Recommendation System Based on Spark Platform in Big Data Analysis

2016 ◽  
Vol 16 (6) ◽  
pp. 245-255 ◽  
Author(s):  
Li Xie ◽  
Wenbo Zhou ◽  
Yaosen Li
Keyword(s):  
Big Data ◽  
Recommender System ◽  
Recommendation System ◽  
Parallel Implementation ◽  
Implementation Process ◽  
Recommendation Algorithm ◽  
Filtration Problem ◽  
Information Filtration ◽  
Similarity Information ◽  
Better Than

Abstract In the era of big data, people have to face information filtration problem. For those cases when users do not or cannot express their demands clearly, recommender system can analyse user’s information more proactive and intelligent to filter out something users want. This property makes recommender system play a very important role in the field of e-commerce, social network and so on. The collaborative filtering recommendation algorithm based on Alternating Least Squares (ALS) is one of common algorithms using matrix factorization technique of recommendation system. In this paper, we design the parallel implementation process of the recommendation algorithm based on Spark platform and the related technology research of recommendation systems. Because of the shortcomings of the recommendation algorithm based on ALS model, a new loss function is designed. Before the model is trained, the similarity information of users and items is fused. The experimental results show that the performance of the proposed algorithm is better than that of algorithm based on ALS.

scholarly journals Social Condition of England during the Wars of the Roses

1902 ◽  
Vol 16 ◽  
pp. 159-200
Author(s):  
Vincent B. Redstone
Keyword(s):  
Social Life ◽  
English History ◽  
Class A ◽  
The North ◽  
The Arts ◽  
The Social ◽  
Wars Of The Roses ◽  
Social Habits ◽  
North And South ◽  
Better Than

The social life of the inhabitants of England during the years of strife which brought about the destruction of the feudal nobility, gave to the middle class a new position in the State, and freed the serf from the shackles of bondage, has been for some time past a subject of peculiar interest to the student of English history. If we desire to gain an accurate knowledge of the social habits and customs prevalent during this period of political disturbance, we cannot do better than direct our attention towards that part of the country which was the least affected by the contest between the Houses of York and Lancaster, the eastern district of England, which since the days of King John had enjoyed a remarkable immunity from civil war. Here the powerful lords of the North and South found little support; the vast estates of the old feudal barons were broken up into numerous independent manors. Moreover the arts of peace, in the shape of the mysteries of trade, manufactures, and commerce, widely flourished among the inhabitants of these regions.

scholarly journals Day-Ahead Forecasting of Hourly Photovoltaic Power Based on Robust Multilayer Perception

2018 ◽  
Vol 10 (12) ◽  
pp. 4863 ◽  
Author(s):  
Chao Huang ◽  
Longpeng Cao ◽  
Nanxin Peng ◽  
Sijia Li ◽  
Jing Zhang ◽  
...  
Keyword(s):  
Power Plants ◽  
Mean Squared Error ◽  
Absolute Error ◽  
Multilayer Perception ◽  
Squared Error ◽  
The Mean ◽  
Effectiveness And Efficiency ◽  
Mlp Network ◽  
Grid Operation ◽  
Better Than

Photovoltaic (PV) modules convert renewable and sustainable solar energy into electricity. However, the uncertainty of PV power production brings challenges for the grid operation. To facilitate the management and scheduling of PV power plants, forecasting is an essential technique. In this paper, a robust multilayer perception (MLP) neural network was developed for day-ahead forecasting of hourly PV power. A generic MLP is usually trained by minimizing the mean squared loss. The mean squared error is sensitive to a few particularly large errors that can lead to a poor estimator. To tackle the problem, the pseudo-Huber loss function, which combines the best properties of squared loss and absolute loss, was adopted in this paper. The effectiveness and efficiency of the proposed method was verified by benchmarking against a generic MLP network with real PV data. Numerical experiments illustrated that the proposed method performed better than the generic MLP network in terms of root mean squared error (RMSE) and mean absolute error (MAE).

scholarly journals Target and Equalizer Design for High-Density Bit-Patterned Media Recording

1970 ◽  
Vol 6 (2) ◽  
pp. 128-135
Author(s):  
Santi Koonkarnkhai ◽  
Phongsak Keeratiwintakorn ◽  
Piya Kovintavewat
Keyword(s):  
Partial Response ◽  
Mean Squared Error ◽  
Bit Patterned Media ◽  
Patterned Media ◽  
Media Noise ◽  
Minimum Mean Squared Error ◽  
Squared Error ◽  
Cross Track ◽  
Partial Response Maximum Likelihood ◽  
Better Than

In bit-patterned media recording (BPMR) channels, the inter-track interference (ITI) is extremely severe at ultra high areal densities, which significantly degrades the system performance. The partial-response maximum-likelihood (PRML) technique that uses an one-dimensional (1D) partial response target might not be able to cope with this severe ITI, especially in the presence of media noise and track mis-registration (TMR). This paper describes the target and equalizer design for highdensity BPMR channels. Specifically, we proposes a two-dimensional (2D) cross-track asymmetric target, based on a minimum mean-squared error (MMSE) approach, to combat media noise and TMR. Results indicate that the proposed 2D target performs better than the previously proposed 2D targets, especially when media noise and TMR is severe.

Sign in / Sign up

Export Citation Format

Share Document