Itemset Mining as a Challenge Application for Answer Set Enumeration

摘要

We present an initial exploration into the possibilities of applying cur rent state-of-the-art answer set programming (ASP) tools-esp. conflict-driven answer set enumeration-for mining itemsets in 0-1 data. We evaluate a sim ple ASP-based approach experimentally and compare it to a recently proposed framework exploiting constraint programming (CP) solvers for itemset mining.