Search results

The purpose of this paper is to make the mobile e-commerce shopping more convenient and avoid information overload by a mobile e-commerce recommendation system using an improved Apriori algorithm.

Combined with the characteristics of the mobile e-commerce, an improved Apriori algorithm was proposed and applied to the recommendation system. This paper makes products that are recommended to consumers valuable by improving the data mining efficiency. Finally, a Taobao online dress shop is used as an example to prove the effectiveness of an improved Apriori algorithm in the mobile e-commerce recommendation system.

The results of the experimental study clearly show that the mobile e-commerce recommendation system based on an improved Apriori algorithm increases the efficiency of data mining to achieve the unity of real time and recommendation accuracy.

The improved Apriori algorithm is applied in the mobile e-commerce recommendation system solving the limitation of the visual interface in a mobile terminal and the mass data that are continuously generated. The proposed recommendation system provides greater prediction accuracy than conventional systems in data mining.

English original movies played an important role in English learning and communication. In order to find the required movies for us from a large number of English original movies and reviews, this paper proposed an improved deep reinforcement learning algorithm for the recommendation of movies. In fact, although the conventional movies recommendation algorithms have solved the problem of information overload, they still have their limitations in the case of cold start-up and sparse data.

To solve the aforementioned problems of conventional movies recommendation algorithms, this paper proposed a recommendation algorithm based on the theory of deep reinforcement learning, which uses the deep deterministic policy gradient (DDPG) algorithm to solve the cold starting and sparse data problems and uses Item2vec to transform discrete action space into a continuous one. Meanwhile, a reward function combining with cosine distance and Euclidean distance is proposed to ensure that the neural network does not converge to local optimum prematurely.

In order to verify the feasibility and validity of the proposed algorithm, the state of the art and the proposed algorithm are compared in indexes of RMSE, recall rate and accuracy based on the MovieLens English original movie data set for the experiments. Experimental results have shown that the proposed algorithm is superior to the conventional algorithm in various indicators.

Applying the proposed algorithm to recommend English original movies, DDPG policy produces better recommendation results and alleviates the impact of cold start and sparse data.

Recommender agents are used to make recommendations of interesting items in a wide variety of application domains, such as web page recommendation, music, e‐commerce, movie recommendation, tourism, restaurant recommendation, among others. Despite the various and different domains in which recommender agents are used and the variety of approaches they use to represent user interests and make recommendations, there is some functionality that is common to all of them, such as user model management and recommendation of interesting items. This paper aims at generalizing these common behaviors into a framework that enables developers to reuse recommender agents' main characteristics in their own developments.

This work presents a framework for recommendation that provides the control structures, the data structures and a set of algorithms and metrics for different recommendation methods. The proposed framework acts as the base design for recommender agents or applications that want to add the already modeled and implemented capabilities to their own functionality. In contrast with other proposals, this framework is designed to enable the integration of diverse user models, such as demographic, content‐based and item‐based. In addition to the different implementations provided for these components, new algorithms and user model representations can be easily added to the proposed approach. Thus, personal agents originally designed to assist a single user can reuse the behavior implemented in the framework to expand their recommendation strategies.

The paper describes three different recommender agents built by materializing the proposed framework: a movie recommender agent, a tourism recommender agent, and a web page recommender agent. Each agent uses a different recommendation approach. PersonalSearcher, an agent originally designed to suggest interesting web pages to a user, was extended to collaboratively assist a group of users using content‐based algorithms. MovieRecommender recommends interesting movies using an item‐based approach and Traveller suggests holiday packages using demographic user models. Findings encountered during the development of these agents and their empirical evaluation are described here.

The advantages of the proposed framework are twofold. On the one hand, the functionality provided by the framework enables the development of recommender agents without the need for implementing its whole set of capabilities from scratch. The main processes and data structures of recommender agents are already implemented. On the other hand, already existing agents can be enhanced by incorporating the functionality provided by the recommendation framework in order to act collaboratively.

This study aims to explore the perception of algorithm accuracy among data professionals in higher education.

Social justice theory guided the qualitative descriptive study and emphasized four principles: access, participation, equity and human rights. Data collection included eight online open-ended questionnaires and six semi-structured interviews. Participants included higher education professionals who have worked with predictive algorithm (PA) recommendations programmed with student data.

Participants are aware of systemic and racial bias in their PA inputs and outputs and acknowledge their responsibility to ethically use PA recommendations with students in historically underrepresented groups (HUGs). For some participants, examining these topics through the lens of social justice was a new experience, which caused them to look at PAs in new ways.

Small sample size is a limitation of the study. Implications for practice include increased stakeholder training, creating an ethical data strategy that protects students, incorporating adverse childhood experiences data with algorithm recommendations, and applying a modified critical race theory framework to algorithm outputs.

The study explored the perception of algorithm accuracy among data professionals in higher education. Examining this topic through a social justice lens contributes to limited research in the field. It also presents implications for addressing racial bias when using PAs with students in HUGs.

In a multi-stakeholder recommender system (MSRS), stakeholders are the multiple entities (consumer, producer, system, etc.) benefited by the generated recommendations. Traditionally, the exclusive focus on only a single stakeholders' (for example, only consumer or end-user) preferences obscured the welfare of the others. Two major challenges are encountered while incorporating the multiple stakeholders' perspectives in MSRS: designing a dedicated utility function for each stakeholder and optimizing their utility without hurting others. This paper proposes multiple utility functions for different stakeholders and optimizes these functions for generating balanced, personalized recommendations for each stakeholder.

The proposed methodology considers four valid stakeholders user, producer, cast and recommender system from the multi-stakeholder recommender setting and builds dedicated utility functions. The utility function for users incorporates enhanced side-information-based similarity computation for utility count. Similarly, to improve the utility gain, the authors design new utility functions for producer, star-cast and system to incorporate long-tail and diverse items in the recommendation list. Next, to balance the utility gain and generate the trade-off recommendation solution, the authors perform the evolutionary optimization of the conflicting utility functions using NSGA-II. Experimental evaluation and comparison are conducted over three benchmark data sets.

The authors observed 19.70% of average enhancement in utility gain with improved mean precision, diversity and novelty. Exposure, hit, reach and target reach metrics are substantially improved.

A new approach considers four stakeholders simultaneously with their respective utility functions and establishes the trade-off recommendation solution between conflicting utilities of the stakeholders.

The existing collaborative filtering algorithm may select an insufficiently representative customer as the neighbor of a target customer, which means that the performance in providing recommendations is not sufficiently accurate. This study aims to investigate the impact on recommendation performance of selecting influential and representative customers.

Some studies have shown that review helpfulness and consistency significantly affect purchase decision-making. Thus, this study focuses on customers who have written helpful and consistent reviews to select influential and representative neighbors. To achieve the purpose of this study, the authors apply a text-mining approach to analyze review helpfulness and consistency. In addition, they evaluate the performance of the proposed methodology using several real-world Amazon review data sets for experimental utility and reliability.

This study is the first to propose a methodology to investigate the effect of review consistency and helpfulness on recommendation performance. The experimental results confirmed that the recommendation performance was excellent when a neighbor was selected who wrote consistent or helpful reviews more than when neighbors were selected for all customers.

This study investigates the effect of review consistency and helpfulness on recommendation performance. Online review can enhance recommendation performance because it reflects the purchasing behavior of customers who consider reviews when purchasing items. The experimental results indicate that review helpfulness and consistency can enhance the performance of personalized recommendation services, increase customer satisfaction and increase confidence in a company.

In the past few years, millions of people started to acquire knowledge from the Massive Open Online Courses (MOOCs). MOOCs contain massive video courses produced by instructors, and learners all over the world can get access to these courses via the internet. However, faced with massive courses, learners often waste much time finding courses they like. This paper aims to explore the problem that how to make accurate personalized recommendations for MOOC users.

This paper proposes a multi-attribute weight algorithm based on collaborative filtering (CF) to select a recommendation set of courses for target MOOC users.

The recall of the proposed algorithm in this paper is higher than both the traditional CF and a CF-based algorithm – uncertain neighbors’ collaborative filtering recommendation algorithm. The higher the recall is, the more accurate the recommendation result is.

This paper reflects the target users’ preferences for the first time by calculating separately the weight of the attributes and the weight of attribute values of the courses.

The purpose of this paper is to introduce an improved nearest‐neighbor collaborative filtering algorithm based on rough set theory to alleviate the sparsity problem of collaborative filtering. With experimentations, the new algorithm is thereafter evaluated.

Nearest‐neighbor algorithm is the earliest proposed and the main collaborative filtering recommendation algorithm, and its recommendation quality is seriously influenced by the sparsity of user ratings. By using rough set theory, the nearest‐neighbor collaborative filtering algorithm can be improved in the sparsity data situation. The union of user rating items is used as the basis of similarity computing among users, and then a rating predicting method based on rough set theory is proposed to estimate missing values in the union of user rating items for decreasing sparsity.

The sparsity problem of collaborative filtering can be alleviated by using the union of user rating items and estimating missing values based on rough set theory. The experimental results show that the new algorithm can efficiently improve recommendation quality of collaborative filtering.

The union of user rating items was used as the basis of similarity computing among users. A rating prediction method based on rough set theory with an assistant method was proposed to complete the missing values in the union of user rating items. Orthogonal list was used to storage user‐item ratings matrix.

This study aims to overcome the problem of traditional association rules relying almost entirely on expert experience to set relevant interest indexes in mining. Second, this project can effectively solve the problem of four types of rules being present in the database at the same time. The traditional association algorithm can only mine one or two types of rules and cannot fully explore the database knowledge in the decision-making process for library recommendation.

The authors proposed a Markov logic network method to reconstruct association rule-mining tasks for library recommendation and compared the method proposed in this paper to traditional Apriori, FP-Growth, Inverse, Sporadic and UserBasedCF algorithms on two history library data sets and the Chess and Accident data sets.

The method used in this project had two major advantages. First, the authors were able to mine four types of rules in an integrated manner without having to set interest measures. In addition, because it represents the relevance of mining in the network, decision-makers can use network visualization tools to fully understand the results of mining in library recommendation and data sets from other fields.

The time cost of the project is still high for large data sets. The authors will solve this problem by mapping books, items, or attributes to higher granularity to reduce the computational complexity in the future.

The authors believed that knowledge of complex real-world problems can be well captured from a network perspective. This study can help researchers to avoid setting interest metrics and to comprehensively extract frequent, rare, positive, and negative rules in an integrated manner.