Collaborative Filtering Recommendation Algorithm Research Articles

Quantum Nearest Neighbor Collaborative Filtering Algorithm for Recommendation System

Recommendation has become especially crucial during the COVID-19 pandemic as a significant number of people rely on online shopping from home. Existing recommendation algorithms, designed to address issues like cold start and data sparsity, often overlook the time constraints of users. Specifically, users expect to receive recommendations for products of interest in the shortest possible time. To address this challenge, we propose a novel collaborative filtering recommendation algorithm that leverages the advantages of quantum computing circuits based on data reconstruction. This approach allows for the rapid identification of users similar to the target user, thereby improving recommendation speed. In our method, we utilize the information of known users to linearly reconstruct that of the target users, forming a relational matrix. Subsequently, we employ \(l_{2,1}-\) norm and \(l_{1}-\) norm to sparsely constrain the relationship matrix, deducing the weight of each known user. The final step involves providing similar recommendations to target users based on these weights. Furthermore, we implement the proposed algorithm using a quantum circuit, enabling exponential acceleration. The final weight matrix is derived from the quantum state outputted by the circuit. The speed of this process is theoretically demonstrated in detail. Experimental results indicate that our algorithm outperforms state-of-the-art methods in terms of root mean squared error (RMSE), mean absolute error (MAE) and normalized discounted cumulative gain (NDCG). Compared to state-of-the-art comparison algorithms, the proposed algorithm achieves the fastest recommendation speed across eight public datasets.

Multiple Constraint Hybrid Travel Route Recommendation Model Based on Collaborative Filtering Recommendation Algorithm

The study presents a hybrid model for recommending travel routes that takes into account multiple constraints. This model is based on a collaborative filtering recommendation algorithm and addresses the issue of disorganized travel route recommendations. To improve upon the k-mean clustering algorithm, the proposed model introduces the Dynamic Gaussian Kernel Density K-means algorithm. After the data was processed, the initial clustering center was determined and k-means clustering was performed. Subsequently, the travel route recommendation model was created by integrating various constraints. The study’s proposed algorithm was compared with alternative algorithms, and the experimental results demonstrated superior performance across a range of datasets, with the minimum sum of squared errors and a running time of approximately 1.4 seconds - a noteworthy improvement. Comparative experiments were conducted on various forgetting coefficients in the model, and the forgetting coefficient with the lowest sum-of-squares of errors was selected to replace the existing one. Upon comparing the proposed research model with other models, it was found that the former had greater accuracy and recall, amounting to 98.1% and 96.8% respectively. This suggests that the proposed research model serves as a more efficient solution for travel route recommendation.

Research on Computer-aided Innovation and Entrepreneurship Education Model and Algorithm

Abstract With the rapid development of science and technology, computer-aided technology has been widely used in the field of education, but in the field of innovation and entrepreneurship education (Hereinafter referred to as IEE), there are still problems such as uneven distribution of resources and the disconnection between teaching content and actual needs. This paper puts forward a new model framework of computer-aided IEE, which is student-centered and practice-oriented. Through clear teaching objectives, rich course content, diverse teaching methods, and a scientific evaluation system, students’ innovative consciousness and entrepreneurial ability are comprehensively improved. The course covers innovative thinking, business models, market research, and other theoretical knowledge, and introduces virtual reality (VR) and augmented reality (AR) technologies to simulate the real entrepreneurial process and provide a practical platform. In the aspect of algorithm application, the research combines the content recommendation algorithm and collaborative filtering recommendation algorithm, constructs accurate user portraits by analyzing students’ learning behavior data, and matches them according to the characteristics of learning resources to recommend personalized learning resources for students. At the same time, the learning path optimization algorithm is developed, and the personalized and efficient learning path is planned by using the shortest path algorithm in graph theory to ensure that students can master the required knowledge in the shortest time. The experimental part designed a one-semester teaching experiment, and compared the differences between the experimental group and the control group in academic performance, learning participation, and satisfaction. The results show that the computer-aided IEE model significantly improves students’ academic performance, learning participation, and satisfaction, which verifies the effectiveness of the model. The research on the model and algorithm of computer-aided IEE proposed in this paper provides new ideas and methods for IEE, and helps to cultivate more high-quality talents with innovative thinking and entrepreneurial ability.

Exploration and Practice of Digital Teaching Innovation Path for Art Majors in the Information Age

Abstract This paper proposes a digital teaching innovation path for art majors and builds a digital teaching innovation technology framework with digital teaching resource management and online and offline blended teaching as the main modules. In digital teaching resource management, a SCORM digital teaching resource management model is constructed, and a resource recommendation algorithm is designed in combination with a collaborative filtering recommendation algorithm. In blended teaching, a meta-learning recommendation algorithm is utilized to complete the design of a teaching system for CDIO. Finally, experimental classes and control classes were set up to carry out digital teaching practices using the Fine Arts Painting major at University A in Zhejiang Province, China, as the research object. In the analysis of students’ learning behavior performance, the score of students in the experimental class was 4.373 points higher than that of the control class, with a significant difference (P<0.05). The total drawing performance score of the experimental class students was 78.45, and the overall drawing performance was satisfactory. In the analysis of students’ learning performance scale, all the index values of the experimental class were higher than those of the control class. In terms of teachers’ teaching behavior performance, except for teaching monitoring behavior, the experimental class showed significant differences from the control class in all other teaching behavior factors.

Construction and Sharing Mechanism of Digital Vocal Music Teaching Resource Library

Abstract With the rapid development of information technology, the construction and sharing mechanism of the teaching resource base has become an important means of informatization of vocal music education. The article proposes the construction and sharing of a personalized teaching resource system based on a collaborative filtering recommendation algorithm, constructs a personalized recommendation module through the study of collaborative filtering, and further improves the personalized recommendation algorithm. Then, it elaborates on the relevant contents of user interest modeling, records and manages the user's interest, describes the user's potential interest needs, records the user's behavior by building a model, and finally analyzes the application of the teaching resource library. When the boundary value of request concurrency does not exceed 1000, the response time of the teaching resource library page is no more than 2.5 seconds. When the teaching resource library is used to process a file of 100MB size, the upload speed of the WebSocket method is 153s faster than FancyUpload. More than 70% of the students think that the use of the teaching resource library in the vocal music class can greatly enhance the effect of vocal music learning.

An empirical study on the construction of sample branches in colleges and universities in promoting the development of students’ subjectivity

Abstract The development of student subjectivity constitutes a crucial dimension in achieving the comprehensive growth of students. This study examines the role of constructing model branches within higher education institutions and explores their influence on fostering student subjectivity. To this end, an enhanced K-means clustering algorithm, augmented by a particle swarm optimization technique, is employed to process the data of college students, thereby facilitating the development of model branches in these institutions. Additionally, the initial warning feature matrix within the collaborative filtering recommendation algorithm is applied to quantitatively assess student characteristic factors in the establishment of model branches, enabling the creation of an early warning system. The effect of model branch construction on the evolution of student subjectivity is subsequently analyzed through Gaussian process regression and partial least squares regression methods. The findings indicate that the extent of model branch development significantly impacts student subjectivity. Specifically, the average development level of student subjectivity in institutions with high-level model branches surpasses that in institutions lacking such structures by 17.255 points. Thus, the establishment of high-level model branches in colleges and universities emerges as a vital strategy to enhance student subjectivity and promote balanced and holistic student development.

The Path of Digital Construction of Civics and Politics in Professional Course Curriculum of Higher Vocational Colleges and Universities Based on the Concept of OBE

Abstract This paper explores the principle of deep reinforcement learning algorithm application and constructs the digital teaching model of Civics through the recurrent neural network, Markov decision process, Actor-Critic algorithm and collaborative filtering recommendation algorithm. On this basis, the state representation model and decision-making model are invoked to improve the diversity optimization recommendation of the deep reinforcement learning algorithm. Aiming at the problems existing in the practical application of the OBE concept, the model constructed in this paper is utilized to propose a multi-platform integration of the Civics digital learning model. The objective of empirical and simulation experiments is to confirm the model’s implementation and recommendation effects, respectively. In the validation of hyperparameter d and N values, the DQN model achieves the optimal recommendation effect when the d values are 65 and 63 on the HetRec and MovieTweetings datasets. During the implementation of the digital teaching evaluation of the course Civics, more than 60% of the students rated the teacher’s feedback session higher. Overall, the 6 dimensions were rated higher, and the number of students who chose to be fully compliant and conforming was more than 200.

The Path of Civic Education and Intelligent Strategies for Counselors in the Background of Artificial Intelligence

Abstract In this paper, starting from Civic Education under the conditions of artificial intelligence application, an intelligent platform for counselors is constructed as a path for Civic Education, in which Spark’s big data platform is used to collect and organize the data. A collaborative filtering recommendation algorithm with a hybrid self-coding network model is proposed, and a recommendation service framework is built based on this algorithm and recommendation algorithm evaluation index to realize personalized recommendations of educational resources. The empirical analysis was conducted for the platform constructed in this paper, and the results showed that the intelligent platform for counselors and the learning analytics platform were used by most teachers of college Civics courses, accounting for 55.64% and 43.25%, respectively, and compared with the traditional teaching mode, the intelligent platform teaching was more popular among teachers and students.

Numerical analysis-oriented Kruskal algorithm for the analysis and integration of effective components of university music pedagogy

Abstract This paper constructs a collection of effective teaching methods based on the improved K-Means clustering algorithm for clustering and dividing effective components of music teaching in colleges and universities. By analyzing the personalized content recommendation system, we can construct a recommendation system based on teaching content using information retrieval and filtering techniques. The collaborative filtering recommendation algorithm is used to ensure the accurate placement of teaching content. The Kruskal algorithm is used to find the minimum spanning tree of teaching effective components, and the K-means clustering principle is applied to the division of music teaching effective components, and the cluster of effective teaching components is divided by the clustering algorithm. According to the findings, mind-body integration and the teaching goal of valuing creativity were classified as effective teaching components in music. Personal aesthetics had a 0.6 influence on musical creativity, and a free environment had a 0.3 influence.

Exploring the Innovation Practice of Teaching Civics Education in Universities in the Network Era

Abstract One of the key difficulties confronting universities today is how to use the current technology to raise educational standards and support educational reform. This is due to the ongoing growth of network technology. This study primarily explores the collaborative filtering recommendation algorithm-based recommendation model for college civics teaching materials. Analyzed are both the functional and non-functional demands for collegiate civic and political science teaching materials. For these requirements, the collaborative filtering recommendation algorithm is put out, and it is enhanced so that it may be applied in real-world settings. In order to execute the model, the system architecture and process are established, and the impacts of teaching interventions are used to examine the outcomes of the suggested practical teaching of civic and political science teaching materials in colleges and universities. The findings revealed that the p-values of the significance probabilities were, respectively, 0.056, 0.007, and 0.235 for the entrance exam and the first semester final examination, the entrance examination and the second semester final examination, and the first semester final examination and the second semester final examination. The collaborative filtering recommendation algorithm-based recommendation model for teaching resources recommendation of university thinking and politics proposed in this paper is effective in enhancing students’ learning autonomy and promoting the exchange of ideas. It has a certain effect.

Research on the integration path of cultural creative industry and tourism industry based on collaborative filtering recommendation algorithm

Abstract In order to increase regional economic benefits and attract more tourists for local economic development. This paper adopts different ways to evolve industrial integration, enrich and expand the theoretical system of the industrial economy, establish new tourism strategies to meet personalized and diversified needs and make the tourism sector achieve industrial integration. Useful data are selected to filter cultural and creative, and tourism industry information by mining hidden information of coding sequences and finding support data items. Using collaborative filtering recommendation method to obtain the preference degree of fused data items, populate the data according to behavioral speculation, calculate the utility matrix similarity, and clarify the development of industry fusion path in the context of big data. The results show that the average error rate after fusion does not exceed 4%, and the fusion path of cultural and creative industries and the tourism industry improve the regional economy and the overall local living conditions.

Weight prediction and recognition of latent subject terms based on the fusion of explicit & implicit information about keyword

Weight prediction and recognition of subject term in documents is widely used in application fields such as literature recommendation and keyword retrieval. Unlike traditional methods which only focus on searching for subject terms from existing keywords in documents, this paper proposes a recognition method of latent subject term outside documents based on a one-class collaborative filtering algorithm that fuses explicit and implicit information. A matrix factorization model based on the analysis of document activity and subject term popularity is constructed to measure the correlation probability between documents and subject terms that do not appear in the current document. After these subject terms being divided into Latent Subject Terms (LST) and Irrelevant Subject Terms (IST), two methods for predicting the weight of these types of subject terms is introduced, which include Hybrid Filling with Preference Coefficients (HFPC), and Zero Filling. In order to verify the effectiveness of subject term recognition, many collaborative filtering recommendation algorithms are conducted with the filled document keyword matrix. On the basis of not changing these algorithms, MAE and FCP can be improved by 28.01% and 22.79% at most, while P@N and NDCG@N can be improved by 22.37% and 27.06%, respectively.

Research on the innovation of ideological and political education for college students based on the Civic and Political Science Cloud Education Platform

Abstract Innovative ideological and political education for college students is to help better students improve their ideological quality and political literacy. In this paper, under the background of big data, the Civic and Political Cloud Education Platform is constructed using big data technology, which is mainly composed of four main parts: model layer, view layer, control layer, and basic services. Student behavior data is collected and analyzed through a collaborative filtering recommendation algorithm under big data collection and analysis technology, and performance simulation analysis is conducted for the Civic and Political Science Cloud Education Platform. From the performance analysis, when the number of concurrent users of the Civic Education Cloud Platform is 80-120, the average transaction processing per second is stable at 10.5 s. From the practicality, the Civic Education Cloud Platform built by big data can effectively explore the value of Civic Education teaching resources. This shows that the Civic and Political Science cloud education platform is an effective way to innovate and develop the ideological and political education of college students, and through this platform, the ideological quality and political literacy of college students can be effectively improved.

Retracted: Intelligent Sports Auxiliary Training Method Based on Collaborative Filtering Recommendation Algorithm

Retracted: Intelligent Sports Auxiliary Training Method Based on Collaborative Filtering Recommendation Algorithm

Analysis of media content recommendation in the new media era considering scene clustering algorithm

Abstract With the advent of the new media era, we face the problem of information overload every day, based on which this paper proposes a scenario-conscious clustering algorithm for recommending media content. The improved K-means algorithm is used to cluster the media content, an initial cluster center is randomly selected, and the remaining initial cluster centers are obtained by executing the improved algorithm to reduce the number of iterations and avoid neighboring situations. The clustering algorithm is then compared with content-based recommendation techniques, KNN recommendation algorithm, and collaborative filtering recommendation algorithm in terms of accuracy, recall, MAE value, and execution time. The clustering algorithm is significantly better than the other algorithms regarding accuracy and recall. The accuracy of the clustering algorithm is 0.4 when the recommendation sequence is 30, which is 0.4 higher than the collaborative filtering technique, 0.1 higher than the KNN, and 0.12 higher than the content recommendation method. In terms of MAE value, the clustering algorithm outperforms the other algorithms when the number of nearest neighbors is selected to be above 20. In terms of execution time, the longer the amount of data, the more obvious the advantage of the clustering algorithm. Therefore, the applicability and reliability of the model proposed in this paper for media content recommendation are verified in terms of accuracy, recall and execution time, which meet the design requirements.

Research on personalized recommendation method of preschool e-learning resources

Abstract E-learning is a very popular learning method at this stage, and Internet learners need to invest much time to retrieve the required e-learning network resources. In building the existing e-learning resources, the cognitive level, thinking ability, learning style, and other factors of learners are not considered. For this challenge, the paper gives the recommendation methods of the collaborative filtering algorithm model and learner model, compares the advantages and disadvantages of these models and traditional recommendation methods using the data of mean square error, response time, and accuracy, and examines the students’ suggestions for this recommendation method in the field. The collaborative filtering recommendation technique had the highest completion rate, above 0.7 for 5-20 recommendations and above 0.75 and 0.8 for 20-35. The rate of the learner model is stable between 0.7 and 0.8. In contrast, the detection rate of traditional methods is between 0.6 and 0.7. The collaborative filtering recommendation method outperforms the other two methods regarding completeness, response time, accuracy, and F1 value. In terms of satisfaction, the collaborative filtering recommendation algorithm had the highest satisfaction rate, followed by the learner model; the collaborative filtering method had the best results in improving learning performance. Therefore, personalized recommendation methods can improve learning efficiency and reduce retrieval time, and the collaborative filtering recommendation method is the most effective among the two methods proposed in this paper.

Film and television art innovation in network environment by using collaborative filtering recommendation algorithm

Film and television art innovation in network environment by using collaborative filtering recommendation algorithm

Analyzing the misleading information on Covid-19 using MBCFWS4

The COVID-19 pandemic had a major effect on almost every area of human lives in the majority of the world's countries. Misinformation spreads quickly in the initial phases of the COVID-19 pandemic in different forms, such as fear, distortion, contraindication assumption, and others. False and misleading advertisements harm millions of individuals. In recent research, there are more advanced techniques have been used to address the misinformation about the COVID-19 pandemic. But they are self-reported and probabilistic data during the lockdown period. So, it was difficult to find the respondents' perceptions based on sharing the COVID-19 misinformation. This proposed work analyzed and filtered some optimized factors to analyze the misinformation such as fake reports, fake remedies, conspiracy, susceptibility, vaccine rumors, social media, vitamin D prevents corona, political corona, socio-Economic, and more side effects after getting vaccinated. Collaborative filtering (CF) is the most efficient recommender system, and it is extensively utilized by a broad range of research institutions and enterprises, as well as being used in practice. It consists of two types of CF namely Memory-based CF and Model-based CF. In this work, Memory-based CF recommendation algorithm is combined with a similarity measure called MBCFWS4 to analyze the similarity measure between the factors to conclude the most impact factor. The Primary and secondary dataset helps to identify the respondents' perception based on the COVID-19 misinformation. The efficiency comparison of the proposed work is measured in terms of Precision, Recall & F-measure and found that this analysis using MBCFWS4 is outperforming well than the others as MBCFWS4 predicted accurately and revealed the conclusion based on the COVID-19 misinformation.

Personalized Movie Recommendations Based on a Multi-Feature Attention Mechanism with Neural Networks

With the rapid growth of the Internet, a wealth of movie resources are readily available on the major search engines. Still, it is unlikely that users will be able to find precisely the movies they are more interested in any time soon. Traditional recommendation algorithms, such as collaborative filtering recommendation algorithms only use the user’s rating information of the movie, without using the attribute information of the user and the movie, which has the problem of inaccurate recommendations. In order to achieve personalized accurate movie recommendations, a movie recommendation algorithm based on a multi-feature attention mechanism with deep neural networks and convolutional neural networks is proposed. In order to make the predicted movie ratings more accurate, user attribute information and movie attribute information are added, user network and movie network are presented to learn user features and movie features, respectively, and a feature attention mechanism is proposed so that different parts contribute differently to movie ratings. Text features are also extracted using convolutional neural networks, in which an attention mechanism is added to make the extracted text features more accurate, and finally, personalized movie accurate recommendations are achieved. The experimental results verify the effectiveness of the algorithm. The user attribute features and movie attribute features have a good effect on the rating, the feature attention mechanism makes the features distinguish the degree of importance to the rating, and the convolutional neural network adding the attention mechanism makes the extracted text features more effective and achieves high accuracy in MSE, MAE, MAPE, R2, and RMSE indexes.

A Personalized Recommendation Algorithm for Semantic Classification of New Book Recommendation Services for University Libraries

With the rapid development of information technology and the Internet, it is difficult for university readers to find books of real interest or value from a large number of books by relying only on traditional retrieval-based services. This paper applies data mining technology and personalized recommendation algorithm based on semantic classification for new book recommendation service in university libraries. The personalized recommendation algorithm based on semantic classification establishes a book feature model and a reader preference model based on title keywords. The different recommendation strategies in the system framework are detailed. For the borrowing data of different colleges and departments, the improved association rule algorithm is used to mine the book association rules, and the reader’s borrowing history is matched with the association rules to generate a book recommendation list; according to the reader’s borrowing preference characteristics, the reader preference model is used as the basis. Class subdivision and then combined with the book feature model and reader preference model, the collaborative filtering recommendation algorithm and the content-based recommendation algorithm are applied to generate a book recommendation list. The active service method not only improves the service level of the university library, makes the development of the university library more comprehensive and humanized but also explores the potential information needs of readers, improves the borrowing rate of books in the collection, and maximizes the utilization rate of book resources. In the experiment of this paper, the personalized recommendation algorithm division of semantic classification is adopted. According to the division of its algorithm, the corpus is divided into 9603 training documents and 3299 test documents, with certain accuracy.