You're analyzing data from a shopping mall's customer behavior and notice that there are overlapping clusters representing different shopping patterns. To model this scenario, which algorithm would be most suitable?

  • K-Means Clustering
  • Decision Trees
  • Breadth-First Search
  • Radix Sort
K-Means Clustering is commonly used for clustering tasks, such as identifying distinct shopping patterns. It groups data into clusters based on similarity, making it suitable for analyzing customer behavior data with overlapping patterns.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *