← all works
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
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.
Abstract
No abstract. This is not a gap in this database — OpenAlex has none either. 23.3% of the frame is in this state, and the screen finds HALF as much metaresearch here, so the absence is a measured bias rather than a missing field.
The record
- Venue
- Data Mining and Knowledge Discovery
- Topic
- Data Mining Algorithms and Applications
- Field
- Computer Science
- Canadian institutions
- Simon Fraser University
- Funders
- —
- Keywords
- Data miningComputer scienceScalabilityTree (set theory)Set (abstract data type)Apriori algorithmGSP AlgorithmAssociation rule learningTrieTree structurePattern recognition (psychology)Data structureArtificial intelligenceDatabaseMathematics
- Has abstract in OpenAlex
- no