Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/8504
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Calders, T | - |
dc.contributor.author | GOETHALS, Bart | - |
dc.date.accessioned | 2008-10-03T09:43:52Z | - |
dc.date.available | 2008-10-03T09:43:52Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | KNOWLEDGE DISCOVERY IN INDUCTIVE DATABASES. p. 86-103 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/8504 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.relation.ispartofseries | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.title | Quick inclusion-exclusion | - |
dc.type | Journal Contribution | - |
local.bibliographicCitation.conferencename | KNOWLEDGE DISCOVERY IN INDUCTIVE | - |
dc.identifier.epage | 103 | - |
dc.identifier.spage | 86 | - |
local.format.pages | 18 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Univ Antwerp, B-2020 Antwerp, Belgium. | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.relation.ispartofseriesnr | 3933 | - |
dc.bibliographicCitation.oldjcat | A1 | - |
local.class | dsPublValOverrule/no_publishing_delay | - |
dc.identifier.isi | 000237245300006 | - |
item.accessRights | Closed Access | - |
item.contributor | Calders, T | - |
item.contributor | GOETHALS, Bart | - |
item.fullcitation | Calders, T & GOETHALS, Bart (2006) Quick inclusion-exclusion. In: KNOWLEDGE DISCOVERY IN INDUCTIVE DATABASES. p. 86-103. | - |
item.fulltext | No Fulltext | - |
crisitem.journal.issn | 0302-9743 | - |
Appears in Collections: | Research publications |
WEB OF SCIENCETM
Citations
4
checked on Apr 16, 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.