FR3051945A1 - METHOD FOR DETERMINING PURCHASES CARRIED OUT BY A USER - Google Patents

Abstract

The present invention relates to a method for determining purchases made by a user of a store (100), wherein the method comprises: - determining (501) a path (104) in a store associated with the user said store; for each shopping list (305, 306, 307, 308) in the set of shopping lists calculate a proximity between each element of said shopping list and the determined trajectory (104); - determination (511) of a probable shopping list among all shopping lists (305, 306, 307, 308), said determination of the probable shopping list is a function of the proximity calculated for said list shopping.

Description

METHOD FOR DETERMINING PURCHASES CARRIED OUT BY A

USER

The present invention relates to the field of collecting the behavioral data of users in stores, in particular by analyzing their trajectory.

Today, it is quite possible to follow a consumer in a supermarket or more generally in a store. This monitoring makes it possible to determine the trajectories of the consumer, and, depending on the accuracy of the tracking means, to determine the areas of the store in which the consumer spends the most time or a contrario in which the consumer is just passing.

However, this monitoring does not make it possible to know the impact of the consumer's trajectory on his purchases: - if the consumer passes quickly within a radius, does this mean that the consumer does not buy anything (dead zone) or that his purchasing decision is immediate (eg the consumer knows what he wants to buy / the consumer is significantly affected by the advertising on the shelves)? - if a consumer stays on the shelf for a long time, does this mean that he buys a large number of products or does he hesitate in front of the department without making a purchasing decision?

In most cases, stores only have knowledge of the penetration rate, defined as the percentage of customers who have purchased a particular product. Nevertheless, the exposure rate T ^^ po (share of consumers who see the product), the interest rate Tint (share of consumers who see the product and who are interested in it) and the conversion rate Tconv (share consumers who are interested in the product and who buy it) are most often ignored by the stores, failing to have a method of estimating these rates: the simple follow-up of a consumer does not allow access at these different rates.

Usually, we have Tp ^ ne = Tconv x T'expo x 7'mte ·

To know these different rates, it is useful to know the actual purchases made by a consumer followed.

Document US 2011/02002226 A1 proposes a method for determining these purchases. In this case, during the checkout, the image of a consumer is extracted by means of camera images (for example, video surveillance) and once extracted, its past trajectory is searched in the database of images cameras. Nevertheless, this method requires high resolution cameras to avoid abusive recognition (or false positive in English). Moreover, this method assumes that it is possible to associate with a given consumer a receipt in a certain way. This is not always the case and the reliability of the method proposed by such a method can be questioned.

For example, if the location method is imprecise (eg, radio location of the consumer), it may be difficult to know the box the consumer has been through.

On the other hand, if the consumer remains in the box for a long time (eg because the previous consumer has many purchases), there may be uncertainty as to the combination of his receipt.

There is thus a need to strengthen the reliability of the process of association of cash receipts with a consumer and thus accurately determine the purchases made by the consumer followed.

The present invention improves the situation. For this purpose, the present invention proposes a method for determining purchases made by a user of a store, wherein the method comprises: determining a path in a store associated with the user of said store; when the position of the user of said magazine is in an area of the magazine corresponding to the crates and a criterion of time or speed is filled, determining a set of shopping lists corresponding to crates of said magazine, each shopping list comprising a set of items purchased by a user of said store; for each shopping list in the set of shopping lists determined: determining a position of each item of said shopping list; calculating a distance between the position of each element and said determined trajectory; - Determining a probable shopping list among all the shopping lists, said determination of the probable shopping list is a function of the distance calculated for said shopping list; - Associating said probable shopping list with said determined trajectory.

By associating a probable shopping list with a trajectory, it is possible to accurately determine statistics relating to user habits. The store user can also be called "consumer".

A shopping list can also be called a "receipt".

In one possible embodiment, the determination of the set of shopping lists may comprise: for each shopping list from the set of shopping lists, assigning a first probability value to said shopping list said first probability value being a function of a distance from a cash register having generated said shopping list at a user's location, when the user's position of said store is in an area of the store corresponding to the cash registers; wherein the determination of the probable shopping list may be a function of the first probability value assigned for said shopping list.

Furthermore, the determination of the set of shopping lists may also comprise: for each shopping list from the set of shopping lists, assigning a second probability value to said shopping list, said second shopping list; probability value being a function of a difference between a moment associated with a generation of said shopping list by a cash register and a moment of presence for which the position of the user of said store is in a zone of the store corresponding to the cash registers; wherein the determination of the probable shopping list may be a function of the second probability value assigned for said shopping list.

The first probability value may be zero if the distance from a cash register that generated said shopping list to a user's location is greater than a predetermined distance.

In one embodiment, the moment associated with the generation of said shopping list may be the smallest time among all the input times of all the items purchased for the generation of said shopping list, and in which the second probability value can be zero if the moment associated with the generation of said shopping list is prior to said moment of presence.

In addition, the moment associated with the generation of said shopping list may be the greatest time among all the times of entry of all the items purchased for the generation of said shopping list. and wherein the second probability value may be zero if the moment associated with the generation of said shopping list is later than said moment of presence.

Advantageously, said determination of the probable shopping list may be a function of a comparison between the number of items purchased for each shopping list in the set of specified shopping lists and a length of said trajectory.

In addition or alternatively, the calculation of the distance between the position of each element and said determined trajectory may comprise, for each element: if said trajectory intersects a region of the magazine in which said element is located, said distance is incremented positively, respectively negatively; - Otherwise, said distance is incremented negatively, respectively positively.

The calculation of the distance between the position of each element and said determined trajectory may also comprise, for each element: said distance is incremented as a function of the distance of the trajectory at the position of said element in the magazine.

In one embodiment, the criterion of time or speed may be a criterion or a combination of criteria among: a consecutive time during which the position of the user of said store is in the area of the store corresponding to the boxes is greater than a predetermined time; - A speed of the position of the user (and therefore the user) of said magazine is less than a predetermined speed.

The present invention also provides a system for determining purchases made by a user of a store, in which the system comprises: a location device for determining a trajectory in a store associated with the user of said store; a circuit for the determination, when the position of the user of said magazine is in an area of the magazine corresponding to the crates and a time or speed criterion is filled, of a set of shopping lists corresponding to crates of said store, each shopping list comprising a set of items purchased by a user of said store; - a circuit for, for each shopping list in the set of shopping lists determined: - the determination of a position of each item of said shopping list; calculating a distance between the position of each element and said determined trajectory; a circuit for determining a probable shopping list among all the shopping lists, said determination of the probable shopping list is a function of the distance calculated for said shopping list; a circuit for associating said probable shopping list with said determined trajectory.

A computer program, implementing all or part of the method described above, installed on a pre-existing equipment, is in itself advantageous.

Thus, the present invention also relates to a computer program comprising instructions for implementing the method described above, when this program is executed by a processor.

This program can use any programming language (eg, object language or other), and be in the form of interpretable source code, partially compiled code, or fully compiled code.

Figure 5 described in detail below can form the flowchart of the general algorithm of such a computer program. Other features and advantages of the invention will become apparent on reading the description which follows. This is purely illustrative and should be read in conjunction with the accompanying drawings in which: - Figure 1 illustrates a journey of a consumer within a store; - Figure 2 illustrates the calculation of a first probability associated with shopping lists; - Figure 3 illustrates the calculation of a second probability associated with shopping lists; FIGS. 4a and 4b illustrate the calculation of a distance between a shopping list and a trajectory; FIG. 5 illustrates a flowchart of a possible embodiment in one embodiment of the invention; FIG. 6 illustrates a device for determining consumer purchases in one embodiment of the invention.

Figure 1 illustrates a consumer's journey within a store.

When a consumer enters a store 100 (at point 105), there are a large number of methods for determining his trajectory 104 within the store (ie along shelves 103) until his checkout (point 106) .

These methods of location are diverse and have variable degrees of precision ranging from a few centimeters to a few meters. Among these methods, it is possible to name indoor positioning techniques (or "indoor geolocation system"): - by Wifi; - by Bluetooth (including the Apple Beacon or iBeacon) (eg the Bluetooth protocol of the consumer's phone can be used to communicate with sensors placed in the store, and the system recognizes a smartphone thanks to its MAC address Bluetooth, Wifi, or its identifier); - by NFC / RFID (eg an NCF chip is inserted into a shopping cart); - by UWB (for Ultra Wide Band in English); - using video surveillance images or more generally cameras; - by Ultrasound or Li-Fi (eg: ultrasonic / LiFi transmitters are installed in the store lighting); - etc.

When the indoor positioning method uses sensors and signals (sound, electromagnetic, or other) communicated between a transmitter (s) and a receiver (s), different methods can be used to obtain the customer's position from the signals in question. , in particular: - The detection of the time of flight (or "time offlight" in English), which allows using the velocity already known to the wave to reach the distance between transmitter and receiver. - The detection of the arrival angle of the signal on the receiver (s). - Estimation of the distance from the strength of the signal received by the receiver (s), using previously executed charts. On the other hand, whatever the type of signal used, triangulation methods can be used (necessary or not) to reach a precise position of the customer.

The box area 102 may be arbitrarily defined. In the example of Figure 1, the area of the store corresponding to the boxes is a rectangular area encompassing the boxes (eg 101) and not covering the shelves (eg 103). This zone 102 can also be defined as a union of circles whose centers are each boxes and whose radius is predefined (eg 2m around each box).

It is possible to consider that the consumer arrives in the cash box to pay when: his presence extends in this zone 102 for a predetermined time; its speed is less than a predetermined speed in this zone 102; - a combination of the two previous criteria is verified.

Thus, the incursion of the consumer at the level of the arrow 107 is not necessarily considered as a cash pass.

It is also possible to consider that the consumer arrives in the cash box to pay when the presence of the consumer in the zone 102 is the last presence detected before leaving the store.

Moreover, because of the uncertainty of the position of the consumer, the predetermined time or the predetermined speed can be a function of an index of certainty (or uncertainty) of the presence of the consumer in the zone 102 (eg more the certainty is high, the more the predetermined speed can be important or the predetermined time can be short).

Figure 2 illustrates the calculation of a first probability associated with shopping lists.

When the consumer enters the zone 102 to make purchases, there may be uncertainty regarding his position and therefore concerning the cash used to pay for his purchases.

Because of this uncertainty, it is possible to associate with each cash register (and therefore with each shopping list generated by the corresponding cash register) a first probability value Pi according to this uncertainty of position.

Most often this position uncertainty is a function decreasing from a reference position of the consumer (i.e. the most probable position): thus, the first value Pi can be of the form of the curve 201, for example.

Moreover, and for simplicity of implementation, it is possible to predict that the value Pi is zero beyond a certain distance (ie xo in FIG. 2) with respect to the consumer's position (ex most probable position): this makes it possible to exclude / filter the shopping lists generated by crates too far from the consumer's position.

The probability value Pi associated with each cash register (and therefore with each shopping list generated by this cash register) may be the value of the curve 201 for a corresponding abscissa x at the center of the cashier. This value can also be the maximum or minimum or average value of the curve 201 for the width along the X axis of the considered body.

Figure 3 illustrates the calculation of a second probability associated with shopping lists.

When the consumer enters the zone 102 to make his purchases, there may be an uncertainty regarding the shopping list that may be associated with him: indeed, his time of presence at the checkout level (represented by the arrow 302) may correspond to the generation of several shopping lists (eg represented by the arrows 305 to 308, the left end of the arrows 305 to 308 representing the beginning of the generation (eg 303) and the right end of the arrows 305 to 308 representing the end of the generation or the actual payment (eg 304)).

Because of this uncertainty, it is possible to associate to a shopping list generated by a given box a second probability value P2 as a function of this uncertainty.

For example, this probability value P2 (represented for example by the curve 301) may be higher for the shopping lists that have been generated at a date close to the departure of the consumer of the zone 102 (ie close to the stretch of the arrow 302).

Moreover, this probability value P2 may be zero for the shopping lists that have started to be generated or have finished being generated at a time when the consumer is not in the zone 102: indeed, it can be considered improbable that a shopping list is being generated while the consumer is not yet present or has just left.

The probability value P2 associated with each shopping list can be the value of the curve 301 for a time corresponding to the beginning of the generation of the shopping list or corresponding to the end / middle of the generation of the list of purchases. purchases. This value can also be the maximum or minimum or average value of the curve 301 during the generation of the shopping list under consideration.

Figures 4a and 4b illustrate the calculation of a distance between a shopping list and a trajectory.

The distance of a shopping list to a trajectory can be defined as a sum (weighted possibly) of the distances between the position (in racking) of each element bought on the shopping list and the trajectory.

The distance here must be understood in the broad sense (ie in the mathematical sense, for example) and not only in the sense of a Euclidean distance (even if the use of such an Euclidean distance remains possible).

For example, if the shopping list includes the products 401 to 408 located in shelves according to the plan of Figure 4a, the distance can be: - a sum of the Euclidean distances of the points 401 to 408 to the trajectory 104 (ie the distance the shortest Euclidean between these points 401 to 408 and any point of the curve); a sum of the "real" distances of the points 401 to 408 to the trajectory 104 (ie the shortest distance between these points 401 to 408 and any point of the trajectory, taking into account the real path that a consumer must have to get to the location of the product, ie avoiding shelving or other obstacles); a sum of the "real" distances of the points 401 to 408 at the stopping points of the trajectory 104 (ie the shortest distance between these points 401 to 408 and a point of the trajectory for which the user makes a higher stop at a certain time or at a speed below a certain speed, taking into account the actual path that a consumer must have to get to the location of the product, ie by avoiding shelving or other obstacles). Nevertheless, the location of products may be more inaccurate.

Thus, in the context of FIG. 4b, the position of the products is known only by zone. Thus, it is possible to determine that the product 401 is in the area 411 but without further precision (respectively the products 402 and 403 in the area 412, the products 405 and 406 in the area 413, the products 404 407 and 408 in area 414, etc.).

For the determination of the distance, it is of course possible to calculate the smallest distances between any point of each zone (411 to 414) and any point of the trajectory.

In order to simplify the proposed algorithm, it is also possible to follow the following method: if said path 104 intersects an area (411, 412, 413, 414) of the store in which said element is located, said distance D is negatively incremented (eg D = D-1); if not, said distance is incremented positively (eg D = D + 1).

Of course, it is possible to do the opposite (ie increment negatively at an intersection, but in this case we will speak rather of "proximity factor" than "distance") or to provide that one of the branches of the alternative has no impact on the calculated distance (ie no increment).

Fig. 5 illustrates a flowchart of a possible embodiment in one embodiment of the invention.

In this embodiment, it is possible to detect the trajectory of a given consumer (step 501). Of course, this method can be run in parallel for a large number of consumers. As soon as a new position of the trajectory is known and / or as soon as a predetermined time has elapsed since the last verification, it is possible to check (step 502) that the consumer is at the level of the boxes (ie in the zone 102).

If this is not the case (KO output of step 502), step 501 continues to be executed.

If this is the case (exit OK from step 502), it is verified (step 503) that the criterion of time or speed is filled (see above).

If this criterion is not fulfilled (KO output of step 503), step 501 continues to be executed.

If this criterion is fulfilled (OK output of step 503), it is possible to perform a first temporal filter (step 504) concerning the shopping lists of the store. For example, this filter may include eliminating possible candidates from shopping lists generated on another day or generated more than a predetermined number of hours.

It is also possible to exclude from possible candidates shopping lists with too many elements in relation to the time spent by the consumer in zone 102 of the boxes (ie having remained 1min, the consumer can not have realized a caddy of 150 elements).

Once these first sorts have been completed, it is possible to assign to each list of candidate races (ie not eliminated) a first probability value Pi (step 505) as a function of the relative position of the body that generated this shopping list. and the position of the consumer in zone 102. It is possible to assign to each candidate race list (ie not eliminated) a second probability value P2 (step 506) as explained above.

Thus, each race list has an intrinsic probability that it is possible to note P = Pi.P2.

In parallel or after, it is possible, for each candidate shopping list (loop 507), to determine the position of each item of the shopping list in the store (step 508, possibly with the help of a database 509 of positions) and calculate the distance of this shopping list to the consumer's trajectory (see above).

Once the distances calculated for each of the lists of candidate purchases, it is possible to determine (step 511) the most likely shopping list by combining the probability value P previously calculated and the distance value. For example, it is possible to minimize P. (D-Dmin + e) (with D the distance from the shopping list considered to the consumer's trajectory, Dmin the smallest distance from the shopping lists to the consumer's trajectory , and e a predetermined value) to determine the most likely shopping list. It is also possible to maximize P. (Dmax-D) (with Dmax the greatest distance from shopping lists to the consumer's trajectory). Any other function of P and D is also possible: these functions combining the previously calculated probability value P and the distance value are noted more generally f (P, D).

Of course, for the determination of the most probable shopping list, it is possible to compare (step 512) the length of the trajectory with the number of elements in the shopping list. Indeed, if two shopping lists are substantially equiprobable (eg +/- 10%) then, it is possible to select the shopping list whose number of elements best corresponds to the length of the trajectory (ie a long trajectory is often associated with a shopping list with a large number of elements). Purely empirical charts can be made on test populations to determine the link between trajectory length and number of items in the shopping list.

These charts can also be realized by a self-learning in the case where the set of the candidate shopping lists is reduced to a single list after the filter of the step 504: the trajectory being associated in a certain way with a single list of purchases, this list can be used to inform an abacus.

Similarly, after having studied a sufficient number of customer trajectories, it is possible to determine a range of normal conversion level of a radius, and therefore to decide between receipts nearly equiprobable using this usual level (aggregated) conversion to estimate the likelihood that a customer converted their visit to each department. For example, if the "Fruits and Vegetables" section usually has a conversion of 80%, the shopping list that leads to the conclusion that the customer has not converted his visit to this department becomes less likely than the alternative, which results in a conversion of this visit to "Fruits and Vegetables".

Once all these actions have been completed, it is possible to associate the list identified as being most likely with the trajectory of the consumer. Therefore, this association can be provided to a third party algorithm to accurately determine the exposure rate Tg ^ pg, I © interest rate Tinted and especially the conversion rate Γ ^ οην

Figure 6 shows an example of a consumer purchasing determination device in an embodiment of the invention.

In this embodiment, the device comprises a computer 600, comprising a memory 605 for storing instructions for implementing the method, the received measurement data, and temporary data for performing the various steps of the method as described above. . The computer further comprises a circuit 604. This circuit can be, for example: a processor capable of interpreting instructions in the form of a computer program, or an electronic card whose steps of the method of the invention are described in silicon, or else - a programmable electronic chip such as an FPGA chip (for "Field-Programmable Gaste Array").

This computer has an input interface 603 for receiving trajectory data from a locating device 607 (eg, radio or CCTV location), and an output interface 606 for providing trajectories associated with data. shopping lists. Finally, the computer may include, for easy interaction with a user, a screen 601 and a keyboard 602. Of course, the keyboard is optional, particularly in the context of a computer in the form of a touch pad, for example.

Furthermore, the block diagram presented in FIG. 5 is a typical example of a program, some of whose instructions can be implemented with the device described. As such, FIG. 5 may correspond to the flowchart of the general algorithm of a computer program within the meaning of the invention.

Of course, the present invention is not limited to the embodiments described above as examples; it extends to other variants. Other achievements are possible.

Claims (12)

A method of determining purchases made by a user of a store (100), wherein the method includes: - determining (501) a path (104) in a store associated with the user of said store; when the position of the user of said magazine is in an area (102) of the magazine (100) corresponding to the crates (102) and a criterion (503) of time or speed is filled, determination (504, 505, 506) of a set of shopping lists (305, 306, 307, 308) corresponding to boxes (102) of said magazine (100), each shopping list (305, 306, 307, 308) comprising a set items purchased by a user of said store (100); - for each shopping list (305, 306, 307, 308) in all the specified shopping lists: - determination (508) of a position (401, 402, 403, 404, 405, 406, 407 , 408, 411, 412, 413, 414) of each item of said shopping list; calculating (510) a distance between the position (401, 402, 403, 404, 405, 406, 407, 408, 411, 412, 413, 414) of each element and said determined trajectory (104); - determination (511) of a probable shopping list among all the shopping lists (305, 306, 307, 308), said determination of the probable shopping list is a function of the distance calculated for said list purchases; - association (513) of said probable shopping list with said determined trajectory (104). The method of claim 1, wherein determining (504, 505, 506) the set of shopping lists (305, 306, 307, 308) comprises: - for each shopping list from the set shopping lists (305, 306, 307, 308), assigning (505) a first probability value (Pi) to said shopping list, said first probability value (Pi) being a function of a distance of a box having generated said shopping list at a position (106) of the user, when the position (106) of the user of said store is in an area of the store (100) corresponding to the boxes (101); wherein the determination (504, 505, 506) of the probable shopping list is a function of the first probability value (Pi) assigned for said shopping list. 3. Method according to one of the preceding claims, wherein the determination (504, 505, 506) of the set of shopping lists comprises: for each shopping list from the set of shopping lists ( 305, 306, 307, 308), assigning (506) a second probability value (P2) to said shopping list, said second probability value (P2) being a function of a difference between a moment (303, 304) associated with a generation of said shopping list by a cash register and a moment of presence (302) for which the position of the user of said store is in an area of the store corresponding to the boxes; wherein the determination (504, 505, 506) of the probable shopping list is a function of the second probability value (P2) assigned for said shopping list. The method of claim 2, wherein the first probability value (Pi) is zero if the distance of a cash register having generated said shopping list at a user's location is greater than a predetermined distance. 5. Method according to claim 3, wherein the moment associated with the generation of said shopping list is a time (303) the smallest among all the times of acquisition of the set of elements purchased for the generation of said list. shopping. and wherein the second probability value (P2) is zero if the time associated with the generation of said shopping list is earlier than said presence moment (302). The method according to claim 3 or 5, wherein the moment associated with the generation of said shopping list is a time (304) the largest among all the input times of the set of items purchased for the generation of said shopping list, and wherein the second probability value (P2) is zero if the moment associated with the generation of said shopping list is later than said moment of presence. 7. Method according to one of the preceding claims, wherein said determination (511) of the probable shopping list is based on a comparison (512) between the number of items purchased for each shopping list in the list of purchases. set of specified shopping lists and a length of said path (104). 8. Method according to one of the preceding claims, wherein the calculation (510) of the distance between the position of each element and said determined trajectory comprises, for each element: - if said trajectory (104) intersects a region (411, 412, 413, 414) of the magazine in which said element is located, said distance is incremented positively, respectively negatively; - Otherwise, said distance is incremented negatively, respectively positively. 9. Method according to one of the preceding claims, wherein the calculation (510) of the distance between the position of each element and said determined trajectory comprises, for each element: - said distance is incremented according to the distance of the trajectory (104) at the position (401, 402, 403, 404, 405, 406, 407, 408) of said member in the magazine. 10. Method according to one of the preceding claims, wherein the criterion (503) of time or speed is a criterion or a combination of criteria among: - a consecutive time during which the position (106) of the user of said store is in the area (102) of the magazine (100) corresponding to the crates (101) is greater than a predetermined time; a speed of the position (106) of the user of said magazine is lower than a predetermined speed. 11. A system for determining purchases made by a user of a store, wherein the system comprises: - a location device (607) for determining a trajectory in a store associated with the user of said store; a circuit (604) for determining, when the position of the user of said magazine is in a zone of the magazine corresponding to the crates and a criterion of time or speed is filled, of a set of shopping lists corresponding to crates of said store, each shopping list comprising a set of items purchased by a user of said store; - a circuit (604) for, for each shopping list in the set of shopping lists determined: - the determination of a position of each item of said shopping list; calculating a distance between the position of each element and said determined trajectory; a circuit (604) for determining a probable shopping list among all the shopping lists, said determination of the probable shopping list is a function of the distance calculated for said shopping list; a circuit (604) for associating said probable shopping list with said determined trajectory. 12. Computer program product comprising instructions for implementing the method according to one of claims 1 to 10, when the program is executed by a processor.