Parallel algorithms for enumerating closed patterns from multi-relational data
From MaRDI portal
Publication:1800394
DOI10.1016/j.dam.2018.03.080zbMath1398.68521OpenAlexW2883880001WikidataQ129458741 ScholiaQ129458741MaRDI QIDQ1800394
Publication date: 23 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.080
Database theory (68P15) Knowledge representation (68T30) Parallel algorithms in computer science (68W10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures
- Foundations of inductive logic programming
- Parallel algorithm for computing fixpoints of Galois connections
- Comparing performance of algorithms for generating concept lattices
- Conceptual Structures at Work
- Discovery Science
- Constraint-Based Mining and Inductive Databases
This page was built for publication: Parallel algorithms for enumerating closed patterns from multi-relational data