Abstract

With the deepening of the negative association rules mining technology research, many key problems have been solved, but the solution of these problems are all on a single predicate in the transaction database. However, the data in the database often involves multiple predicates. This paper focuses on solving multi-dimensional support and confidence, negative association rules mining algorithm design problems. The experiment proves that the algorithm is correct and efficiency.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call