scholarly journals Research on Recommendation of Personalized Exercises in English Learning Based on Data Mining

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Lina Zhou ◽  
Chunxia Wang

Aiming at the problems of traditional method of exercise recommendation precision, recall rate, long recommendation time, and poor recommendation comprehensiveness, this study proposes a personalized exercise recommendation method for English learning based on data mining. Firstly, a personalized recommendation model is designed, based on the model to preprocess the data in the Web access log, and cleaning the noise data to avoid its impact on the accuracy of the recommendation results is focused; secondly, the DINA model to diagnose the degree of mastery of students’ knowledge points is used and the students’ browsing patterns through fuzzy similar relationships are clustered; and finally, according to the clustering results, the similarity between students and the similarity between exercises are measured, and the collaborative filtering recommendation of personalized exercises for English learning is realized. The experimental results show that the exercise recommendation precision and recall rate of this method are higher, the recommendation time is shorter, and the recommendation results are comprehensive.

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.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Kunni Han

Faced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user’s interest points according to the user’s behavior habits, thereby recommending the news that may be of interest to the user. In this paper, improvements are made to the data preprocessing stage and the nearest neighbor collection stage of the collaborative filtering algorithm. In the data preprocessing stage, the user-item rating matrix is filled to alleviate its sparsity. The label factor and time factor are introduced to make the constructed user preference model have a better expression effect. In the stage of finding the nearest neighbor set, the collaborative filtering algorithm is combined with the dichotomous K-means algorithm, the user cluster matching the target user is selected as the search range of the nearest neighbor set, and the similarity measurement formula is improved. In order to verify the effectiveness of the algorithm proposed in this paper, this paper selects a simulated data set to test the performance of the proposed algorithm in terms of the average absolute error of recommendation, recommendation accuracy, and recall rate and compares it with the user-based collaborative filtering recommendation algorithm. In the simulation data set, the algorithm in this paper is superior to the traditional algorithm in most users. The algorithm in this paper decomposes the sparse matrix to reduce the impact of data sparsity on the traditional recommendation algorithm, thereby improving the recommendation accuracy and recall rate of the recommendation algorithm and reducing the recommendation error.


2014 ◽  
Vol 687-691 ◽  
pp. 2718-2721
Author(s):  
Jie Gao

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.


Author(s):  
Jon T.S. Quah ◽  
Winnie C.H. Leow ◽  
K. L. Yong

This project experiments with the designing of a Web site that has the self-adaptive feature of generating and adapting the site contents dynamically to match visitors’ tastes based on their activities on the site. No explicit inputs are required from visitors. Instead a visitor’s clickstream on the site will be implicitly monitored, logged, and analyzed. Based on the information gathered, the Web site would then generate Web contents that contain items that have certain relatedness to items that were previously browsed by the visitor. The relatedness rules will have multidimensional aspects in order to produce cross-mapping between items. The Internet has become a place where a vast amount of information can be deposited and also retrieved by hundreds of millions of people scattered around the globe. With such an ability to reach out to this large pool of people, we have seen the expulsion of companies plunging into conducting business over the Internet (e-commerce). This has made the competition for consumers’ dollars fiercely stiff. It is now insufficient to just place information of products onto the Internet and expect customers to browse through the Web pages. Instead, e-commerce Web site designing is undergoing a significant revolution. It has become an important strategy to design Web sites that are able to generate contents that are matched to the customer’s taste or preference. In fact a survey done in 1998 (GVU, 1998) shows that around 23% of online shoppers actually reported a dissatisfying experience with Web sites that are confusing or disorganized. Personalization features on the Web would likely reverse this dissatisfaction and increase the likelihood of attracting and retaining visitors. Having personalization or an adaptive site can bring the following benefits: 1. Attract and maintain visitors with adaptive contents that are tailored to their taste. 2. Target Web contents correspondingly to their respective audience, thus reducing information that is of no interest to the audience. 3. Advertise and promote products through marketing campaigns targeting the correct audience. 4. Enable the site to intelligently direct information to a selective or respective audience. Currently, most Web personalization or adaptive features employ data mining or collaborative filtering techniques (Herlocker, Konstan, Borchers, & Riedl, 1999; Mobasher, Cooley, & Srivastava, 1999; Mobasher, Jain, Han, & Srivastava, 1997; Spiliopoulou, Faulstich, & Winkler, 1999) which often use past historical (static) data (e.g., previous purchases or server logs). The deployment of data mining often involves significant resources (large storage space and computing power) and complicated rules or algorithms. A vast amount of data is required in order to be able to form recommendations that made sense and are meaningful in general (Claypool et al., 1999; Basu, Hirsh, & Cohen, 1998). While the main idea of Web personalization is to increase the ‘stickiness’ of a portal, with the proven presumption that the number of times a shopper returns to a shop has a direct relationship to the likelihood of resulting in business transactions, the method of achieving the goal varies. The methods range from user clustering and time framed navigation sessions analysis (Kim et al., 2005; Wang & Shao, 2004), analyzing relationship between customers and products (Wang, Chuang, Hsu, & Keh, 2004), performing collaborative filtering and data mining on transaction data (Cho & Kim, 2002, 2004; Uchyigit & Clark, 2002; Jung, Jung, & Lee, 2003), deploying statistical methods for finding relationships (Kim & Yum, 2005), and performing recommendations bases on similarity with known user groups (Yu, Liu, & Li, 2005), to tracking shopping behavior over time as well as over the taxonomy of products. Our implementation works on the premise that each user has his own preferences and needs, and these interests drift over time (Cho, Cho, & Kim, 2005). Therefore, besides identifying users’ needs, the system should also be sensitive to changes in tastes. Finally, a truly useful system should not only be recommending items in which a user had shown interest, but also related items that may be of relevance to the user (e.g., buying a pet => recommend some suitable pet foods for the pet, as well as suggesting some accessories that may be useful, such as fur brush, nail clipper, etc.). In this aspect, we borrow the concept of ‘category management’ use in the retailing industry to perform classification as well as linking the categories using shared characteristics. These linkages provide the bridge for cross-category recommendations.


2014 ◽  
Vol 1044-1045 ◽  
pp. 1484-1488
Author(s):  
Yue Kun Fan ◽  
Xin Ye Li ◽  
Meng Meng Cao

Currently collaborative filtering is widely used in e-commerce, digital libraries and other areas of personalized recommendation service system. Nearest-neighbor algorithm is the earliest proposed and the main collaborative filtering recommendation algorithm, but the data sparsity and cold-start problems seriously affect the recommendation quality. To solve these problems, A collaborative filtering recommendation algorithm based on users' social relationships is proposed. 0n the basis of traditional filtering recommendation technology, it combines with the interested objects of user's social relationship and takes the advantage of the tags to projects marked by users and their interested objects to improve the methods of recommendation. The experimental results of MAE ((Mean Absolute Error)) verify that this method can get better quality of recommendation.


Sign in / Sign up

Export Citation Format

Share Document