### Table 2. Mining frequent patterns by creating conditional (sub)pattern-bases.

2000

"... In PAGE 18: ... Thus, the p-projected database becomes {fcam, cb, fcam}. This is very similar to the the p-conditional pattern- base shown in Table2 except fcam and fcam are expressed as (fcam:2) in Table 2. After that, the p-conditional FP-tree can be built on the p-projected database based on the FP-tree construction algorithm.... ..."

Cited by 599

### Table 2. Conditional Pattern Bases and the Conditional FPtrees (mining process).

"... In PAGE 3: ... If the support of an item is less than the minimum support threshold, it is not added in the frequent string. Table2 gives all conditional bases and conditional FP- Trees generated from the example in Table 1. 3 Experimental Results A shared memory SGI Origin 2400 with 64 processors was used to conduct the experiments.... ..."

### Table 2: Categorization of unsupervised frequent pattern mining methods based on time interval data models.

"... In PAGE 8: ... Each group is then converted to a partial order. In Table2 the properties of the described approaches for pattern discovery in interval series and sequences are listed in order of increasing expressivity of the pattern language and earlier publication. All except the second method work on multivariate interval series and interval sequences.... ..."

### Table 1: The transaction database DB as our running example.

2000

"... In PAGE 3: ...1 FrequentPattern Tree To design a compact data structure for e#0Ecient frequent pattern mining, let apos;s #0Crst examine a tiny example. Example 1 Let the transaction database, DB, be #28the #0Crst two columns of#29 Table1 and the minimum support... ..."

Cited by 599

### Table 2: Conditional Pattern Bases and the Conditional FPtrees (mining process).

2001

"... In PAGE 10: ...Table 2: Conditional Pattern Bases and the Conditional FPtrees (mining process). Table2 gives all conditional bases and conditional FP-Trees generated from the example in Table 1. 3 Experimental Results A shared memory SGI Origin 2400 with 64 processors was used to conduct the experiments.... ..."

Cited by 19

### Table 2. Frequent Patterns

2002

"... In PAGE 5: ... Assume that the minimum support is set to 0.5, we can get the set of all frequent patterns as shown in Table2 . According to formula (1), we can get the outlier factor value of each record as shown in Table 1 (the fifth column).... ..."

Cited by 1

### Table 6: Mining all-patterns by creating conditional XFP-tree

### Table 2. Mining of all-patterns based on FP-tree in Figure 2

### Table 1: A transaction database as running example.

"... In PAGE 2: ...1 FrequentPattern Tree To design a compact data structure for e#0Ecient fre- quent pattern mining, let apos;s #0Crst examine an example. Example 1 Let the transaction database, DB,be #28the #0Crst two columns of#29 Table1 and #18 =3. A compact data structure can be designed based on the following observations.... ..."

### Table 3: Frequent Sequential Patterns

2003

"... In PAGE 5: ...The details of this algorithm are given in Figure 3. To continue our example, Table3 and 4 show the fre- Size 1 Size 2 lt;A gt;(5) lt;A,B gt;(4) lt;B gt;(6) lt;B,E gt;(4) lt;C gt;(4) lt;E gt;(5) Table 4: Frequent Contiguous Sequential Patterns C (4) B (4) C (4) E (4) E (5) C (4) C (4) A(5) B(6) C(4) E(5) O Depth 0 Depth 1 Depth 2 Depth 3 E (4) Figure 4: The Frequent Sequential Pattern Trie for ex- ample quent sequential patterns and frequent contiguous se- quential patterns with a frequency threshold of 4 over the example transaction set given in Table 1. Figures 4 and 5 show the trie representation of the sequential and con- tiguous sequential patterns listed in the Table 3 and 4, respectively.... In PAGE 5: ... To continue our example, Table 3 and 4 show the fre- Size 1 Size 2 lt;A gt;(5) lt;A,B gt;(4) lt;B gt;(6) lt;B,E gt;(4) lt;C gt;(4) lt;E gt;(5) Table 4: Frequent Contiguous Sequential Patterns C (4) B (4) C (4) E (4) E (5) C (4) C (4) A(5) B(6) C(4) E(5) O Depth 0 Depth 1 Depth 2 Depth 3 E (4) Figure 4: The Frequent Sequential Pattern Trie for ex- ample quent sequential patterns and frequent contiguous se- quential patterns with a frequency threshold of 4 over the example transaction set given in Table 1. Figures 4 and 5 show the trie representation of the sequential and con- tiguous sequential patterns listed in the Table3 and 4, respectively. The sequential pattern lt; A,B,E gt; ap- pears in the figure 4 because it is the subsequence of 4 transactions: T1,T2,T3 and T5.... ..."

Cited by 5