2016
DOI: 10.1016/j.neucom.2014.10.097
|View full text |Cite
|
Sign up to set email alerts
|

Web mining based framework for solving usual problems in recommender systems. A case study for movies׳ recommendation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0
2

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 68 publications
(31 citation statements)
references
References 29 publications
0
27
0
2
Order By: Relevance
“…An automatic recommendation scheme based on collaborative filtering infers the preferred TV programs in two stages [4]. At the first stage, a candidate set of programs is generated on the grounds of the users' watching history [5]. At the second stage, the candidate TV programs are ranked to eliminate the recommendation redundancy stipulated by items similarity [4].…”
Section: Discussionmentioning
confidence: 99%
“…An automatic recommendation scheme based on collaborative filtering infers the preferred TV programs in two stages [4]. At the first stage, a candidate set of programs is generated on the grounds of the users' watching history [5]. At the second stage, the candidate TV programs are ranked to eliminate the recommendation redundancy stipulated by items similarity [4].…”
Section: Discussionmentioning
confidence: 99%
“…The information can help, for instance, to find more books by an author they enjoy reading or have a movie title suggested to them based on interest in a topic. The information is honed and tailored over time to accurately detect and influence shopping habits (18). A similar feedback effect occurs with online information searches.…”
Section: Online Eating Disorder Datamentioning
confidence: 94%
“…Zhou et al in [20] recommend an incremental approach based on SVD that constantly computes the singular value decomposition of the original matrix unchanged each time to solve the sparsity problem and users' interests that are dynamic. Furthermore, other data mining techniques including clustering [21], classification [22], and association rules mining [23] have been used in recommender systems as solutions to the data sparsity.…”
Section: Related Workmentioning
confidence: 99%