Method for determining a most probable K location
First Claim
1. A method for processing a particle stream having at least one particle in a KStore system having a current K node, comprising:
- receiving said at least one particle within said particle stream to provide a received particle;
determining a match in accordance with said received particle and said current K node to provide a match determination; and
determining a most probable node in accordance with said match determination;
wherein said determining a match further comprises;
determining a completed level in accordance with said received particle and matched end product node above the elemental root nodes;
determining a root node in accordance with the current KStore level;
determining a higher level current K node on a higher KStore level in accordance with said current K node data;
determining a match in accordance with said current level root node and said higher level current K node to provide a higher level match determination and determining a most probable node in accordance with said higher level match determination.
8 Assignments
0 Petitions
Accused Products
Abstract
The process of traversing a K may involve determining a match between a root node and a Result node of a node on the asCase list of a current K node. When learning is off and a match is not found, the procedure may ignore the particle being processed. An alternative solution determines which node on the asCase list is the most likely to be the next node. While the K Engine is traversing and events are being recorded into a K structure, a count field may be added to each K node to contain a record of how many times each K path has been traversed. The count field may be updated according to the processes traversing the K. Typically, the count is incremented only for learning functions. This count field may be used in determining which node may be the most (or least) probable.
-
Citations
13 Claims
-
1. A method for processing a particle stream having at least one particle in a KStore system having a current K node, comprising:
-
receiving said at least one particle within said particle stream to provide a received particle; determining a match in accordance with said received particle and said current K node to provide a match determination; and determining a most probable node in accordance with said match determination; wherein said determining a match further comprises; determining a completed level in accordance with said received particle and matched end product node above the elemental root nodes; determining a root node in accordance with the current KStore level; determining a higher level current K node on a higher KStore level in accordance with said current K node data; determining a match in accordance with said current level root node and said higher level current K node to provide a higher level match determination and determining a most probable node in accordance with said higher level match determination. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
Specification