[SOLVED] Finding one exampleset within another without id attribute
tennenrishin
Member Posts: 177 Contributor II
Let A be a large exampleset, without an id attribute.
Let B be a smaller exampleset with the same set of attributes, but fewer examples, say N.
(Usually N < 5)
Suppose we know that B is equal to some contiguous subrange of the examples in A. In other words, there exists some integer K such that every attribute in example B == every attribute in example A[K+J] for all J from 1 to N.
How can I get K? (e.g. into a macro)
Let B be a smaller exampleset with the same set of attributes, but fewer examples, say N.
(Usually N < 5)
Suppose we know that B is equal to some contiguous subrange of the examples in A. In other words, there exists some integer K such that every attribute in example B == every attribute in example A[K+J] for all J from 1 to N.
How can I get K? (e.g. into a macro)
0
Answers
matching patterns in example sets is a tricky thing. There are no operators for this in RapidMiner. You may have a look at this process, it does what you are looking for, although using it in combination with a huge example set may take some time... Cheers,
Helge