K-Medoids-Algorithm

• 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