In view of the poor recommendation performance of traditional resource collaborative filtering recommendation algorithms, this article proposes a collaborative filtering recommendation model based on deep learning for art and MOOC resources. This model first uses embedding vectors based on the context of metapaths for learning. Embedding vectors based on the context of metapaths aggregate different metapath information and different MOOCs may have different preferences for different metapaths. Secondly, to capture this preference drift, the model introduces an (...) attention mechanism, which can improve the interpretability of the recommendation results. Then, by introducing the Laplacian matrix into the prior distribution of the hidden factor feature matrix, the relational network information is effectively integrated into the model. Finally, compared with the traditional model using the scoring matrix, the model in this article using text word vectors effectively alleviates the impact of data sparsity and greatly improves the accuracy of prediction. After analyzing the experimental results, compared with other algorithms, the resource collaborative filtering recommendation model proposed in this article has achieved better recommendation results, with good stability and scalability. (shrink)

In this study, we focus on the problem of information expiration when using the traditional collaborative filtering algorithm and propose a new collaborative filtering algorithm by integrating the time factor. This algorithm considers information influence attenuation over time, introduces an information retention period based on the information half-value period, and proposes a time-weighted function, which is applied to the nearest neighbor selection and score prediction to assign different time weights to the scores. In addition, to further (...) improve the quality of the nearest neighbor selection and alleviate the problem of data sparsity, a method of calculating users’ sentiment tendency by analysis of user review features is proposed to mine users’ attitudes about the reviewed items, which expands the score matrix. The time factor and sentiment tendency are then integrated into the K-means clustering algorithm to select the nearest neighbor. A hybrid collaborative filtering model based on the improved K-means clustering algorithm is then proposed, by combining item-based and user-based collaborative filtering. Finally, the experimental results show that the proposed algorithm can address the time effect and sentiment analysis in recommendations and improve the predictive performance of the model. (shrink)

When Artificial Intelligence (AI) is applied in decision-making that affects people’s lives, it is now well established that the outcomes can be biased or discriminatory. The question of whether algorithms themselves can be among the sources of bias has been the subject of recent debate among Artificial Intelligence researchers, and scholars who study the social impact of technology. There has been a tendency to focus on examples, where the data set used to train the AI is biased, and denial on (...) the part of some researchers that algorithms can also be biased. Here we illustrate the point that algorithms themselves can be the source of bias with the example of collaborative filtering algorithms for recommendation and search. These algorithms are known to suffer from cold-start, popularity, and homogenizing biases, among others. While these are typically described as statistical biases rather than biases of moral import; in this paper we show that these statistical biases can lead directly to discriminatory outcomes. The intuitive idea is that data points on the margins of distributions of human data tend to correspond to marginalized people. The statistical biases described here have the effect of further marginalizing the already marginal. Biased algorithms for applications such as media recommendations can have significant impact on individuals’ and communities’ access to information and culturally-relevant resources. This source of bias warrants serious attention given the ubiquity of algorithmic decision-making. (shrink)

Collaborative filtering is being used within organizations and in community contexts for knowledge management and decision support as well as the facilitation of interactions among individuals. This article analyzes rhetorical and technical efforts to establish trust in the constructions of individual opinions, reputations, and tastes provided by these systems. These initiatives have some important parallels with early efforts to support quantitative opinion polling and construct the notion of “public opinion.” The article explores specific ways to increase trust in (...) these systems, albeit a “guarded trust” in which individuals actively seek information about system foibles and analyze the reputations of participants. (shrink)

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. 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. (shrink)

In this paper, a personalized online education platform based on a collaborative filtering algorithm is designed by applying the recommendation algorithm in the recommendation system to the online education platform using a cross-platform compatible HTML5 and high-performance framework hybrid programming approach. The server-side development adopts a mature B/S architecture and the popular development model, while the mobile terminal uses HTML5 and framework to implement the function of recommending personalized courses for users using collaborative filtering and recommendation (...) algorithms. By improving the traditional recommendation algorithm based on collaborative filtering, the course recommendation results are more in line with users' interests, which greatly improves the accuracy and efficiency of the recommendation. On this basis, online teaching on this platform is divided into two modes: one mode is the original teacher uploads recorded teaching videos and students can learn by purchasing online or offline download; the other mode is interactive online live teaching. Each course is a separate online classroom; the teacher will publish online class information in advance, and students can purchase to get classroom number and password information online. (shrink)

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. (shrink)

In this essay, I explore ethical considerations that might arise from the use of collaborative filtering algorithms on dating apps. Collaborative filtering algorithms can predict the preferences of a target user by looking at the past behavior of similar users. By recommending products through this process, they can influence the news we read, the movies we watch, and more. They are extremely powerful and effective on platforms like Amazon and Google. Recommender systems on dating apps are (...) likely to group people by race, since they exhibit similar patterns of behavior: users on dating platforms seem to segregate themselves based on race, exclude certain races from romantic and sexual consideration, and generally show a preference for white men and women. As collaborative filtering algorithms learn from these patterns to predict preferences and build recommendations, they can homogenize the behavior of dating app users and exacerbate biased sexual and romantic behavior. (shrink)

The statistics-based method ignores the semantic constraints in the English grammar area branch training model and is unable to identify the orientation information effectively. This paper systematically discusses the close relationship between English grammar area branch training model filtering, English grammar area branch training model retrieval, and machine learning. By analyzing the role of the situation in the understanding of the English grammar area branch training model, the relationship between the English grammar area branch training model and situation model (...) and the correlation between the features of the English grammar area branch training model and situation model are determined, and then, a set of filtering methods for the English grammar area branch training model are proposed. At present, there are few research studies on bias filtering, and the method of thematic filtering is generally used, which has poor effect. This paper makes full use of the domain knowledge and adopts the semantic pattern analysis technology to establish a wealth of semantic analysis resources, including various dictionaries, rules, and weight representation, so as to effectively filter the inclined English grammar area branch training model. The introduction of semantic data sources solves the problem of data sparsity and cold start in the traditional collaborative filtering system. In addition, in order to improve the scalability and real-time performance of the recommendation system, the data mining method is used to perform fuzzy clustering for users and projects in the offline data preprocessing stage. This paper proposes a search and filter scheme based on the orientation of the training model in English grammar area, elaborates on the details, constructs a whole set of function structure from representation to weight, and gives the experimental results, which prove that the system has a good filtering effect and is fast. Compared with the traditional statistical methods, the results are satisfactory. (shrink)

In this paper, we propose an inter-personal information sharing model among individuals based on personalized recommendations. In the proposed model, we define an information resource as shared between people when both of them consider it important --- not merely when they both possess it. In other words, the model defines the importance of information resources based on personalized recommendations from identifiable acquaintances. The proposed method is based on a collaborative filtering system that focuses on evaluations from identifiable acquaintances. (...) It utilizes both user evaluations for documents and their contents. In other words, each user profile is represented as a matrix of credibility to the other users' evaluations on each domain of interests. We extended the content-based collaborative filtering method to distinguish other users to whom the documents should be recommended. We also applied a concept-based vector space model to represent the domain of interests instead of the previous method which represented them by a term-based vector space model. We introduce a personalized concept-base compiled from each user's information repository to improve the information retrieval in the user's environment. Furthermore, the concept-spaces change from user to user since they reflect the personalities of the users. Because of different concept-spaces, the similarity between a document and a user's interest varies for each user. As a result, a user receives recommendations from other users who have different view points, achieving inter-personal information sharing based on personalized recommendations. This paper also describes an experimental simulation of our information sharing model. In our laboratory, five participants accumulated a personal repository of e-mails and web pages from which they built their own concept-base. Then we estimated the user profiles according to personalized concept-bases and sets of documents which others evaluated. We simulated inter-personal recommendation based on the user profiles and evaluated the performance of the recommendation method by comparing the recommended documents to the result of the content-based collaborative filtering. (shrink)

What are the ethics of child genital cutting? In a recent issue of the journal, Duivenbode and Padela (2019) called for a renewed discussion of this question. Noting that modern health care systems...

his is a book to broaden the mind. It brings the reader into a world only vaguely imaginable and richly enlightens it with extraordinary attention to interesting historical details. It is beautifully written and endlessly interesting.

Imagine you are casually browsing an online bookstore, looking for an interesting novel. Suppose the store predicts you will want to buy a particular novel: the one most chosen by people of your same age, gender, location, and occupational status. The store recommends the book, it appeals to you, and so you choose it. Central to this scenario is an automated prediction of what you desire. This article raises moral concerns about such predictions. More generally, this article examines the ethics (...) of artificial social cognition—the ethical dimensions of attribution of mental states to humans by artificial systems. The focus is presumptuous aim attributions, which are defined here as aim attributions based crucially on the premise that the person in question will have aims like superficially similar people. Several everyday examples demonstrate that this sort of presumptuousness is already a familiar moral concern. The scope of this moral concern is extended by new technologies. In particular, recommender systems based on collaborative filtering are now commonly used to automatically recommend products and information to humans. Examination of these systems demonstrates that they naturally attribute aims presumptuously. This article presents two reservations about the widespread adoption of such systems. First, the severity of our antecedent moral concern about presumptuousness increases when aim attribution processes are automated and accelerated. Second, a foreseeable consequence of reliance on these systems is an unwarranted inducement of interpersonal conformity. (shrink)

This paper proposes an agent community based information retrieval method, which uses agent communities to manage and look up information related to users. An agent works as a delegate of its user and searches for information that the user wants by communicating with other agents. The communication between agents is carried out in a peer-to-peer computing architecture. In order to retrieve information related to a user query, an agent uses two histories : a query/retrieved document history(Q/RDH) and a query/sender agent (...) history(Q/SAH). The former is a list of pairs of a query and retrieved documents, where the queries were sent by the agent itself. The latter is a list of pairs of a query and sender agents and shows ``who sent what query to the agent''. This is useful to find a new information source. Making use of the Q/SAH is expected to cause a collaborative filtering effect, which gradually creates virtual agent communities, where agents with the same interests stay together. Our hypothesis is that a virtual agent community reduces communication loads to perform a search. As an agent receives more queries, then more links to new knowledge are achieved. From this behavior, a ``give and take''(or positive feedback) effect for agents seems to emerge. We implemented this method with Multi-Agents Kodama which has been developed in our laboratory, and conducted preliminary experiments to test the hypothesis. The empirical results showed that the method was much more efficient than a naive method employing 'broadcast' techniques only to look up a target agent. (shrink)

Collaborative filtering recommender system (CFRS) plays a vital role in today’s e-commerce industry. CFRSs collect ratings from the users and predict recommendations for the targeted product. Conventionally, CFRS uses the user-product ratings to make recommendations. Often these user-product ratings are biased. The higher ratings are called push ratings (PRs) and the lower ratings are called nuke ratings (NRs). PRs and NRs are injected by factitious users with an intention either to aggravate or degrade the recommendations of a product. (...) Hence, it is necessary to investigate PRs or NRs and discard them. In this work, opinion mining approach is applied on textual reviews that are given by users for a product to detect the PRs and NRs. The work also examines the effect of PRs and NRs on the performance of CFRS by evaluating various measures such as precision, recall, F-measure and accuracy. (shrink)

We propose a new information sharing system, named ``BisNet'', which automatically gathers information about the bookmarks stored in users' web browsers and helps the users exchange URIs of possibly interesting web pages with others who have similar interest with them. Being different from other typical agent services that gather and provide information according to pre-registered user profiles, BisNet is expected to share more relevant information because of its use of web browser bookmarks that are actively selected and ordered by many (...) humans. To enhance the relevance of information being shared, we developed a novel algorithm for directory evaluation. This algorithm only looks at the local referential structure between bookmark directories and URIs and calculates for each directory the ``order index'' that represents how well its content URIs are put in order with a focus on specific areas of interest. Then each directory receives new URIs from other related directories with large order indexes. The repetition of such URI exchanges makes the whole directory-URI networks dynamically form directory groups according to the commonness of the URIs they refer to. Our method is unique in that it pays no attention to the actual contents of web pages, and thus is much simpler and faster than other methods based on the result of content analysis. We carried out a field trial that involved 45 people who used a prototype version of BisNet clients. The result indicated that the relevance of shared URIs positively correlated with the ``order index'' of surrounding related directories, demonstrating the effectiveness of the method we proposed. (shrink)

With the increasing volume of web services in the cloud environment, Collaborative Filtering- based service recommendation has become one of the most effective techniques to alleviate the heavy burden on the service selection decisions of a target user. However, the service recommendation bases, that is, historical service usage data, are often distributed in different cloud platforms. Two challenges are present in such a cross-cloud service recommendation scenario. First, a cloud platform is often not willing to share its data (...) to other cloud platforms due to privacy concerns, which decreases the feasibility of cross-cloud service recommendation severely. Second, the historical service usage data recorded in each cloud platform may update over time, which reduces the recommendation scalability significantly. In view of these two challenges, a novel privacy-preserving and scalable service recommendation approach based on SimHash, named SerRecSimHash, is proposed in this paper. Finally, through a set of experiments deployed on a real distributed service quality dataset WS-DREAM, we validate the feasibility of our proposal in terms of recommendation accuracy and efficiency while guaranteeing privacy-preservation. (shrink)

An increasing number of users have been attracted by location-based social networks in recent years. Meanwhile, user-generated content in online LBSNs like spatial, temporal, and social information provides an ever-increasing chance to study the human behavior movement from their spatiotemporal mobility patterns and spawns a large number of location-based applications. For instance, one of such applications is to produce personalized point of interest recommendations that users are interested in. Different from traditional recommendation methods, the recommendations in LBSNs come with two (...) vital dimensions, namely, geographical and temporal. However, previously proposed methods do not adequately explore geographical influence and temporal influence. Therefore, fusing geographical and temporal influences for better recommendation accuracy in LBSNs remains potential. In this work, our aim is to generate a top recommendation list of POIs for a target user. Specially, we explore how to produce the POI recommendation by leveraging spatiotemporal information. In order to exploit both geographical and temporal influences, we first design a probabilistic method to initially detect users’ spatial orientation by analyzing visibility weights of POIs which are visited by them. Second, we perform collaborative filtering by detecting users’ temporal preferences. At last, for making the POI recommendation, we combine the aforementioned two approaches, that is, integrating the spatial and temporal influences, to construct a unified framework. Our experimental results on two real-world datasets indicate that our proposed method outperforms the current state-of-the-art POI recommendation approaches. (shrink)

This paper examines the paradoxical transparency involved in training machine-learning models. Existing literature typically critiques the opacity of machine-learning models such as neural networks or collaborative filtering, a type of critique that parallels the black-box critique in technology studies. Accordingly, people in power may leverage the models’ opacity to justify a biased result without subjecting the technical operations to public scrutiny, in what Dan McQuillan metaphorically depicts as an “algorithmic state of exception”. This paper attempts to differentiate the (...) black-box abstraction that wraps around complex computational systems from the opacity of machine-learning models. It contends that the degree of asymmetry in knowledge is greater in the former than the latter. In the case of software systems, software codes are difficult to understand as only software experts with sufficient domain knowledge are equipped to formulate a sound critique. In contrast, the meanings of trained parameters in a machine-learning model are obscure even to the data scientists who configure and train the model. Hence, the asymmetry of knowledge lies only in how data examples are collected, the choice and configuration of machine-learning models, and the specification of features in model design. Under the trend of algorithmic decision-making proliferating with machine-learning heuristics, the paper contends that the more symmetric distribution of knowledge in machine learning could lead to a more transparent production process if proper policies are in place. (shrink)

Point-of-interest recommendations are a popular form of personalized service in which users share their POI location and related content with their contacts in location-based social networks. The similarity and relatedness between users of the same POI type are frequently used for trajectory retrieval, but most of the existing works rely on the explicit characteristics from all users’ check-in records without considering individual activities. We propose a POI recommendation method that attempts to optimally recommend POI types to serve multiple users. The (...) proposed method aims to predict destination POIs of a user and search for similar users of the same regions of interest, thus optimizing the user acceptance rate for each recommendation. The proposed method also employs the variable-order Markov model to determine the distribution of a user’s POIs based on his or her travel histories in LBSNs. To further enhance the user’s experience, we also apply linear discriminant analysis to cluster the topics related to “Travel” and connect to users with social links or similar interests. The probability of POIs based on users’ historical trip data and interests in the same topics can be calculated. The system then provides a list of the recommended destination POIs ranked by their probabilities. We demonstrate that our work outperforms collaborative-filtering-based and other methods using two real-world datasets from New York City. Experimental results show that the proposed method is better than other models in terms of both accuracy and recall. The proposed POI recommendation algorithms can be deployed in certain online transportation systems and can serve over 100,000 users. (shrink)

There are many studies conducted on recommendation systems, most of which are focused on recommending items to users and vice versa. Nowadays, social networks are complicated due to carrying vast arrays of data about individuals and organizations. In today’s competitive environment, companies face two significant problems: supplying resources and attracting new customers. Even the concept of supply-chain management in a virtual environment is changed. In this article, we propose a new and innovative combination approach to recommend organizational people in social (...) networks based on organizational communication and SCM. The proposed approach uses a hybrid strategy that combines basic collaborative filtering and demographic recommendation systems, using data mining, artificial neural networks, and fuzzy techniques. The results of experiments and evaluations based on a real dataset collected from the LinkedIn social network showed that the hybrid recommendation system has higher accuracy and speed than other essential methods, even substantially has eliminated the fundamental problems with such systems, such as cold start, scalability, diversity, and serendipity. (shrink)

Information is a peculiar quantity. Unlike matter and energy, which are conserved by the laws of physics, the aggregation of knowledge from many sources can in fact produce more information (synergy) or less (redundancy) than the sum of its parts. This feature can endow groups with problem‐solving strategies that are superior to those possible among noninteracting individuals and, in turn, may provide a selection drive toward collective cooperation and coordination. Here we explore the formal properties of information aggregation as a (...) general principle for explaining features of social organization. We quantify information in terms of the general formalism of information theory, which also prescribes the rules of how different pieces of evidence inform the solution of a given problem. We then show how several canonical examples of collective cognition and coordination can be understood through principles of minimization of uncertainty (maximization of predictability) under information pooling over many individuals. We discuss in some detail how collective coordination in swarms, markets, natural language processing, and collaborative filtering may be guided by the optimal aggregation of information in social collectives. We also identify circumstances when these processes fail, leading, for example, to inefficient markets. The contrast to approaches to understand coordination and collaboration via decision and game theory is also briefly discussed. (shrink)

Recommender system depends on the thoughts of numerous users to predict the favourites of potential consumers. RS is vulnerable to malicious information. Unsuitable products can be offered to the user by injecting a few unscrupulous “shilling” profiles like push and nuke attacks into the RS. Injection of these attacks results in the wrong recommendation for a product. The aim of this research is to develop a framework that can be widely utilized to make excellent recommendations for sales growth. This study (...) uses the methodology that presents an enhanced clustering algorithm named as modified density peak clustering algorithm on the consumer review dataset to ensure a well-formed cluster. An improved recurrent neural network algorithm is proposed to detect these attacks in hybrid RS, which uses the content-based RS and collaborative filtering RS. The results are compared with other state of the art algorithms. The proposed method is more suitable for E-commerce applications where the number of customers and products grows rapidly. (shrink)

One of the challenging problems in large scale cyber-argumentation platforms is that users often engage and focus only on a few issues and leave other issues under-discussed and under-acknowledged. This kind of non-uniform participation obstructs the argumentation analysis models to retrieve collective intelligence from the underlying discussion. To resolve this problem, we developed an innovative opinion prediction model for a multi-issue cyber-argumentation environment. Our model predicts users’ opinions on the non-participated issues from similar users’ opinions on related issues using intelligent (...) argumentation techniques and a collaborative filtering method. Based on our detailed experimental results on an empirical dataset collected using our cyber-argumentation platform, our model is 21.7% more accurate, handles data sparsity better than other popular opinion prediction methods. Our model can also predict opinions on multiple issues simultaneously with reasonable accuracy. Contrary to existing opinion prediction models, which only predict whether a user agrees on an issue, our model predicts how much a user agrees on the issue. To our knowledge, this is the first research to attempt multi-issue opinion prediction with the partial agreement in the cyber-argumentation platform. With additional data on non-participated issues, our opinion prediction model can help the collective intelligence analysis models to analyze social phenomena more effectively and accurately in the cyber argumentation platform. (shrink)

Streaming media server is the core system of audio and video application in the Internet; it has a wide range of applications in music recommendation. As song libraries and users of music websites and APPs continue to increase, user interaction data are generated at an increasingly fast rate, making the shortcomings of the original offline recommendation system and the advantages of the real-time streaming recommendation system more and more obvious. This paper describes in detail the working methods and contents of (...) each stage of the real-time streaming music recommendation system, including requirement analysis, overall design, implementation of each module of the system, and system testing and analysis, from a practical scenario. Moreover, this paper analyzes the current research status and deficiencies in the field of music recommendation by analyzing the user interaction data of real music websites. From the actual requirements of the system, the functional and performance goals of the system are proposed to address these deficiencies, and then the functional structure, general architecture, and database model of the system are designed, and how to interact with the server side and the client side is investigated. For the implementation of data collection and statistics module, this paper adopts Flume and Kafka to collect user behavior data and uses Spark Streaming and Redis to count music popularity trends and support efficient query. The recommendation engine module in this paper is designed and optimized using Spark to implement incremental matrix decomposition on data streams, online collaborative topic model, and improved item-based collaborative filtering algorithm. In the system testing section, the functionality and performance of the system are tested, and the recommendation engine is tested with real datasets to show the discovered music themes and analyze the test results in detail. (shrink)

This paper considers current personalized recommendation approaches based on computational social systems and then discusses their advantages and application environments. The most widely used recommendation algorithm, personalized advice based on collaborative filtering, is selected as the primary research focus. Some improvements in its application performance are analyzed. First, for the calculation of user similarity, the introduction of computational social system attributes can help to determine users’ neighbors more accurately. Second, computational social system strategies can be adopted to penalize (...) popular items. Third, the network community, identity, and trust can be combined as there is a close relationship. Therefore, this paper proposes a new method that uses a computational social system, including a trust model based on community relationships, to improve the user similarity calculation accuracy to enhance personalized recommendation. Finally, the improved algorithm in this paper is tested on the online reading website dataset. The experimental results show that the enhanced collaborative filtering algorithm performs better than the traditional algorithm. (shrink)

The purpose is to provide researchers with reliable Scientific Research Data from the massive amounts of research data to establish a sustainable Scientific Research environment. Specifically, the present work proposes establishing an Intelligent Recommendation System based on Machine Learning algorithm and SRD. Firstly, the IRS is established over ML technology. Then, based on user Psychology and Collaborative Filtering recommendation algorithm, a hybrid algorithm [namely, Content-Based Recommendation-Collaborative Filtering ] is established to improve the utilization efficiency of SRD (...) and Sustainable Development of SR. Consequently, the present work designs literature and SRD-targeted IRS using the hybrid recommendation under the background of SD. The proposed system’s feasibility is analyzed through experiments. Additionally, the system performance is analyzed and verified from accuracy, diversity, coverage, novelty, and recommendation efficiency. The results show that the hybrid algorithm can make up for the shortcomings of a single algorithm and improve the recommendation efficiency. Experiments show that the accuracy of the proposed CBR-CF algorithm is the highest. In particular, the recommendation accuracy for the single-user system can reach 82–93%, and the recall of all recommended algorithms falls between 60 and 91%. The recall of the hybrid algorithm is higher than that of a single algorithm, and the highest recall is 91%. Meanwhile, the hybrid algorithm has comprehensive coverage, good applicability, and diversity. Therefore, SD-oriented SRD-targeted IRS is of great significance to improve the SRD utilization and the accuracy of IRS, and expand the achievement value of SR. The research content provides a reference for establishing a sustainable SR environment and improving SR efficiency. (shrink)

The tendency towards an increasing integration of the informational web into our daily physical world (in particular in so-called Ambient Intelligent technologies which combine ideas derived from the field of Ubiquitous Computing, Intelligent User Interfaces and Ubiquitous Communication) is likely to make the development of successful profiling and personalization algorithms, like the ones currently used by internet companies such as Amazon , even more important than it is today. I argue that the way in which we experience ourselves necessarily goes (...) through a moment of technical mediation. Because of this algorithmic profiling that thrives on continuous reconfiguration of identification should not be understood as a supplementary process which maps a pre-established identity that exists independently from the profiling practice. In order to clarify how the experience of one’s identity can become affected by such machine-profiling a theoretical exploration of identity is made (including Agamben’s understanding of an apparatus , Ricoeur’s distinction between idem - and ipse -identity, and Stiegler’s notion of a conjunctive–disjunctive relationship towards retentional apparatuses ). Although it is clear that no specific predictions about the impact of Ambient Intelligent technologies can be made without taking more particulars into account, the theoretical concepts are used to describe three general scenarios about the way wherein the experience of identity might become affected. To conclude, I argue that the experience of one’s identity may affect whether the cases of unwarranted discrimination resulting from ubiquitous differentiations and identifications within an Ambient Intelligent environment, will become a matter of societal concern. (shrink)

With the advent of big data, the performance of traditional recommendation algorithms is no longer enough to meet the demand. Most people do not leave too many comments and other data when using the application. In this case, the user data are too scattered and discrete, with obvious data sparsity problems. First, this paper describes the main ideas and methods used in current recommendation systems and summarizes the areas that need attention and consideration. Based on these algorithms and based on (...) the user history data information and music data information that can be found now, the paper aims to build a personalized music recommendation system based on directed tags, which can provide basic music services to users and push them personalized music recommendation lists. Then, the collaborative filtering algorithm based on tags is introduced. Usually this method uses discrete tags, and the user tags and music tags are juxtaposed and leveled with each other, which does not reflect the importance and ranking order relationship of each tag and does not reflect the cognitive sequence of users when they listen to and annotate music. In order to improve this problem and increase the accuracy of recommendations, the user-tag and music-tag data are correlated through the tag sequence of tag and music-tag data are correlated and modeled analytically, and feature directed graphs are constructed. (shrink)

The user data mining was introduced into the model construction process, and the user behavior was decomposed by analyzing various influencing factors through the factorization machine learning method. In the recommendation screening stage, the collaborative filtering recommendation is combined to screen the recommendation candidate set. The idea of user-based collaborative filtering is used for reference to obtain music works favored by similar users. On the other hand, we learn from item-based CF, which ensures that the candidate (...) set covers user preference. Firstly, the user’s interest value is predicted by using dynamic interest model. Then, the common problems such as cold start and hot items processing are fully considered. The frequent pattern growth algorithm is compared with the association rule algorithm based on the collaborative filtering recommendation algorithm and the content-based recommendation algorithm, which proves the superiority of the algorithm and its role in solving the recommendation problem after applying the recommendation. The music data in the database data conversion effectively improve the efficiency and accuracy of mining. According to the implementation of the algorithm described in this article, the accuracy of the music recommendation results used to recommend user satisfaction is proved. And the recommended music is indeed feasible and practical. (shrink)

To improve the understanding of film and television postproduction for college students in the era of intelligent media, a study is conducted on college students’ short video communication education and audience psychology based on the rapid development of virtual image and the Internet of Things. Primarily, the collaborative filtering algorithm is optimized and combined with the principle of Spark and Hadoop platforms as well as the IoT and virtual image technologies. Then, a hybrid computing model is proposed, and (...) the two algorithms are improved and combined, with 90,000 network video records as data samples. Finally, the push accuracy of the hybrid algorithm and the traditional algorithm is calculated and compared, and based on this, a questionnaire survey on the audience psychology of short video production is carried out for college students. The results show that the time user of the combined algorithm is always at least 0.4 s faster than that of a single algorithm and the running speed of the algorithm with five nodes is nearly 80% higher than the algorithm with a single node. The Spark algorithm with multinode has good versatility in image recording and processing of large groups of college students. When processing more than 100,000 image records, the deviation values of Spark and Hadoop with a single node exceeded 1.1, but the deviation value of the hybrid algorithm was still lower than 1.1. With the increase of data volume, the deviation values of the three algorithms are increasing. Compared with the traditional CFA algorithm, the optimized algorithm has a higher speed in processing data and is more accurate in content pushing. From the questionnaire survey of college students, it is found that contemporary college students are not active in learning knowledge of virtual images. Hence, it is concluded that colleges must carry out relevant courses based on short video communication education and strengthen the short video communication education of college students. A reference is provided for the development of college students’ short video communication education in the digital age. (shrink)

Since the user recommendation complex matrix is characterized by strong sparsity, it is difficult to correctly recommend relevant services for users by using the recommendation method based on location and collaborative filtering. The similarity measure between users is low. This paper proposes a fusion method based on KL divergence and cosine similarity. KL divergence and cosine similarity have advantages by comparing three similar metrics at different K values. Using the fusion method of the two, the user’s similarity with (...) the preference is reused. By comparing the location-based collaborative filtering algorithm, user-based collaborative filtering algorithm, and user recommendation algorithm, the proposed method has the preparation rate, recall rate, and experimental effect advantage. In different median values, the proposed method also has an advantage in experimental results. (shrink)

With the rapid development of the Internet, recommendation systems have received widespread attention as an effective way to solve information overload. Social tagging technology can both reflect users’ interests and describe the characteristics of the items themselves, making group recommendation thus becoming a recommendation technology in urgent demand nowadays. In traditional tag-based recommendation systems, the general processing method is to calculate the similarity and then rank the recommended items according to the similarity. Without considering the influence of continuous user behavior, (...) in this article, we propose a personalized recommendation algorithm based on social tags by combining the ideas of Markov chain and collaborative filtering. This algorithm splits the three-dimensional relationship of into two two-dimensional relationships of and. The user’s interest degree to the tags is calculated by the Markov chain model, and then the items corresponding to them are matched by the recommended tag set. The influence between tags is used to model the satisfaction of items based on the correlation between the tags contained in the matched items, and collaborative filtering is used to complete the sparse values when calculating the interest and satisfaction between user–tags and user–items to improve the accuracy of recommendations. The experiments show that in the publicly available dataset, the personalized recommendation algorithm proposed in this article has significantly improved in accuracy and recall rate compared with the existing algorithms. (shrink)

In this paper, based on computer reading and processing of music frequency, amplitude, timbre, image pixel, color filling, and so forth, a method of image style transfer guided by music feature data is implemented in real-time playback, using existing music files and image files, processing and trying to reconstruct the fluent relationship between the two in terms of auditory and visual, generating dynamic, musical sound visualization with real-time changes in the visualization. Although recommendation systems have been well developed in real (...) applications, the limitations of CF algorithms are slowly coming to light as the number of people increases day by day, such as the data sparsity problem caused by the scarcity of rated items, the cold start problem caused by new items and new users. The work is dynamic, with real-time changes in music and sound. Taking portraits as an experimental case, but allowing users to customize the input of both music and image files, this new visualization can provide users with a personalized service of mass customization and generate personalized portraits according to personal preferences. At the same time, we take advantage of the BP neural network’s ability to handle complex nonlinear problems and construct a rating prediction model between the user and item attribute features, referred to as the PSO-BP rating prediction model, by combining the features of global optimization of particle swarm optimization algorithm, and make further improvements based on the traditional collaborative filtering algorithm. (shrink)

As one of the traditional entertainment items, video background music has gradually changed from traditional consumption to network consumption, which naturally also has the problem of information overload. From the perspective of model design and auxiliary information, this paper proposes a tightly coupled fusion model based on deep learning and collaborative filtering to alleviate the problem of poor prediction accuracy due to sparse matrix in the scoring prediction problem. In the use of auxiliary information, this paper uses crawler (...) technology to obtain auxiliary information on the user side and the video background music side and compensates for the model’s sensitivity to the sparsity of the score matrix from a data perspective. In terms of model design, this paper conducts auxiliary information mining based on the diversity and structural differences of auxiliary information, uses an improved stack autoencoder to learn user’s interests, and uses convolutional neural networks to mine hidden features of video background music. Based on the idea of probabilistic matrix decomposition, the tightly coupled fusion of multiple deep learning models and collaborative filtering is realized. By comprehensively considering user’s interest and video background music characteristics, the collaborative filtering process is supervised, and the optimized prediction result is finally obtained. The performance test and function test of the system were carried out, respectively, to verify the effectiveness of the hybrid recommendation algorithm and the effect of the system for recommendation. Through experimental analysis, it is proved that the algorithm designed in this paper can improve the recommendation quality and achieve the expected goal. (shrink)