An efficient algorithm for enumerating closed patterns in transaction databases

DOI10.1007/978-3-540-30214-8_2MaRDI QIDQ5464540zbMATH OpenOpenAlexFDO

Authors Takeaki Uno, Tatsuya Asai, Hiroki Arimura, Yuzo Uchida

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100845

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Mining closed patterns in relational, graph and network data
• scientific article; zbMATH DE number 2112391
• An incremental algorithm for mining frequent closed patterns
• An efficient algorithm of mining frequent closed inter-transaction itemsets
• Inductive Logic Programming

Cited in

(22)

• Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery
• Parallel algorithms for enumerating closed patterns from multi-relational data
• LCM from FCA point of view: a CbO-style algorithm with speed-up features
• Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
• On the efficient stability computation for the selection of interesting formal concepts
• Mining closed patterns in relational, graph and network data
• \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
• Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
• Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
• A new algorithm for mining frequent closed patterns in gene expression data sets
• scientific article; zbMATH DE number 2112391 (Why is no real title available?)
• Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
• On the termination of some biclique operators on multipartite graphs
• ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS
• An efficient algorithm of mining frequent closed inter-transaction itemsets
• Inductive Logic Programming
• Pruning techniques in lincbo for the computation of the duquenne-guigues basis
• Formal concept analysis: from knowledge discovery to knowledge processing
• Efficient discovery of interesting patterns based on strong closedness
• Interesting pattern mining in multi-relational data
• Listing closed sets of strongly accessible set systems with applications to data mining
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

Describes a project that uses

Uses Software

• gSpan

This page was built for publication: An efficient algorithm for enumerating closed patterns in transaction databases

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