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, which is used to reflect a user's preference, we address this issue and suggest an effective technique for solving the problem in this study. By doing so, numerous pointless tests can be avoided. When m is the number of objects (or, let's say, characteristics) and n is the number of user preferences, the algorithm's temporal complexity is constrained to O(n2 m3). As a result of the problem being effectively NP-hard, the algorithm covered in this chapter really proves that P=NP. CCS concepts: • Minimum satisfiability problem • Theory of computation.
Author(s) Details:
Yangjun Chen,
Department of Applied Computer Science, University of Winnpeg, Canada.
Bobin Chen,
Department of Applied Computer Science, University of Winnpeg, Canada.
Please see the link here: https://stm.bookpi.org/NRAMCS-V8/article/view/8359
No comments:
Post a Comment