Most Popular Package Design and NP-Hard Problem
We look into the issue of creating a most popular package (or, let’s say, a pattern), that is, a subset of items that maximises the number of happy users, given a collection of items and a set of user preferences. It is a common data mining difficulty. Using a network structure known as a p*-graph,…
Read more