algorithm - Group/Cluster Object List Based on multiple discrete attributes -


i have list of objects attributes eg color, length, width , importantly price. trying partition list largest subsets each subset member has same price , every permutation of color, length, width present in subset.

in other words want able divide item set discover subsets each set can described like:

  • all objects red, blue, or green , either 10 or 11 inches long 4 inches high cost $5
  • all objects red or green , 12 inches long , 4 inches high $6
  • a blue 12x4 object $6.50
  • etc. etc.

with goal of having subsets contain items possible.

i've been wrestling problem while now, , think answer (or close approximation) might come clustering techniques. however, i've been hard pressed come distance matrix provide results looking for. have insight how solve problem.

better explanation

given list of objects similar ones above group them smallest number of complete subsets price.

well, step 1 partition whole thing on price.

from there sounds want completeness sample on other traits, not clustering. if want "every permutation of color, etc." isn't clustering, in ways understand! sounds anti-clustering!

in case, find description of end goal quite confusing.


Comments

Popular posts from this blog

asp.net - repeatedly call AddImageUrl(url) to assemble pdf document -

java - Android recognize cell phone with keyboard or not? -

iphone - How would you achieve a LED Scrolling effect? -