← all works
Mining frequent patterns without candidate generation
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Canadian affiliationAn author listed a Canadian institution. This is the only route the usual frame has.
Canadian funderA Canadian agency funded it. The work may carry no Canadian affiliation at all.
Abstract
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
The record
- Venue
- Topic
- Data Mining Algorithms and Applications
- Field
- Computer Science
- Canadian institutions
- Simon Fraser University
- Funders
- Natural Sciences and Engineering Research Council of Canada
- Keywords
- Computer science
- Has abstract in OpenAlex
- yes