- Download the dataset "Discover The Menu" which contains a list of dishes with some properties from Kaggle: https://www.kaggle.com/datasets/prashant111/discover-the-menu/data
- Use K-Medoids algorithm with Euclidian distance, partition Dishes into 25 clusters considering the following features:
- first_appeared
- last_appeared
- lowest_price
- highest_price
-
Notifications
You must be signed in to change notification settings - Fork 0
20alaamahmoud/K-Medoids-Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
K-Medoids algorithm with Euclidian distance
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published