Skip to Main content Skip to Navigation
Conference papers

Verified Programs for Frequent Itemset Mining

Abstract : Frequent itemset mining is one pillar of machine learning and is very important for many data mining applications. There are many different algorithms for frequent itemset mining, but to our knowledge no implementation has been proven correct using computer aided verification. Hu et al. derived on paper an efficient algorithm for this problem, starting from an inefficient functional program and by using program calculation derived an efficient version. Based on their work, we propose a formally verified functional implementation for frequent itemset mining developed with the Coq proof assistant. All the proposed programs are evaluated on classical datasets and are compared to a non verified Java implementation of the Apriori algorithm.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-02317083
Contributor : Frédéric Loulergue <>
Submitted on : Tuesday, October 15, 2019 - 6:29:53 PM
Last modification on : Monday, November 30, 2020 - 5:48:18 PM

Identifiers

Citation

Frédéric Loulergue, Christopher Whitney. Verified Programs for Frequent Itemset Mining. 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), Oct 2018, Guangzhou, China. pp.1516-1523, ⟨10.1109/SmartWorld.2018.00262⟩. ⟨hal-02317083⟩

Share

Metrics

Record views

48