Closed frequent itemset mining with arbitrary side constraints
MetadataShow full item record
Frequent itemset mining (FIM) is a method for finding regularities in transaction databases. It has several application areas, such as market basket analysis, genome analysis, and drug design. Finding frequent itemsets allows further analysis to focus on a small subset of the data. For large datasets the number of frequent itemsets can also be very large, defeating their purpose. Therefore, several extensions to FIM have been studied, such as adding high-utility (or low-cost) constraints and only finding closed (or maximal) frequent itemsets. This paper presents a constraint programming based approach that combines arbitrary side constraints with closed frequent itemset mining. Our approach allows arbitrary side constraints to be expressed in a high level and declarative language which is then translated automatically for efficient solution by a SAT solver. We compare our approach with state-of-the-art algorithms via the MiningZinc system (where possible) and show significant contributions in terms of performance and applicability.
Kocak , G , Akgun , O , Miguel , I J & Nightingale , P W 2018 , Closed frequent itemset mining with arbitrary side constraints . in 2018 IEEE International Conference on Data Mining (ICDM) . IEEE Computer Society , Workshop on Optimization Based Techniques for Emerging Data Mining Problems (OEDM 2018) , Sentosa Island , Singapore , 17/11/18 .workshop
2018 IEEE International Conference on Data Mining (ICDM)
© 2018, IEEE. This work has been made available online in accordance with the publisher's policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at http://ieeexplore.ieee.org/
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.