Simple algorithms for frequent item set mining

DOI10.1007/978-3-642-05179-1_16MaRDI QIDQ5305735zbMATH OpenOpenAlexFDO

Authors Christian Borgelt

Publication date 23 March 2010

Published in Advances in Machine Learning II (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-05179-1_16

zbMATH Keywords

RElimSaM

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• An improved algorithm based on sets operation for mining frequent itemsets
• Knowledge Discovery in Inductive Databases
• scientific article; zbMATH DE number 5967649
• A novel bitmap-based algorithm for frequent itemsets mining
• A tree projection algorithm for generation of frequent item sets

Cited in

(2)

• Knowledge Discovery in Inductive Databases
• RElim

Describes a project that uses

Uses Software

• SaM
• PyFIM
• Eclat
• UCI

This page was built for publication: Simple algorithms for frequent item set mining

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305735)