| Ed Prochak 2006-05-10, 7:07 pm |
|
Generic Usenet Account wrote:
> Generic Usenet Account wrote:
>
> Before I get slammed again, let me clarify the definition further. A
> weak pattern is a collection (not set, since set implies ordering) of
Set does NOT imply ordering (A Set is by definition unordered). but why
you make this point when later you say order is a necessary condition
is a little puzzling here.
> symbols, not necessarily contiguous, which repeats itself more than
> once in a data stream. Even though contiguity of symbols within a
> pattern is not important, the order of the symbols within the pattern
> is important.
So you really mean an Ordered Set of symbols.
>
> For example, in the data stream 2-4-7-8-0-1-2-3-5-4-6-0-7 (slighly
> modified version of the original data stream i.e.
> 2-4-7-8-0-1-2-3-5-4-6-7-0) the weak pattern 2-4-7-0 does not exist.
> However, the weak patterns 2-4-7 and 2-4-0 exist in the data stream.
>
> Needless to say, the algorithm does not assume prior knowledge of these
> patterns. The algorithm should be able to discover them.
>
> -Song
Is there at least a certain minimal length to the "weak patterns"?
so is '0' a weak pattern? Is '2-4'?
If the data stream included one more digit at the end, an 8, then would
2-4-8 fit?
them would 2-4-7-8 work?
Does a strong pattern always satisfy the conditions of a weak pattern?
(if it doesn't then the algorithm will have to filter strong patterns
OUT of the results.)
I'm curious about your problem since I have an analogous problem that
the solution to your problem might help my pattern matching problem.
Let us know your result.
Ed
|