Discovery Science
From MaRDI portal
Publication:5464540
DOI10.1007/b100845zbMath1110.68472OpenAlexW4253950044MaRDI QIDQ5464540
Hiroki Arimura, Tatsuya Asai, Yuzo Uchida, Takeaki Uno
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
Related Items (16)
Listing closed sets of strongly accessible set systems with applications to data mining ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ On the efficient stability computation for the selection of interesting formal concepts ⋮ Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns ⋮ On the termination of some biclique operators on multipartite graphs ⋮ ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS ⋮ Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery ⋮ Mining closed patterns in relational, graph and network data ⋮ Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence ⋮ Parallel algorithms for enumerating closed patterns from multi-relational data ⋮ Interesting pattern mining in 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
Uses Software
This page was built for publication: Discovery Science
