Link key candidate extraction with relational concept analysis
DOI10.1016/J.DAM.2019.02.012zbMATH Open1430.68327OpenAlexW2921119483WikidataQ128248059 ScholiaQ128248059MaRDI QIDQ2286378FDOQ2286378
Authors: Manuel Atencia, Jérôme David, J. Euzenat, Amedeo Napoli, Jérémy Vizzini 
Publication date: 22 January 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.012
Recommendations
- Relational concept analysis: mining concept lattices from multi-relational data
- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
- Exploratory knowledge discovery over web of data
- On learning context-aware rules to link RDF datasets
- Mining Description Logics Concepts with Relational Concept Analysis
formal concept analysislinked datarelational concept analysisresource description frameworkdata interlinkinglink key
Cites Work
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Title not available (Why is that?)
- Comparing performance of algorithms for generating concept lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ontology Matching
- Relational concept analysis: mining concept lattices from multi-relational data
- Functional dependencies in relational databases: A lattice point of view
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functional and approximate dependency mining: database and FCA points of view
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Soundness and completeness of relational concept analysis
- Title not available (Why is that?)
Cited In (10)
- Discovery of link keys in resource description framework datasets based on pattern structures
- Relational concept analysis in practice: capitalizing on data modeling using design patterns
- Fixed-point semantics for barebone relational concept analysis
- Sandwich: an algorithm for discovering relevant link keys in an LKPS concept lattice
- A novel ranking framework for linked data from relational databases
- On learning context-aware rules to link RDF datasets
- Logical foundations of linked data anonymisation
- Pattern mining in linked data by edge-labeling
- Exploratory knowledge discovery over web of data
- Steps towards causal Formal Concept Analysis
Uses Software
This page was built for publication: Link key candidate extraction with relational concept analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286378)
