2015
DOI: 10.1007/978-3-319-27030-2_16
|View full text |Cite
|
Sign up to set email alerts
|

Comparing LDA and LSA Topic Models for Content-Based Movie Recommendation Systems

Abstract: We propose a plot-based recommendation system, which is based upon an evaluation of similarity between the plot of a video that was watched by a user and a large amount of plots stored in a movie database. Our system is independent from the number of user ratings, thus it is able to propose famous and beloved movies as well as old or unheard movies/programs that are still strongly related to the content of the video the user has watched. The system implements and compares the two Topic Models, Latent Semantic … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0
2

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 32 publications
(20 citation statements)
references
References 19 publications
0
16
0
2
Order By: Relevance
“…This can lead to a richer relational structure that reveals latent relations presented between documents and terms (Bergamaschi & Po, 2014). But finding the optimal k is still a challenge.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…This can lead to a richer relational structure that reveals latent relations presented between documents and terms (Bergamaschi & Po, 2014). But finding the optimal k is still a challenge.…”
Section: Resultsmentioning
confidence: 99%
“…But finding the optimal k is still a challenge. Different authors have proposed a number of solutions (Bergamaschi & Po, 2014;Kulkarni, Apte, & Evangelopoulos, 2014;Wild, Stahl, Stermsek, & Neumann, 2005), but many of them refer that this point should be defined empirically for each collection.…”
Section: Resultsmentioning
confidence: 99%
“…Future work will be focused on comparing the Keygraph algorithm w.r.t. other topic models such as LSA or LDA [4]. Moreover, we would like to investigate how disambiguation techniques might improved the results of Keygraph [3,9].…”
Section: Resultsmentioning
confidence: 99%
“…The similarity between a community and a document is computed to rank similar documents. The original Keygraph algorithm 4 ) was modified to improve the results of indexing, giving consideration to the hashtags and URLs in news text. The algorithm uses a configuration file that is provided as input and contains numerical parameters useful for clustering (the upcoming words written in italics refer to configuration parameters).…”
Section: Keygraph Adapted For the Multichannel Analysismentioning
confidence: 99%
“…Analiza teksta i modelovanje tema rađeno je u radu [5] koji se bavi poređenjem LDA i LSA modela kako bi se formirao automatski sistem za preporuku filmova. Ovaj rad korišćen je zbog upoređivanja tehnika modelovanja tema i metode evaluacija modela.…”
Section: Pregled Postojeće Literatureunclassified