Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

de Raedt, Luc
Jaeger, Manfred
Lee, Sau Dan
Mannila, Heikki

dblp
dblp
dblp
dblp

Not MPG Author(s):

de Raedt, Luc
Lee, Sau Dan
Mannila, Heikki

Editor(s):





BibTeX cite key*:

deRJaeLeeMan02

Title, Booktitle

Title*:

A Theory of Inductive Query Answering

Booktitle*:

Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02)

Event, URLs

URL of the conference:

http://kis.maebashi-it.ac.jp/icdm02/

URL for downloading the paper:

http://www.mpi-sb.mpg.de/~jaeger/publications/ICDM02.ps.gz

Event Address*:

Maebashi City, Japan

Language:

English

Event Date*
(no longer used):

-- December 9 - 12, 2002

Organization:

IEEE Computer Society

Event Start Date:

9 December 2002

Event End Date:

12 December 2002

Publisher

Name*:

IEEE

URL:

http://computer.org/cspress/

Address*:

Los Alamitos, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:

December

Pages:

123-130

Year*:

2002

VG Wort Pages:

16

ISBN/ISSN:

0-7695-1754-4

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We introduce the boolean inductive query evaluation problem, which is concerned with answering inductive que
ries
that are arbitrary boolean expressions over monotonic and anti-monotonic predicates. Secondly, we develop a d
ecomposition theory for inductive query evaluation in which
a boolean query $Q$ is reformulated into $k$ sub-queries $Q_i = Q_A \wedge Q_M$ that are the conjunction of a
monotonic and an anti-monotonic predicate.
The solution to each sub-query can be represented using a version space.
We investigate how the number of version spaces $k$ needed to answer the query
can be minimized.
Thirdly, for the pattern domain of strings, we show how the version spaces can be represented using a novel
data structure, called the version space tree, and can be computed using a variant of the famous Apriori alg
orithm.
Finally, we present some experiments that validate the approach.

URL for the Abstract:

http://www.mpi-sb.mpg.de/~jaeger/publications/ICDM02abstract.html



Download
Access Level:

MPG

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{deRJaeLeeMan02,
AUTHOR = {de Raedt, Luc and Jaeger, Manfred and Lee, Sau Dan and Mannila, Heikki},
TITLE = {A Theory of Inductive Query Answering},
BOOKTITLE = {Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02)},
PUBLISHER = {IEEE},
YEAR = {2002},
ORGANIZATION = {IEEE Computer Society},
PAGES = {123--130},
ADDRESS = {Maebashi City, Japan},
MONTH = {December},
ISBN = {0-7695-1754-4},
}


Entry last modified by Christine Kiesel, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Manfred Jaeger
Created
01/15/2003 07:38:10 PM
Revisions
5.
4.
3.
2.
1.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Manfred Jaeger
Manfred Jaeger
Edit Dates
01.09.2003 17:21:51
12.08.2003 17:39:50
28.07.2003 17:12:07
05/22/2003 07:47:49 PM
04/07/2003 09:55:52 AM