Skip to main content

Table 4 Run times (in seconds) for algorithms with zero uncertainty \(\beta =0\) for expensive and non-expensive datasets

From: Fast implementation of pattern mining algorithms with time stamp uncertainties and temporal constraints

EC/NEC

Support

Max length

No patterns

SPAM

\(\text {Apriori} + \text {bitmap} + \text {OMP}\)

FARPAM

FARPAMp

NEC

0.10

7

491

1.0

1.6

0.42

0.29

NEC

0.05

9

3414

3.6

3.8

1.45

0.47

NEC

0.03

11

15,413

9.3

12.0

7.60

0.84

NEC

0.02

12

51,413

20.9

36.2

3.47

1.82

NEC

0.01

14

427,239

88.5

301.0

21.92

10.16

EC

0.10

8

3416

1.3

1.7

0.56

0.24

EC

0.05

11

32,507

5.9

5.1

3.00

0.54

EC

0.03

12

163,949

18.5

27.3

9.73

1.67

EC

0.02

14

567,200

43.2

107.9

18.59

4.56

EC

0.01

16

479,3176

191.1

–

67.45

32.77