Back to results
US 2015/0317476 A1Published application
Distributed Pattern Discovery
AssigneeHewlett-Packard Development Company, L.P.
InventorsAnurag Singla, Zhipeng Zhao, Fei Gao
Life of this patent
Estimating the term…
Abstract
Example embodiments disclosed herein relate to distributed pattern discovery. A local frequent pattern tree or local frequent pattern trees can be merged. The merging can be based on activities or transactions associated with the local frequent pattern tree or trees.
Claims15
A system for distributed pattern discovery comprising:
- a node comprising a processor and memory to:
- receive a plurality of local frequent pattern trees from a plurality of sub-nodes, wherein the respective local frequent pattern trees are based on a plurality of transactions:
- merge the local frequent pattern trees into a global pattern tree for the sub-nodes;
- send the global pattern tree to the sub-nodes.
1 more element
A non-transitory machine-readable storage medium for distributed pattern discovery storing instructions that, if executed by at least one processor of a device, cause the device to:
- generate a local frequent pattern tree of potential patterns for a plurality of transactions;
- send the local frequent pattern tree to a node of a hierarchical computing system, wherein the node is on a greater hierarchy;
- receive a global pattern tree that is merged based on the local frequent pattern tree and other local pattern trees from a plurality of devices on a same hierarchy of the device.
A method for distributed pattern discovery comprising:
- receiving, at a node, a plurality of local frequent pattern trees of potential patterns from a plurality of sub-nodes, wherein the respective local frequent pattern trees are based on a plurality of activities, wherein one of the local frequent pattern trees is associated with a count for a number of times one of the potential patterns has occurred in the activities;
- merging the local frequent pattern trees into a global pattern tree for the sub-nodes based, at least in part, on the count;
- and
- sending the global pattern tree to the sub-nodes.
1 more element
Dependencies are inferred from the claim text.