2013
DOI: 10.1007/s10844-013-0276-1
|View full text |Cite
|
Sign up to set email alerts
|

In-memory, distributed content-based recommender system

Abstract: Burdened by their popularity, recommender systems increasingly take on larger datasets while they are expected to deliver high quality results within reasonable time. To meet these ever growing requirements, industrial recommender systems often turn to parallel hardware and distributed computing. While the MapReduce paradigm is generally accepted for massive parallel data processing, it often entails complex algorithm reorganization and suboptimal efficiency because mid-computation values are typically read fr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…When a recommender system needs distributed computing however, often a MapReduce paradigm is involved (e.g., [39,27,43,11,12]). This requires computational steps to be rewritten as map and reduce functions which is not straightforward to do and causes overhead thus reducing parallel efficiency [13]. In this work we show how the system can embrace distributed computing without the need for MapReduce.…”
Section: Related Workmentioning
confidence: 99%
“…When a recommender system needs distributed computing however, often a MapReduce paradigm is involved (e.g., [39,27,43,11,12]). This requires computational steps to be rewritten as map and reduce functions which is not straightforward to do and causes overhead thus reducing parallel efficiency [13]. In this work we show how the system can embrace distributed computing without the need for MapReduce.…”
Section: Related Workmentioning
confidence: 99%
“…(1) To solve the problem of dependence of traditional calculation methods on common scoring items, the Bhattacharyya similarity is applied to traditional calculation methods. (2) We introduce trust weight to improve the calculation of direct trust, and according to the trust transmission mechanism and the six-degree separation theory, the indirect similarity calculation is improved and integrated into the user's trust degree. (3) is paper proposes a hybrid recommendation algorithm which combines user interest and trust, which effectively alleviates the problem of data sparsity in collaborative filtering recommendation system.…”
Section: Introductionmentioning
confidence: 99%
“…Successfully used in e-commerce and academic research [ 1 ]. There are many classifications of recommendation systems, such as content-based recommendation [ 2 ] and knowledge-based recommendation [ 3 ] and collaborative filtering. Collaborative filtering is the most prominent and commonly used recommendation technology [ 4 , 5 ].…”
Section: Introductionmentioning
confidence: 99%
“…To alleviate these problems and improve rating prediction accuracy, many other prediction models have been proposed, including association rule-based models [10], content-based models [11], and knowledge-based models [12]. However, the above models are only applied from a static perspective to profiling user needs and hard to obtain a high-quality prediction framework for item predictions.…”
Section: Introductionmentioning
confidence: 99%