Pages that link to "Item:Q844900"
From MaRDI portal
The following pages link to Listing closed sets of strongly accessible set systems with applications to data mining (Q844900):
Displaying 14 items.
- \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures (Q740594) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- Effective approximation of parametrized closure systems over transactional data streams (Q782465) (← links)
- On closure operators related to maximal tricliques in tripartite hypergraphs (Q1800387) (← links)
- Experiments on \(F\)-restricted bi-pattern mining (Q2086640) (← links)
- Enumeration of support-closed subsets in confluent systems (Q2134743) (← links)
- SIAS-miner: mining subjectively interesting attributed subgraphs (Q2218410) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- Extended dualization: application to maximal pattern mining (Q2634673) (← links)
- Restricted bi-pattern mining (Q2670900) (← links)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset (Q2671748) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- Extensional Confluences and Local Closure Operators (Q5255653) (← links)
- Polynomial-delay enumeration algorithms in set systems (Q6104349) (← links)