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 5:
5. The method of claim 1 , further comprising: de-coupling, by at least one data processor, transaction data from a bundleness computation by using only a co-occurrence matrix to compute bundleness without making repeated passes through transaction data in each step of a depth first or breadth first algorithm.