Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Coding and information theory
Elements of information theory
Elements of information theory
C4.5: programs for machine learning
C4.5: programs for machine learning
Approximate inference of functional dependencies from relations
ICDT '92 Selected papers of the fourth international conference on Database theory
Providing better support for a class of decision support queries
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
From data mining to knowledge discovery: an overview
Advances in knowledge discovery and data mining
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Machine Learning
Recovering Information from Summary Data
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A note on approximation measures for multi-valued dependencies in relational databases
Information Processing Letters
Uniform Techniques for Deriving Similarities of Objects and Subschemes in Heterogeneous Databases
IEEE Transactions on Knowledge and Data Engineering
An Axiomatic Approach to Defining Approximation Measures for Functional Dependencies
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Improving Query Evaluation with Approximate Functional Dependency Based Decompositions
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
An information-theoretic approach to normal forms for relational and XML data
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On approximation measures for functional dependencies
Information Systems - Special issue: ADBIS 2002: Advances in databases and information systems
Information-theoretic tools for mining database structure from large data sets
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Mining approximate functional dependencies and concept similarities to answer imprecise queries
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM (JACM)
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML design for relational storage
Proceedings of the 16th international conference on World Wide Web
Discovering branching and fractional dependencies in databases
Data & Knowledge Engineering
HLS: Tunable Mining of Approximate Functional Dependencies
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
On generating near-optimal tableaux for conditional functional dependencies
Proceedings of the VLDB Endowment
Depth first algorithms and inferencing for AFD mining
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
An information-theoretic analysis of worst-case redundancy in database design
ACM Transactions on Database Systems (TODS)
Information theory for data management
Proceedings of the VLDB Endowment
Information theory for data management
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Mining non-redundant information-theoretic dependencies between itemsets
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Using structural information in XML keyword search effectively
ACM Transactions on Database Systems (TODS)
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
| Hi-index | 0.00 |
This paper uses the tools of information theory to examine and reason about the information content of the attributes within a relation instance. For two sets of attributes X and Y, an information dependency measure (InD measure) characterizes the uncertainty remaining about the values for the set Y when the values for the set X are known. A variety of arithmetic inequalities (InD inequalities) are shown to hold among InD measures; InD inequalities hold in any relation instance. Numeric constraints (InD constraints) on InD measures, consistent with the InD inequalities, can be applied to relation instances. Remarkably, functional and multivalued dependencies correspond to setting certain constraints to zero, with Armstrong's axioms shown to be consequences of the arithmetic inequalities applied to constraints. As an analog of completeness, for any set of constraints consistent with the inequalities, we may construct a relation instance that approximates these constraints within any positive &egr;. InD measures suggest many valuable applications in areas such as data mining.