69 search results - page 3 / 14 » An Efficient Algorithm for Enumerating Closed Patterns in Tr... |
KDD
2004
ACM
14 years 7 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
DAWAK
2009
Springer
13 years 11 months ago
2009
Springer
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
AICCSA
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a systematic approach to mine colocation patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of s...
CIKM
1998
Springer
13 years 11 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...