scholarly journals A Big Data Analysis Method Based on Modified Collaborative Filtering Recommendation Algorithms

Open Physics ◽  
2019 ◽  
Vol 17 (1) ◽  
pp. 966-974
Author(s):  
Nan Yin
Keyword(s):  
Big Data ◽  
Data Analysis ◽  
Collaborative Filtering ◽  
Execution Time ◽  
Recommendation System ◽  
Big Data Analysis ◽  
Analysis Method ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm

Abstract With the rapid development of e-commerce, collaborative filtering recommendation system has been widely used in various network platforms. Using recommendation system to accurately predict customers’ preferences for goods can solve the problem of information overload faced by users and improve users’ dependence on the network platform. Because the recommendation system based on collaborative filtering technology has the ability to recommend more abstract or difficult to describe goods in words, the research related to collaborative filtering technology has attracted more and more attention. According to the past research, in collaborative filtering algorithm, if Pearson correlation coefficient is used, errors will occur under special circumstances. In this study, the normal recovery similarity measure is used to modify the similarity value to correct the error value of a collaborative filtering recommendation algorithm. Based on this, a big data analysis method based on a modified collaborative filtering recommendation algorithm is proposed. This research implemented it in the cloud Hadoop environment, and measure the execution time with 2, 5 and 8 nodes. Then the research compared it with the execution time of a single machine, and analyze its speedup ratio and efficiency. The experimental results show that the execution time increases with the number of neighbors. When the number of nodes is 5 and 8, the execution time is greatly improved, which improves the efficiency of collaborative filtering algorithm and can cope with massive data in the future.

A Collaborative Filtering Recommendation Algorithm Combined with User and Item

2014 ◽  
Vol 513-517 ◽  
pp. 1878-1881
Author(s):  
Feng Ming Liu ◽  
Hai Xia Li ◽  
Peng Dong
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Experimental Results ◽  
Personalized Recommendation ◽  
User Evaluation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm

The collaborative filtering recommendation algorithm based on user is becoming the more personalized recommendation algorithm. But when the user evaluation for goods is very small and the user didnt evaluate the item, the commodity recommendation based on the item evaluation of user may not be accurate, and this is the sparseness in the collaborative filtering algorithm based on user. In order to solve this problem, this paper presents a collaborative filtering recommendation algorithm based on user and item. The experimental results show that this method has smaller MAE and greatly improve the quality of the recommendation in the recommendation system.

scholarly journals Optimization of English Learning Platform Based on a Collaborative Filtering Algorithm

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jiali Tang
Keyword(s):  
Collaborative Filtering ◽  
Cognitive Ability ◽  
Recommendation System ◽  
Knowledge Map ◽  
English Learning ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Learning Platform ◽  
Depth Analysis ◽  
Collaborative Filtering Algorithm

This paper provides a detailed description of the recommendation system and collaborative filtering algorithm to optimize the English learning platform through the collaborative filtering algorithm and analyses the algorithmic principles and specific techniques of collaborative filtering. After introducing the recommendation system and collaborative filtering algorithm, this paper elaborates on the theoretical basis and technical principles of the recommendation algorithm based on cognitive ability and difficulty and provides an in-depth analysis of the design and implementation of the recommendation algorithm by combining cognitive diagnosis theory, readability formula, and English knowledge map, which provides a comprehensive and solid theoretical guidance and support for the application development of the online English learning platform. The system is tested by building a Spring Cloud platform, importing actual business data, focusing on the validation of the recommendation model, and connecting the recommendation system to the formal production system to analyse the recommendation effect. Compared with the original recommendation method, the online English learning platform designed and implemented in this paper based on the cognitive ability and difficulty collaborative filtering recommendation algorithm has a better recommendation effect. The system is proved to be well designed and has certain reference and guiding value for the whole web-based online learning platform and has a broader application prospect nowadays and in the future.

The Application of Cloud Based on Latent Factor Algorithm in Personalized Recommendation

2013 ◽  
Vol 411-414 ◽  
pp. 2288-2291
Author(s):  
Jian Xi Peng ◽  
Zhi Yuan Liu
Keyword(s):  
Big Data ◽  
Collaborative Filtering ◽  
Real Time ◽  
Recommendation System ◽  
Personalized Recommendation ◽  
Massive Data ◽  
Latent Factor ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Data Environment

Recommendation system is a commercial marketing method. What more, the system could increase adhesion and satisfaction of consumers to the website which brings great commercial benefit to electronic commerce. But with big data ages coming, it makes a great challenge to real-time recommendation system. As for latent factor class collaborative filtering algorithm, a distributed constructed latent factor algorithm based on cloud is presented in this paper. The algorithm could keep collaborative filtering in good recommendation and ensure the real time in massive data environment. The simulation shows that the algorithm could achieve the recommendation efficiently and quickly. High speedup and scalability are proved.

Research on Goods Recommendation Strategy Based on Decision Tree

2014 ◽  
Vol 687-691 ◽  
pp. 2718-2721
Author(s):  
Jie Gao
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Personalized Recommendation ◽  
Test Results ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Different Types ◽  
Noise Data ◽  
Collaborative Filtering Algorithm ◽  
Recommendation Strategy

Firstly, associative-sets-based collaborative filtering algorithm is proposed. During the process of personalized recommendation, some items evaluated by users are performed by accident, in other words, they have little correlation with users' real preferences. These irrelevant items are equal to noise data, and often interfere with the effectiveness of collaborative filtering. A personalized recommendation algorithm based on Associative Sets is proposed in this paper to solve this problem. It uses frequent it sets to get associative sets, and makes recommendations according to users' real preferences, so as to enhance the accuracy of recommending results. Test results show that the new algorithm is more accurate than the traditional. Secondly, a flexible E-Commerce recommendation system is built. Traditional recommendation system is a sole tool with only one recommendation model. In e-commerce environment, commodities are very rich, personal demands are diversification; E-Commerce systems in different occasions require different types of recommended strategies. For that, we analysis the recommendation system with flexible theory, and proposed a flexible e-commerce recommendation system. It maps the implementation and demand through strategy module, and the whole system would be design as standard parts to adapt to the change of the recommendation strategy.

The Improved Collaborative Filtering Recommendation Algorithm Based on Cloud Model

2013 ◽  
Vol 411-414 ◽  
pp. 2292-2296
Author(s):  
Jia Si Gu ◽  
Zheng Liu
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Cloud Model ◽  
Personalized Recommendation ◽  
Test Results ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Model Based ◽  
Collaborative Filtering Algorithm

The traditional collaborative filtering algorithm has a better recommendation quality and efficiency, it has been the most widely used in personalized recommendation system. Based on the traditional collaborative filtering algorithm,this paper considers the user interest diversity and combination of cloud model theory.it presents an improved cloud model based on collaborative filtering recommendation algorithm.The test results show that, the algorithm has better recommendation results than other kinds of traditional recommendation algorithm.

scholarly journals A New Recommendation Algorithm Based on User’s Dynamic Information in Complex Social Network

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Jiujun Cheng ◽  
Yingbo Liu ◽  
Huiting Zhang ◽  
Xiao Wu ◽  
Fuzhen Chen
Keyword(s):  
Social Network ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Cold Start ◽  
Dynamic Information ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Response Information ◽  
Collaborative Filtering Algorithm ◽  
Information Dynamic

The development of recommendation system comes with the research of data sparsity, cold start, scalability, and privacy protection problems. Even though many papers proposed different improved recommendation algorithms to solve those problems, there is still plenty of room for improvement. In the complex social network, we can take full advantage of dynamic information such as user’s hobby, social relationship, and historical log to improve the performance of recommendation system. In this paper, we proposed a new recommendation algorithm which is based on social user’s dynamic information to solve the cold start problem of traditional collaborative filtering algorithm and also considered the dynamic factors. The algorithm takes user’s response information, dynamic interest, and the classic similar measurement of collaborative filtering algorithm into account. Then, we compared the new proposed recommendation algorithm with the traditional user based collaborative filtering algorithm and also presented some of the findings from experiment. The results of experiment demonstrate that the new proposed algorithm has a better recommended performance than the collaborative filtering algorithm in cold start scenario.

A Collaborative Filtering Recommendation Algorithm Based on Time Weight

2010 ◽  
Vol 159 ◽  
pp. 667-670
Author(s):  
Yae Dai
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Nearest Neighbor ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Web Based ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Time Periods ◽  
Filtering Approach

Personalized recommendation systems are web-based systems that aim at predicting a user’s interest on available products and services by relying on previously rated items and dealing with the problem of information and product overload. Collaborative filtering algorithm is one of the most successful technologies for building personalized recommendation system. But traditional collaborative filtering algorithm does not consider the problem of drifting users interests and the nearest neighbor user set in different time periods, leading to the fact that neighbors may not be the nearest set. In view of this problem, a collaborative filtering recommendation algorithm based on time weight is presented. In the algorithm each rating is assigned a weight gradually decreasing along with time and the weighted rating is used to produce recommendation. The collaborative filtering approach based on time weight not only reduced the data sparsity, but also narrowed the area of the nearest neighbor.

scholarly journals Data-Intensive Task Scheduling for Heterogeneous Big Data Analytics in IoT System

Energies ◽  
2020 ◽  
Vol 13 (17) ◽  
pp. 4508
Author(s):  
Xin Li ◽  
Liangyuan Wang ◽  
Jemal H. Abawajy ◽  
Xiaolin Qin ◽  
Giovanni Pau ◽  
...  
Keyword(s):  
Big Data ◽  
Data Analysis ◽  
Task Scheduling ◽  
Execution Time ◽  
Data Centers ◽  
Big Data Analysis ◽  
Data Locality ◽  
Data Migration ◽  
Task Execution ◽  
Task Execution Time

Efficient big data analysis is critical to support applications or services in Internet of Things (IoT) system, especially for the time-intensive services. Hence, the data center may host heterogeneous big data analysis tasks for multiple IoT systems. It is a challenging problem since the data centers usually need to schedule a large number of periodic or online tasks in a short time. In this paper, we investigate the heterogeneous task scheduling problem to reduce the global task execution time, which is also an efficient method to reduce energy consumption for data centers. We establish the task execution for heterogeneous tasks respectively based on the data locality feature, which also indicate the relationship among the tasks, data blocks and servers. We propose a heterogeneous task scheduling algorithm with data migration. The core idea of the algorithm is to maximize the efficiency by comparing the cost between remote task execution and data migration, which could improve the data locality and reduce task execution time. We conduct extensive simulations and the experimental results show that our algorithm has better performance than the traditional methods, and data migration actually works to reduce th overall task execution time. The algorithm also shows acceptable fairness for the heterogeneous tasks.

Sign in / Sign up

Export Citation Format

Share Document