Welcome to D
SIGMOD'00
PODS'00
SIGMOD Recor
CIKM 2000/CI
COMAD 2000
Data Enginee
DL 2000
DPDJ
EDBT 2000
Hypertext 20
ICDE 2000
<<< = ICDE'00 Pape>>>
KDD 2000
KDD Explorat
KRDB 2000
SBBD 2000
SIGIR 2000
SIGIR Forum
SSDBM 2000
TODS
VLDB'00
VLDBJ

Approximate Query Answering with Frequent Sets and Maximum Entropy


H. Mannila and P. Smyth

  View Paper (PDF)  

Return to OLAP, DW, and Data Mining


Abstract


We describe an approach to finding approximate answers to Boolean queries on 0/1 data. The basic idea is to build a probabilistic model for the data set and answer the queries on the basis of that model. The method consists of the following steps: 2. Model building: given a query, use the count information to construct an approximate probability model for the variables occurring in the query.



DiSC'01 Copyright ©2002 ACM Inc.