Mining approximate interval-based temporal dependencies
From MaRDI portal
Publication:329410
DOI10.1007/S00236-015-0246-XzbMATH Open1350.68088OpenAlexW1732718201WikidataQ62612980 ScholiaQ62612980MaRDI QIDQ329410FDOQ329410
Authors: Carlo Combi, Pietro Sala 
Publication date: 21 October 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-015-0246-x
Recommendations
Cites Work
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Tableaux for logics of subinterval structures over dense orderings
- Title not available (Why is that?)
- The undecidability of the logic of subintervals
- Approximate inference of functional dependencies from relations
- Some simplified NP-complete graph problems
- Minimal-change integrity maintenance using tuple deletions
- Why is it hard to obtain a dichotomy for consistent query answering?
- On the complexity of inferring functional dependencies
- Encyclopedia of Database Systems
- Algorithms for inferring functional dependencies from relations
- A Modal Logic for Chopping Intervals
- Interval-based temporal functional dependencies: specification and verification
- Complete and terminating tableau for the logic of proper subinterval structures over dense orderings
Cited In (6)
- Evaluation of temporal datasets via interval temporal logic model checking
- Minimal bases of temporal attribute implications
- Extracting interval temporal logic rules: a first approach
- Predictive mining of multi-temporal relations
- Title not available (Why is that?)
- Interval-based temporal functional dependencies: specification and verification
Uses Software
This page was built for publication: Mining approximate interval-based temporal dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329410)
