Listing closed sets of strongly accessible set systems with applications to data mining

DOI10.1016/J.TCS.2009.10.024zbMATH Open1191.68346OpenAlexW2084044979MaRDI QIDQ844900FDOQ844900

Authors: Mario Boley, Axel Poigné, Stefan Wrobel, T. 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

Recommendations

• Set-oriented data mining in relational databases
• Enumerating maximal consistent closed sets in closure systems
• scientific article; zbMATH DE number 2120036
• scientific article; zbMATH DE number 2033349
• Closed-Set-Based Discovery of Representative Association Rules
• Closed sets for labeled data

zbMATH Keywords

algorithmsdata miningclosure operatorlisting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• On generating all maximal independent sets
• Graph-Theoretic Concepts in Computer Science
• Discovery Science
• Finding all closed sets: A general approach
• Formal Concept Analysis
• Title not available (Why is that?)

Cited In (17)

• Finding all closed sets: A general approach
• Restricted bi-pattern mining
• SIAS-miner: mining subjectively interesting attributed subgraphs
• Enumeration of support-closed subsets in confluent systems
• Extended dualization: application to maximal pattern mining
• Extensional confluences and local closure operators
• Maximal closed set and half-space separations in finite closure systems
• Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
• Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
• Interesting pattern mining in multi-relational data
• On closure operators related to maximal tricliques in tripartite hypergraphs
• Medical surveillance, frequent sets, and closure operations
• Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
• Effective approximation of parametrized closure systems over transactional data streams
• Polynomial-delay enumeration algorithms in set systems
• Experiments on \(F\)-restricted bi-pattern mining
• \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures

This page was built for publication: Listing closed sets of strongly accessible set systems with applications to data mining

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