2018
DOI: 10.1108/idd-02-2018-0007
|View full text |Cite
|
Sign up to set email alerts
|

Lazy collaborative filtering with dynamic neighborhoods

Abstract: Purpose The purpose of this paper is to address the scalability issue and produce high-quality recommendation that best matches the user’s current preference in the dynamically growing datasets in the context of memory-based collaborative filtering methods using temporal information. Design/methodology/approach The proposed method is formalized as time-dependent collaborative filtering method. For each item, a set of influential neighbors is identified by using the truncated version of similarity computation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…In recent years, the rapid growth of online platforms and the amount of information available has become a major challenge for users in finding relevant and personalized content [1]- [3]. Recommender systems are emerging as a solution to address this problem by providing suggestions on items that are likely to be of interest to users [4].…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, the rapid growth of online platforms and the amount of information available has become a major challenge for users in finding relevant and personalized content [1]- [3]. Recommender systems are emerging as a solution to address this problem by providing suggestions on items that are likely to be of interest to users [4].…”
Section: Introductionmentioning
confidence: 99%
“…With the development of pedagogical data, the need to find productive information has emerged as a hot topic among the research community [1]. Many data mining techniques have been exploited in this direction to achieve better insight of different academic data warehouses [2,3].…”
Section: Introductionmentioning
confidence: 99%