A pattern p SB2343 a closed pattern if and only if there does not exist any super-pattern p’ (p ⊆ p’) s.t. sup(p) = sup(p’), namely, sup(p) > sup(p’) for all patterns p’ ⊃ p. p is a non-closed pattern if and only if there exists a super-pattern p’ s.t. sup(p) = sup(p’).
For example, in Table 3, the support of pattern “Obama leader” is 4, which is a frequent pattern. And the support of its all super-patterns is smaller than 4, so the pattern “Obama leader” is phosphorylation a closed pattern.
In all, there are 23 frequent patterns. Not all frequent patterns in Table 3 are useful. For example, pattern leader always occurs with term “Obama”, i.e., the shorter pattern Obama is always part of the longer pattern leader, Obama in all its covering sentences. Therefore, the shorter one, Obama , is a redundant pattern, and we only keep the longest patterns, namely closed patterns. After pruning non-closed patterns, we only have four closed patterns, which are shown in bold font.
For example, in Table 3, the support of pattern “Obama leader” is 4, which is a frequent pattern. And the support of its all super-patterns is smaller than 4, so the pattern “Obama leader” is phosphorylation a closed pattern.
In all, there are 23 frequent patterns. Not all frequent patterns in Table 3 are useful. For example, pattern leader always occurs with term “Obama”, i.e., the shorter pattern Obama is always part of the longer pattern leader, Obama in all its covering sentences. Therefore, the shorter one, Obama , is a redundant pattern, and we only keep the longest patterns, namely closed patterns. After pruning non-closed patterns, we only have four closed patterns, which are shown in bold font.