Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel algorithms for enumerating closed patterns from multi-relational data

From MaRDI portal
Publication:1800394
Jump to:navigation, search

DOI10.1016/j.dam.2018.03.080zbMath1398.68521OpenAlexW2883880001WikidataQ129458741 ScholiaQ129458741MaRDI QIDQ1800394

Hirohisa Seki, Masahiro Nagao

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


zbMATH Keywords

parallel algorithmformal concept analysisload-balancingmulti-relational data miningclosed patterns


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1800394&oldid=14152417"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki