scholarly journals Time-Aware CF and Temporal Association Rule-Based Personalized Hybrid Recommender System

2021 ◽  
Vol 33 (3) ◽  
pp. 19-34
Author(s):  
Dan Yang ◽  
Zheng Tie Nie ◽  
Fajun Yang
Keyword(s):  
Recommender System ◽  
Association Rule ◽  
Personalized Recommendation ◽  
Temporal Association ◽  
Recommendation Algorithm ◽  
Rule Based ◽  
Temporal Association Rule ◽  
Hybrid Recommender System ◽  
Hybrid Recommender ◽  
Time Aware

Most recommender systems usually combine several recommendation methods to enhance the recommendation accuracy. Collaborative filtering (CF) is a best-known personalized recommendation technique. While temporal association rule-based recommendation algorithm can discover users' latent interests with time-specific leveraging historical behavior data without domain knowledge. The concept-drifting and user interest-drifting are two key problems affecting the recommendation performance. Aiming at the above problems, a time-aware CF and temporal association rule-based personalized hybrid recommender system, TP-HR, is proposed. The proposed time-aware CF algorithm considers evolving features of users' historical feedback. And time-aware users' similar neighbors selecting measure and time-aware item rating prediction function are proposed to keep track of the dynamics of users' preferences. The proposed temporal association rule-based recommendation algorithm considers the time context of users' historical behaviors when mining effective temporal association rules. Experimental results on real datasets show the feasibility and performance improvement of the proposed hybrid recommender system compared to other baseline approaches.

scholarly journals A Stock Trading Recommender System Based on Temporal Association Rule Mining

SAGE Open ◽  
2015 ◽  
Vol 5 (2) ◽  
pp. 215824401557994 ◽  
Author(s):  
Binoy B. Nair ◽  
V. P. Mohandas ◽  
Nikhil Nayanar ◽  
E. S. R. Teja ◽  
S. Vigneshwari ◽  
...  
Keyword(s):  
Recommender System ◽  
Association Rule ◽  
Association Rule Mining ◽  
Temporal Association ◽  
Rule Mining ◽  
Stock Trading ◽  
Temporal Association Rule

Toward a Hybrid Recommender System for E-learning Personnalization Based on Data Mining Techniques

2018 ◽  
Vol 2 (4) ◽  
pp. 271 ◽  
Author(s):  
Outmane Bourkoukou ◽  
Essaid El Bachari
Keyword(s):  
Learning Style ◽  
Recommender System ◽  
Adaptive Learning ◽  
Learning Objects ◽  
Research Field ◽  
Learning System ◽  
K Nearest Neighbors ◽  
E Learning ◽  
Hybrid Recommender System ◽  
Hybrid Recommender

Personalized courseware authoring based on recommender system, which is the process of automatic learning objects selecting and sequencing, is recognized as one of the most interesting research field in intelligent web-based education. Since the learner’s profile of each learner is different from one to another, we must fit learning to the different needs of learners. In fact from the knowledge of the learner’s profile, it is easier to recommend a suitable set of learning objects to enhance the learning process. In this paper we describe a new adaptive learning system-LearnFitII, which can automatically adapt to the dynamic preferences of learners. This system recognizes different patterns of learning style and learners’ habits through testing the psychological model of learners and mining their server logs. Firstly, the device proposed a personalized learning scenario to deal with the cold start problem by using the Felder and Silverman’s model. Next, it analyzes the habits and the preferences of the learners through mining the information about learners’ actions and interactions. Finally, the learning scenario is revisited and updated using hybrid recommender system based on K-Nearest Neighbors and association rule mining algorithms. The results of the system tested in real environments show that considering the learner’s preferences increases learning quality and satisfies the learner.

Fast Algorithms for Temporal Association Rules in a Large Database

2005 ◽  
Vol 277-279 ◽  
pp. 287-292 ◽  
Author(s):  
Lu Na Byon ◽  
Jeong Hye Han
Keyword(s):  
Electronic Commerce ◽  
Association Rules ◽  
Association Rule ◽  
Temporal Association ◽  
Large Database ◽  
Running Time ◽  
Smoothing Filter ◽  
Personalized Services ◽  
Temporal Association Rule ◽  
Transaction Database

As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests. In this article, we propose a temporal association rule and its discovering algorithm with exponential smoothing filter in a large transaction database. Through experimental results, we confirmed that this is more precise and consumes a shorter running time than existing temporal association rules.

Intelligent Techniques in Recommender Systems and Contextual Advertising

2013 ◽  
pp. 105-128 ◽  
Author(s):  
Giuliano Armano ◽  
Alessandro Giuliani ◽  
Eloisa Vargiu
Keyword(s):  
Recommender System ◽  
Information Filtering ◽  
Relevant Information ◽  
Web Page ◽  
Contextual Advertising ◽  
Generic Hybrid ◽  
Unified View ◽  
Hybrid Recommender System ◽  
Hybrid Recommender ◽  
The Web

Information Filtering deals with the problem of selecting relevant information for a given user, according to her/his preferences and interests. In this chapter, the authors consider two ways of performing information filtering: recommendation and contextual advertising. In particular, they study and analyze them according to a unified view. In fact, the task of suggesting an advertisement to a Web page can be viewed as the task of recommending an item (the advertisement) to a user (the Web page), and vice versa. Starting from this insight, the authors propose a content-based recommender system based on a generic solution for contextual advertising and a hybrid contextual advertising system based on a generic hybrid recommender system. Relevant case studies have been considered (i.e., a photo recommender and a Web advertiser) with the goal of highlighting how the proposed approach works in practice. In both cases, results confirm the effectiveness of the proposed solutions.

Ordering Policy and Inventory Classification Using Temporal Association Rule Mining

2018 ◽  
Vol 6 (1) ◽  
pp. 37-49 ◽  
Author(s):  
Reshu Agarwal
Keyword(s):  
Inventory Management ◽  
Association Rule ◽  
Association Rule Mining ◽  
Temporal Association ◽  
Order Quantity ◽  
Rule Mining ◽  
Ordering Policy ◽  
Temporal Association Rule ◽  
Optimum Order ◽  
Frequent Items

A modified framework that applies temporal association rule mining to inventory management is proposed in this article. The ordering policy of frequent items is determined and inventory is classified based on loss rule. This helps inventory managers to determine optimum order quantity of frequent items together with the most profitable item in each time-span. An example is illustrated to validate the results.

Sign in / Sign up

Export Citation Format

Share Document