Publication
Title
Quick inclusion-exclusion
Author
Abstract
Many data mining algorithms make use of the well-known Inclusion-Exclusion principle. As a consequence, using this principle efficiently is crucial for the success of all these algorithms. Especially in the context of condensed representations, such as NDI, and in computing interesting measures, a quick inclusion-exclusion algorithm can be crucial for the performance. In this paper, we give an overview of several algorithms that depend on the inclusion-exclusion principle and propose an efficient algorithm to use it and evaluate its complexity. The theoretically obtained results axe supported by experimental evaluation of the quick IE technique in isolation, and of an example application.
Language
English
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Publication
Berlin : 2006
ISSN
0302-9743 [print]
1611-3349 [online]
Volume/pages
3933(2006), p. 86-103
ISI
000237245300006
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 08.10.2008
Last edited 10.06.2017
To cite this reference