Probabilistic query models for transaction data

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Knowledge Discovery and Data Mining

• Publication date

  2001-08-26

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/502512.502536
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data

  2003influential reference
• Approximate query processing using wavelets

  2001cited by this paper
• Probabilistic Models for Query Approximation with Large Sparse Binary Data Sets

  2000cited by this paper
• Prediction with local patterns using cross-entropy

  1999cited by this paper
• Approximate computation of multidimensional aggregates of sparse data using wavelets

  1999cited by this paper
• Compressed data cubes for OLAP aggregate query approximation on continuous dimensions

  1999cited by this paper
• Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets

  1998cited by this paper
• Empirical Analysis of Predictive Algorithms for Collaborative Filtering

  1998cited by this paper
• ADtrees for Fast Counting and for Fast Learning of Association Rules

  1998cited by this paper
• Wavelet-based histograms for selectivity estimation

  1998cited by this paper
• New sampling-based summary statistics for improving approximate query answers

  1998cited by this paper
• AQUA: System and Techniques for Approximate Query Answering

  1998cited by this paper
• Cached Suucient Statistics for Eecient Machine Learning with Large Datasets

  1997cited by this paper
• A Bayesian Approach to Learning Bayesian Networks with Local Structure

  1997influential reference
• Selectivity Estimation Without the Attribute Value Independence Assumption

  1997cited by this paper
• Generalized Queries on Probabilistic Context-Free Grammars

  1996cited by this paper
• A Maximum Entropy Approach to Natural Language Processing

  1996cited by this paper
• Bucket elimination: A unifying framework for probabilistic inference

  1996cited by this paper
• Fast Discovery of Association Rules

  1996cited by this paper
• Inducing Features of Random Fields

  1995cited by this paper
• Efficient Algorithms for Discovering Association Rules

  1994cited by this paper
• Learning Bayesian Networks is

  1994cited by this paper
• Fast Algorithms for Mining Association Rules in Large Databases

  1994influential reference
• Mining association rules between sets of items in large databases

  1993cited by this paper
• A unique formal system for binary decompositions of database relations, probability distributions, and graphs

  1992cited by this paper
• Probabilistic reasoning in intelligent systems: Networks of plausible inference

  1991cited by this paper
• Practical selectivity estimation through adaptive sampling

  1990cited by this paper
• Equi-depth multidimensional histograms

  1988cited by this paper
• A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH

  1983cited by this paper
• Generalized Iterative Scaling for Log-Linear Models

  1972cited by this paper

• O EFEITO DO TRATAMENTO SUBCRÔNICO COM FLUOXETINA SOBRE A GLICEMIA DE JEJUM E O TESTE DE TOLERÂNCIA ORAL À GLICOSE EM RATOS NÃO DIABÉTICOS

  2009cites this paper
• Personalised ontology learning and mining for web information gathering

  2009cites this paper
• Exploiting non-redundant local patterns and probabilistic models for analyzing structured and semi-structured data

  2008cites this paper
• A Appendix : EM algorithm for mixture of maxent models

  2008cites this paper
• Data triage

  2007cites this paper
• Using and extending itemsets in data mining: query approximation, dense itemsets, and tiles

  2006cites this paper
• Safe projections of binary data sets

  2006cites this paper
• Learning Approximate MRFs from Large Transaction Data

  2006cites this paper
• Data Triage: an adaptive architecture for load shedding in TelegraphCQ

  2005cites this paper
• Scalable model-based clustering for large databases based on data summarization

  2005cites this paper
• Boolean Formulas and Frequent Sets

  2004cites this paper
• Approximate Query Answering by Model Averaging

  2003influential citation
• Mixtures of Conditional Maximum Entropy Models

  2003cites this paper
• Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data

  2003cites this paper
• Topics in 0--1 data

  2002cites this paper
• A Fast Fixed-Point Algorithm for Independent Component Analysis of Complex Valued Signals

  2000cites this paper
• An approximate MRF model for querying large sparse binary data

  year unknowncites this paper