Approximate query answering with frequent sets and maximum entropy

Heikki Mannila; Padhraic Smyth

doi:10.1109/ICDE.2000.839426

Approximate query answering with frequent sets and maximum entropy

^*Corresponding author for this work

Not published at Aalto University

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

6 Citations (Scopus)

Abstract

An approach to finding approximate answers to Boolean queries on 0/1 data is described. 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 count generation, model building, and approximate querying.

Original language	English
Title of host publication	Proceedings of 16th International Conference on Data Engineering
Publisher	IEEE
ISBN (Print)	0-7695-0506-6
DOIs	https://doi.org/10.1109/ICDE.2000.839426
Publication status	Published - 2000
MoE publication type	A4 Conference publication
Event	International Conference on Data Engineering - San Diego, United States Duration: 29 Feb 2000 → 3 Mar 2000 Conference number: 16

Conference

Conference	International Conference on Data Engineering
Abbreviated title	ICDE
Country/Territory	United States
City	San Diego
Period	29/02/2000 → 03/03/2000

Access to Document

10.1109/ICDE.2000.839426

Cite this

@inproceedings{e7e9645e37b24f4584922196360c4f99,

title = "Approximate query answering with frequent sets and maximum entropy",

abstract = "An approach to finding approximate answers to Boolean queries on 0/1 data is described. 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 count generation, model building, and approximate querying.",

author = "Heikki Mannila and Padhraic Smyth",

year = "2000",

doi = "10.1109/ICDE.2000.839426",

language = "English",

isbn = "0-7695-0506-6",

booktitle = "Proceedings of 16th International Conference on Data Engineering",

publisher = "IEEE",

address = "United States",

note = "International Conference on Data Engineering, ICDE ; Conference date: 29-02-2000 Through 03-03-2000",

}

TY - GEN

T1 - Approximate query answering with frequent sets and maximum entropy

AU - Mannila, Heikki

AU - Smyth, Padhraic

N1 - Conference code: 16

PY - 2000

Y1 - 2000

N2 - An approach to finding approximate answers to Boolean queries on 0/1 data is described. 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 count generation, model building, and approximate querying.

AB - An approach to finding approximate answers to Boolean queries on 0/1 data is described. 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 count generation, model building, and approximate querying.

U2 - 10.1109/ICDE.2000.839426

DO - 10.1109/ICDE.2000.839426

M3 - Conference article in proceedings

AN - SCOPUS:0033872458

SN - 0-7695-0506-6

BT - Proceedings of 16th International Conference on Data Engineering

PB - IEEE

T2 - International Conference on Data Engineering

Y2 - 29 February 2000 through 3 March 2000

ER -

Approximate query answering with frequent sets and maximum entropy

Abstract

Conference

Access to Document

Fingerprint

Cite this