Patent Document ID: 7685021
Application ID: 11355567

Base Claim:
1. A method for implementation by one or more data processors comprising: creating, by at least one data processor, atomic pair-wise relationships between products; creating, by at least one data processor, higher order structures from said relationships between said products; finding, by at least one data processor, a set of all feasible, locally optimal, high cohesiveness product bundles; defining, by at least one data processor, a bundle-lattice-space of feasible bundles comprising a lower bounding foundation set required to be a subset of every feasible product bundle in lattice-space, an upper bounding candidate set required to be a superset of every feasible product bundle in the lattice-space, a bundleness measure of cohesiveness associated with each feasible product bundle, and a neighborhood function that allows either removal of a non-foundation product from, or addition of a candidate product to, a product bundle to reach a neighboring bundle in the lattice space; and initiating a transaction based on the defined bundle-lattice space of feasible bundles; wherein a locally optimal product bundle in the lattice space is defined as a product bundle whose bundle cohesiveness is higher than all of its neighbors, as defined by the neighborhood function, by a certain factor.

---

Claim 16:
16. The method of claim 1 , comprising: finding, by at least one data processor, bridge structures in a graph by applying any of: a bundle aggregation algorithm that uses pre-computed bundles to create bridge structures; wherein a bridge structure comprises a group of two or more bundles that share a small number of bridge products; said bundle aggregation algorithm starting with a root bundle and adding more bundles to said root bundle such that there is a non-zero overlap with a current set of bridge products; and a successive bundling algorithm that starts from scratch and uses depth first search for successively create more bundles to add to a bridge structure; wherein said successive bundling algorithm starts with a product as a potential bridge product, and grows product bundles using a depth first approach such that a foundation set contains said product and a candidate set is limited to a neighborhood of said product; wherein as a bundle is created and added to said bridge, it is removed from said neighborhood; and wherein in successive iterations, a reduced neighborhood is used as a candidate set and said successive bundling algorithm continues until all bundles are found; wherein said successive bundling algorithm is then repeated for all products as potential bridges.