scholarly journals Personalized Music Recommendation Simulation Based on Improved Collaborative Filtering Algorithm

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Hui Ning ◽  
Qian Li

Collaborative filtering technology is currently the most successful and widely used technology in the recommendation system. It has achieved rapid development in theoretical research and practice. It selects information and similarity relationships based on the user’s history and collects others that are the same as the user’s hobbies. User’s evaluation information is to generate recommendations. The main research is the inadequate combination of context information and the mining of new points of interest in the context-aware recommendation process. On the basis of traditional recommendation technology, in view of the characteristics of the context information in music recommendation, a personalized and personalized music based on popularity prediction is proposed. Recommended algorithm is MRAPP (Media Recommendation Algorithm based on Popularity Prediction). The algorithm first analyzes the user’s contextual information under music recommendation and classifies and models the contextual information. The traditional content-based recommendation technology CB calculates the recommendation results and then, for the problem that content-based recommendation technology cannot recommend new points of interest for users, introduces the concept of popularity. First, we use the memory and forget function to reduce the score and then consider user attributes and product attributes to calculate similarity; secondly, we use logistic regression to train feature weights; finally, appropriate weights are used to combine user-based and item-based collaborative filtering recommendation results. Based on the above improvements, the improved collaborative filtering recommendation algorithm in this paper has greatly improved the prediction accuracy. Through theoretical proof and simulation experiments, the effectiveness of the MRAPP algorithm is demonstrated.

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Guangxia Xu ◽  
Zhijing Tang ◽  
Chuang Ma ◽  
Yanbing Liu ◽  
Mahmoud Daneshmand

Complex and diverse information is flooding entire networks because of the rapid development of mobile Internet and information technology. Under this condition, it is difficult for a person to locate and access useful information for making decisions. Therefore, the personalized recommendation system which utilizes the user’s behaviour information to recommend interesting items emerged. Currently, collaborative filtering has been successfully utilized in personalized recommendation systems. However, under the condition of extremely sparse rating data, the traditional method of similarity between users is relatively simple. Moreover, it does not consider that the user’s interest will change over time, which results in poor performance. In this paper, a new similarity measure method which considers user confidence and time context is proposed to preferably improve the similarity calculation between users. Finally, the experimental results demonstrate that the proposed algorithm is suitable for the sparse data and effectively improves the prediction accuracy and enhances the recommendation quality at the same time.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Kai Si ◽  
Min Zhou ◽  
Yingfang Qiao

The rapid development of web technology has brought new problems and challenges to the recommendation system: on the one hand, the traditional collaborative filtering recommendation algorithm has been difficult to meet the personalized recommendation needs of users; on the other hand, the massive data brought by web technology provides more useful information for recommendation algorithms. How to extract features from this information, alleviate sparsity and dynamic timeliness, and effectively improve recommendation quality is a hot issue in the research of recommendation system algorithms. In view of the lack of an effective multisource information fusion mechanism in the existing research, an improved 5G multimedia precision marketing based on an improved multisensor node collaborative filtering recommendation algorithm is proposed. By expanding the input vector field, the features of users’ social relations and comment information are extracted and fused, and the problem of collaborative modelling of these two kinds of important auxiliary information is solved. The objective function is improved, the social regularization term and the internal regularization term in the vector domain are analysed and added from the perspective of practical significance and vector structure, which alleviates the overfitting problem. Experiments on a large number of real datasets show that the proposed method has higher recommendation quality than the classical and mainstream baseline algorithm.


2014 ◽  
Vol 519-520 ◽  
pp. 510-515 ◽  
Author(s):  
Ya Fei Tang ◽  
Yun Yong Zhang ◽  
Jin Wu Wei ◽  
Xiao Ming Chen

As the development of the mobile communication and the computational capability of the mobile terminals, more users use their mobile devices to play music. In this work, an online music recommendation system is designed for mobile services, which consists of two modules: offline processing and online recommendation. The offline module labels all the music into different categories, by which the music items libraries corresponding to the tags are constructed and the rating matrixs are consequently built. The online module integrates the context information, by which the matched rating matrix is retrieved. By using the collaborative filtering model with matrix completion algorithm, the music recommendations that suit the user and the situation are offered. The proposed recommendation system improves the precision of the recommendation by integration the context information of the users, and augments the online computational capability because the matrix scale is reduced by constructing the rating matrices for the music in the different tag libraries. A large number of experiments demonstrate that the proposed system is designed to be robust and effective to the music recommendation and efficient to the online recommendation for the mobile services.


2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.


2020 ◽  
Vol 8 (4) ◽  
pp. 367
Author(s):  
Muhammad Arief Budiman ◽  
Gst. Ayu Vida Mastrika Giri

The development of the music industry is currently growing rapidly, millions of music works continue to be issued by various music artists. As for the technologies also follows these developments, examples are mobile phones applications that have music subscription services, namely Spotify, Joox, GrooveShark, and others. Application-based services are increasingly in demand by users for streaming music, free or paid. In this paper, a music recommendation system is proposed, which the system itself can recommend songs based on the similarity of the artist that the user likes or has heard. This research uses Collaborative Filtering method with Cosine Similarity and K-Nearest Neighbor algorithm. From this research, a system that can recommend songs based on artists who are related to one another is generated.


2014 ◽  
Vol 610 ◽  
pp. 717-721 ◽  
Author(s):  
Yan Gao ◽  
Jing Bo Xia ◽  
Jing Jing Ji ◽  
Ling Ma

— Among algorithms in recommendation system, Collaborative Filtering (CF) is a popular one. However, the CF methods can’t guarantee the safety of the user rating data which cause private preserving issue. In general, there are four kinds of methods to solve private preserving: Perturbation, randomization, swapping and encryption. In this paper, we mimic algorithms which attack the privacy-preserving methods with randomized perturbation techniques. After leaking part of rating history of a customer, we can infer this customer’s other rating history. At the end, we propose an algorithm to enhance the system so as to avoid being attacked.


Author(s):  
G. Shahriari Mehr ◽  
M. R. Delavar ◽  
C. Claramunt ◽  
B. N. Araabi ◽  
M. R. A. Dehaqani

Abstract. In recent years, the development of the Internet plays a significant role in human's daily activities. One of the most important effects of the Internet is the change in the process of shopping. The advent of online shopping leads to establish a new channel for customers to obtain information about their desired goods and demands. Although many customers collect information from online channel, they also wish to try and search for their required goods at the stores. Besides, discovering this data leads to a new source for spatial analysis to find the users’ interests. Therefore, we can consider this data as a contextual information source for spatial analysis or primary source for recommending points of interest (POIs). In this research, our aim is to discover a relation among the users' internet searches and the goods at the stores to recommend the best store to the users. Euclidean distance is used to calculate the similarity between users' searches and the available goods at the stores. The proposed method has been implemented in the city of Tehran, capital of Iran. The results show that the users’ internet search behavior plays an essential role in the recommendation system which provides stores to the users based on the similarity among the users’ internet searches and the available goods at the stores.


2021 ◽  
Author(s):  
Mukkamala. S.N.V. Jitendra ◽  
Y. Radhika

Recommender systems play a vital role in e-commerce. It is a big source of a market that brings people from all over the world to a single place. It has become easy to access and reach the market while sitting anywhere. Recommender systems do a major role in the commerce mobility go smoothly easily as it is a software tool that helps in showing or recommending items based on user’s preferences by analyzing their taste. In this paper, we make a recommender system that would be specifically for music applications. Different people listen to different types of music, so we make note of their taste in music and suggest to them the next song based on their previous choice. This is achieved by using a popularity algorithm, classification, and collaborative filtering. Finally, we make a comparison of the built system for its effectiveness with different evaluation metrics.


Sign in / Sign up

Export Citation Format

Share Document