2017
DOI: 10.1007/978-3-319-63004-5_1
|View full text |Cite
|
Sign up to set email alerts
|

Context-Aware Recommender Systems Based on Item-Grain Context Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…K-Means is based on pre-setting clusters' centroids, where based on the distance between each data point and the centroid, a cluster is formed. That step is repeated till convergence [133]. As we mentioned before, this algorithm is noted to be the simplest and most used clustering algorithm.…”
Section: K-means Partitional Clustering Algorithmmentioning
confidence: 99%
“…K-Means is based on pre-setting clusters' centroids, where based on the distance between each data point and the centroid, a cluster is formed. That step is repeated till convergence [133]. As we mentioned before, this algorithm is noted to be the simplest and most used clustering algorithm.…”
Section: K-means Partitional Clustering Algorithmmentioning
confidence: 99%
“…Context-aware recommender systems (CARS) have emerged as a hot research topic in the field of recommendation, with the goal of enhancing recommendation quality and user loyalty by incorporating context knowledge. Integrating context information into recommendation structures is complex due to the high dimensionality of context information and the sparsity of results (Shi et al, 2017). The study looked at the evolution of travel advisory systems, as well as their usefulness and existing shortcomings.…”
Section: Introductionmentioning
confidence: 99%