The implication problem for measure-based constraints

We study the implication problem of measure-based constraints. These constraints are formulated in a framework for measures generalizing that for mathematical measures. Measures arise naturally in a wide variety of domains. We show that measure constraints, for particular measures, correspond to constraints that occur in relational databases, data mining applications, cooperative game theory, and in the Dempster-Shafer and possibility theories of reasoning about uncertainty. We prove that the implication problem for measure constraints is in general decidable. We introduce inference systems for particular classes of measure constraints and show that some of these are complete, yielding tractability for the corresponding implication problem.

[1]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[2]  Dirk Van Gucht,et al.  Differential constraints , 2005, PODS '05.

[3]  Michel Grabisch,et al.  Equivalent Representations of Set Functions , 2000, Math. Oper. Res..

[4]  Virgil Pasquale Diodato,et al.  Dictionary of Bibliometrics , 1994 .

[5]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[6]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[7]  Michel Grabisch,et al.  An axiomatic approach to the concept of interaction among players in cooperative games , 1999, Int. J. Game Theory.

[8]  Peter Buneman,et al.  Semistructured data , 1997, PODS.

[9]  Arthur P. Dempster,et al.  A Generalization of Bayesian Inference , 1968, Classic Works of the Dempster-Shafer Theory of Belief Functions.

[10]  E. H. Simpson.  Measurement of Diversity , 1949, Nature.

[11]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[12]  Christian Herrmann.  On the Undecidability of Implications Between Embedded Multivalued Database Dependencies , 1995, Inf. Comput..

[13]  Toon Calders,et al.  Mining All Non-derivable Frequent Itemsets , 2002, PKDD.

[14]  M. Sugeno,et al.  Fuzzy Measures and Integrals: Theory and Applications , 2000 .

[15]  Steven Vajda,et al.  Games and Decisions. By R. Duncan Luce and Howard Raiffa. Pp. xi, 509. 70s. 1957. (J Wiley & Sons) , 1959, The Mathematical Gazette.

[16]  L. Zadeh.  Fuzzy sets as a basis for a theory of possibility , 1999 .

[17]  Catriel Beeri,et al.  A complete axiomatization for functional and multivalued dependencies in database relations , 1977, SIGMOD '77.

[18]  Marzena Kryszkiewicz,et al.  Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators , 2002, PAKDD.

[19]  Michel Grabisch,et al.  Fuzzy Measures and Integrals , 1995 .

[20]  G. A. Raggio.  Properties of q‐entropies , 1995 .

[21]  Tony T. Lee,et al.  An Infornation-Theoretic Analysis of Relational Databases—Part I: Data Dependencies and Information Metric , 1987, IEEE Transactions on Software Engineering.

[22]  Maurice Queyranne,et al.  An Introduction to Submodular Functions and Optimization , 2002 .

[23]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[24]  G. Choquet.  Theory of capacities , 1954 .

[25]  Claude Delobel,et al.  Normalization and hierarchical dependencies in the relational data model , 1978, TODS.

[26]  T. Yamano.  Information theory based on nonadditive information content. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Dirk Van Gucht,et al.  A measure-theoretic framework for constraints and bounds on measurements of data , 2005 .

[28]  Gordon Latta,et al.  Introduction to Difference Equations , 1958 .

[29]  Chris Clifton,et al.  Privacy-preserving distributed mining of association rules on horizontally partitioned data , 2004, IEEE Transactions on Knowledge and Data Engineering.

[30]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[31]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[32]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[33]  Christophe Rigotti,et al.  A condensed representation to find frequent patterns , 2001, PODS '01.

[34]  Francesco M. Malvestuto,et al.  Statistical treatment of the information content of a database , 1986, Inf. Syst..

[35]  Tgk Toon Calders.  Axiomatization and deduction rules for the frequency of itemsets , 2003 .

[36]  Howard Raiffa,et al.  Games and Decisions: Introduction and Critical Survey. , 1958 .

[37]  M. Gyssens,et al.  Another view of functional and multivalued dependencies in the relational database model , 2004, International Journal of Computer & Information Sciences.

[38]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[39]  C. Gini.  Measurement of Inequality of Incomes , 1921 .

[40]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[41]  Toon Calders,et al.  Axiomatization of frequent itemsets , 2003, Theor. Comput. Sci..

[42]  C. Tsallis.  Possible generalization of Boltzmann-Gibbs statistics , 1988 .

[43]  Carlo Zaniolo,et al.  Analysis and design of relational schemata for database systems. , 1976 .

[44]  Hamid Pirahesh,et al.  Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.

[45]  S. Goldberg,et al.  Introduction to Difference Equations , 1958 .

[46]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[47]  Joseph Y. Halpern.  Reasoning about uncertainty , 2003 .