Effective approximation of parametrized closure systems over transactional data streams

DOI10.1007/S10994-019-05827-WMaRDI QIDQ782465zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Trabold, T. Horváth, Stefan Wrobel

Publication date 27 July 2020

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-019-05827-w

zbMATH Keywords

closed itemsetsconcept drift detectiondata streamsitemset mining

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Recommendations

• An efficient database transitive closure algorithm
• Efficient computation of transitive closures
• An experimental study of algorithms for fully dynamic transitive closure
• Algorithms – ESA 2005

Cites work

• A survey on concept drift adaptation
• Finding all closed sets: A general approach
• Formal Concept Analysis
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Listing closed sets of strongly accessible set systems with applications to data mining
• Mining frequent closed itemsets from a landmark window over online data streams
• On maximal frequent and minimal infrequent sets in binary matrices
• Probability Inequalities for Sums of Bounded Random Variables
• Probability inequalities for the sum in sampling without replacement
• Queries and concept learning
• Random sampling with a reservoir

Describes a project that uses

Uses Software

• UCI
• StreamKrimp

This page was built for publication: Effective approximation of parametrized closure systems over transactional data streams

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