Effective Pruning for the Discovery of Conditional Functional Dependencies

Computer Journal - United Kingdom
doi 10.1093/comjnl/bxs082
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Incorporating Cardinality Constraints and Synonym Rules Into Conditional Functional Dependencies

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2009English

Functional Dependencies for Graphs

2016English

Functional Dependencies

2019English

Further Pruning for Efficient Association Rule Discovery

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Effective Pruning Strategies for Sequential Pattern Mining

2008English

On the Number of Independent Functional Dependencies

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Automatic Extraction of Functional Dependencies

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Simple and Efficient Model Pruning Method for Conditional Random Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Further Investigations on Strategies Developed for Efficient Discovery of Matching Dependencies

International Journal of Innovative Research in Computer and Communication Engineering
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy