Quick inclusion-exclusion

T. Calders, B. Goethals

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    7 Citations (Scopus)


    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 are supported by experimental evaluation of the quick IE technique in isolation, and of an example application.
    Original languageEnglish
    Title of host publicationKnowledge discovery in inductive databases : 4th International Workshop, KDID 2005, Porto, Portugal, October 3, 2005 : revised selected papers
    EditorsF. Bonchi, J.F. Boulicaut
    Place of PublicationBerlin
    ISBN (Print)3-540-33292-8
    Publication statusPublished - 2005

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    Dive into the research topics of 'Quick inclusion-exclusion'. Together they form a unique fingerprint.

    Cite this