Info

This question is closed. Reopen it to edit or answer.

k-means type clustering

3 views (last 30 days)
Meggo
Meggo on 21 Jul 2017
Closed: MATLAB Answer Bot on 20 Aug 2021
Hi
I have a more difficult problem and I'm not even sure where to start. I have an NxM matrix where m is the number of data sets I have.I want to group them in a "k-means"esque manner such that the differences between all partners are minimized, but only such that contiguous data sets are paired. The elligible information is housed in the structure "Neighbors" where the row number x=the data set, meaning [x,1] contains the eligible grouping partners.
How do i go about creating a program such that all collection of pairs will be quantified and the one with the least amount of differences will be returned, but which also takes into account the elligible pairs?
  1 Comment
Image Analyst
Image Analyst on 21 Jul 2017
What are the axes if you did a scatterplot of these data? For any single given data set - one column - how many clusters are in it? One? Two? And the next column over, would its data lie in the same clusters as the first column? Or do they have the own, completely independent and separate cluster(s)?
A diagram or plot would help.

Answers (0)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!