graph - Creating fixed size groups based on matching attributes and minimizing the number of un-grouped entites -
my problem this:
i have list of people, each person has number of facebook likes. want partition people n groups such that, each group, every member shares @ least 1 (i.e. in group likes daft punk). groups can't size other 3 or 4 people, , want minimize number of people aren't in group. (however, i'm willing break fixed-size-rule if means can minimize unmatched people more)
i've been told @ bin packing , cliques they're not quite right fit problem.
when searching previous questions came across this: categorizing input data sets based on attribute seems work, every member in group has more 1 value (an array of likes). i'm not sure if minimizes number of excluded people.
thank in advance!
Comments
Post a Comment