Listing closed sets of strongly accessible set systems with applications to data mining
From MaRDI portal
Publication:844900
DOI10.1016/j.tcs.2009.10.024zbMath1191.68346MaRDI QIDQ844900
Mario Boley, Axel Poigné, Stefan Wrobel, Tamás L. Horváth
Publication date: 5 February 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.024
68Q25: Analysis of algorithms and problem complexity
68P15: Database theory
68W05: Nonnumerical algorithms
06A15: Galois correspondences, closure operators (in relation to ordered sets)
Related Items
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties, Extensional Confluences and Local Closure Operators, Polynomial-delay enumeration algorithms in set systems, \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures, Interesting pattern mining in multi-relational data, Effective approximation of parametrized closure systems over transactional data streams, On closure operators related to maximal tricliques in tripartite hypergraphs, Experiments on \(F\)-restricted bi-pattern mining, Enumeration of support-closed subsets in confluent systems, SIAS-miner: mining subjectively interesting attributed subgraphs, Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games, Extended dualization: application to maximal pattern mining, Restricted bi-pattern mining, Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
Cites Work
