DSCKGEC / DSCKGEC/MovieRecommendationSystem
Apply Clustering Algorithm for Recommendation System
Open
enhancement
Hard
KSoC’22
- Dominant language
- Jupyter Notebook
- Stars
- 1
- Forks
- 2
- PR merge metrics
- No merged PRs in 30d
Description
**Describe the solution you'd like**
Apply K-Means Clustering or Gaussian Mixture Model for Recommendation System. You can either use One Hot Encoding or Label Encoding.
Contributor guide
Research direction
No file, test, or entry point is named in the issue; first locate the existing recommendation-system notebook and inspect its data-cleaning and EDA flow. Compare the proposed K-Means and Gaussian Mixture approaches with the available encoded data, and define completion as an integrated clustering-based recommendation result with a clear evaluation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- jupyter-notebook
- Domain
- data, machine-learning
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100