Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/8504
Title: | Quick inclusion-exclusion | Authors: | Calders, T GOETHALS, Bart |
Issue Date: | 2006 | Publisher: | SPRINGER-VERLAG BERLIN | Source: | KNOWLEDGE DISCOVERY IN INDUCTIVE DATABASES. p. 86-103 | Series/Report: | LECTURE NOTES IN COMPUTER SCIENCE | Series/Report no.: | 3933 | 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. | Notes: | Univ Antwerp, B-2020 Antwerp, Belgium. | Document URI: | http://hdl.handle.net/1942/8504 | ISSN: | 0302-9743 | ISI #: | 000237245300006 | Category: | A1 | Type: | Journal Contribution |
Appears in Collections: | Research publications |
Show full item record
WEB OF SCIENCETM
Citations
4
checked on Mar 23, 2024
Page view(s)
60
checked on Sep 7, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.