Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/704
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GEERTS, Floris | - |
dc.contributor.author | GOETHALS, Bart | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2005-04-11T13:42:53Z | - |
dc.date.available | 2005-04-11T13:42:53Z | - |
dc.date.issued | 2001 | - |
dc.identifier.citation | Cercone, N. (Ed.) IEEE INTERNATIONAL CONFERENCE ON DATA MINING. PROCEEDINGS. p. 155-162. | - |
dc.identifier.isbn | 0-7695-1119-8 | - |
dc.identifier.uri | http://hdl.handle.net/1942/704 | - |
dc.description.abstract | In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing a tight upper bound, derived from a combinatorial result from the sixties by Kruskal and Katona. Our result is useful to reduce the number of database scans. | - |
dc.format.extent | 247125 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | IEEE Computer Society | - |
dc.title | A Tight Upper Bound on the Number of Candidate Patterns | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Cercone, N. | - |
local.bibliographicCitation.conferencedate | 2001 | - |
local.bibliographicCitation.conferencename | IEEE INTERNATIONAL CONFERENCE ON DATA MINING. PROCEEDINGS | - |
dc.identifier.epage | 162 | - |
dc.identifier.spage | 155 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C1 | - |
dc.identifier.isi | 000173158200020 | - |
local.bibliographicCitation.btitle | IEEE INTERNATIONAL CONFERENCE ON DATA MINING. PROCEEDINGS | - |
item.accessRights | Open Access | - |
item.contributor | GEERTS, Floris | - |
item.contributor | GOETHALS, Bart | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.fullcitation | GEERTS, Floris; GOETHALS, Bart & VAN DEN BUSSCHE, Jan (2001) A Tight Upper Bound on the Number of Candidate Patterns. In: Cercone, N. (Ed.) IEEE INTERNATIONAL CONFERENCE ON DATA MINING. PROCEEDINGS. p. 155-162.. | - |
item.validation | ecoom 2003 | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
datamining4.pdf | 241.33 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.