# Patent

## Title
System and method for generating conversion-related estimates utilizing adaptive sample size

## Abstract

A method and system for processing test data relevant to specific behavior of visitors of a network accessible site, such as a website, includes a number of components. A first component is configured to determine an initial estimate of visitor behavior on the basis of pre-testing information. Such information may be entered by a manager of the site. A second component is configured to generate updates of the estimate in response to monitored behavior. Bayesian estimation may be employed in this component. The third and fourth components cooperate to dynamically adjust a measure of the required test sample size of the visitors so as to maintain a target statistical confidence level. The third component utilizes systematic sampling, while the fourth component uses negative binomial sampling.

## Background
TECHNICAL FIELD
The invention relates generally to processing test data that is relevant to a specific behavior of visitors at a network accessible site, such as a website available via the Internet, and more particularly to determining conversion rates of visitors to such sites.
BACKGROUND ART
With the widespread deployment of the global communications network referred to as the Internet, the capability of providing electronic service (e-service) has become important to even well-established traditional business entities. An “e-service” is an on-line service that markets goods or services, solves problems, or completes tasks. E-services are accessible on the Internet by entering a particular Uniform Resource Locator (URL) into a navigation program.
Operators of e-services are often interested in inducing visitors of a website to act in a certain manner. For example, an operator (i.e., e-marketer) may be interested in the sale of goods or services to visitors or may merely request that visitors register by providing selected information. When a visitor acts in the desired manner, the event may be considered (and will be defined herein) as a “conversion.” The ratio of visitors who are converted to the overall number of visitors is referred to as a “conversion rate.” Presently, conversion rates at Internet websites are relatively low, typically in the range of two percent to four percent.
For various reasons, managers of websites are interested in accurate measures of conversion rates. For example, a change in a conversion rate may be used as a measure of the effectiveness of a promotion. Promotional offers are often presented to visitors in order to induce the visitors to interact with the website in a desired manner, e.g., register or purchase a product. Promotional offers include providing a discount on the price of the product being sold, providing free shipping and handling of the product, and/or providing a cost-free item. The typical goal of a promotion campaign plan is to increase the conversion rate in a cost-efficient manner.
There are a number of considerations in determining estimations of conversion rate or other estimations of anticipated behavior by visitors to a network accessible site. On some occasions, there is available pre-testing information regarding the conversion rate of a website. There may be a relatively low or relatively high level of confidence in the accuracy of such information. Thus, one consideration is whether to incorporate the pre-testing information into the process of determining conversion rate. A second consideration is the selection of an approach for updating estimations. Yet another consideration involves selecting the sample size in testing visitors. Given the fact that each additional visitor that is tested causes a marketer to incur an additional cost and a potential loss in market opportunity, an important issue is determining how large the sample size needs to be in order to achieve a target level of confidence. A fourth consideration regards the methodology for sampling visitors for the testing.
What is needed is a method and system which address these considerations in the estimations of anticipated visitor behavior.
SUMMARY OF THE INVENTION
An adaptive testing approach utilizes at least some of four components that are cooperative in providing behavioral estimations that satisfy a required level of confidence of accuracy. As a first component of a system or method, the process is configured to determine an initial estimation on a basis of pre-testing information. For example, an e-marketer's prior knowledge may be incorporated into an initial conversion rate estimation by characterizing the knowledge with a suitable probability distribution. A second component is configured to generate updates of the estimation in response to monitored behavior of visitors to a network accessible site, such as a website. In one approach, the second component utilizes Bayesian estimation to provide updated estimations of subsequent visitor behavior. In third and fourth components, a minimum test sample size is determined while maintaining a target statistical confidence level. This determination is also adaptive, so that the measure of required test sample size is dynamically adjusted upwardly or downwardly in response to testing conditions. The third component uses systematic sampling. The fourth component is configured to utilize negative binomial sampling that is based on achieving the required confidence level.
Within the first component, the prior knowledge of a manager of a site is entered and utilized. Ideally, the prior knowledge is an estimation of the visitor behavior (e.g., conversion rate), with the estimation being within a target confidence interval. However, in some situations, the manager is not able to provide an estimation of the conversion rate. Instead, another type of information may be available. For example, the manager may specify a conversion rate mean and a standard deviation, so that parameters of a prior distribution of the conversion rate can be determined using Bayes inference. In another possibility, the manager may specify a range of the conversion rate by a confidence interval. Again, Bayes inference may be used to determine the parameters of the prior distribution.
After observations of visitor behavior are obtained, a Bayes estimator may be used to provide automatic updates of the estimation of the conversion rate or other behavioral parameter of interest. In one embodiment, the point estimation is an average of the pre-test estimation and a maximum likelihood estimate that is a result of the observed behavior. Bayes estimation is especially useful if there is prior knowledge and only a small sample of observations, since a small sampling is susceptible to inaccuracies.
Regarding the determination of sampling size, the target number of successes (e.g., conversions) can be determined using systematic sampling at the third component. For example, from a probability criterion, a sample size may be identified as a ceiling. Then, from the expected number (N) of visitors, a requirement of the sampling pattern may be determined by dividing the expected number by the ceiling of the sampling size. A shortcoming of this systematic sampling approach is that there is a concern that the expected number of visitors will not be reached, so that the calculated test sample size will not be reached.
In the fourth component, the shortcoming of the systematic sampling is addressed. Specifically, negative binomial sampling is utilized. The measure of the minimum test sample size therefore becomes dynamically adjustable by requiring the estimate of conversion rate to satisfy a particular statistical confidence level. The fourth module operates best in situations in which there may be a low number of visitors to a site.
By integrating the four components, adaptive testing can intellectually and reliably address the main concerns of conversion estimation and testing. While the linkage of the first two components establishes the foundation for conversion rate estimation and updating, the linkage between the second and third components is a key to the dynamic sample size determination and allocation that provides managers with operational agility while maintaining targeted confidence. The linkage from the first and second components to the third and fourth components completes the automatic process in such a way that it provides seamless adaptive testing for predicting visitor behavior.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic representation of an Internet-enabled system for implementing adaptive testing of behavior of a network site in accordance with the invention.
FIG. 2 is a block diagram of modules and components for designing, testing and executing a promotion campaign plan within the system of FIG. 1, with a testing module in accordance with the invention.
FIG. 3 is a process flow of steps for executing the invention.



DETAILED DESCRIPTION
With reference to FIG. 1, a number of clients 10, 12 and 14 are shown as being linked to a web server farm 16 via the global communications network referred to as the Internet 18. The web server farm may include a variety of conventional servers or may be a single server that interfaces with the clients via the Internet. The clients may be personal computers at the homes or businesses of potential customers of the operators of the web server farm, if the operation is an e-service for selling goods and/or services (“products”). Alternatively, the clients 10, 12 and 14 may be other types of electronic devices for communicating with a business enterprise via a network such as the Internet.
The tool to be described below is intended to optimize the increased value derived from conversions of customers when promotions are offered to the customers. However, the adaptive testing invention may be used in other applications in which conversions are of significance to operators. A conversion is the act in which a visitor to a network site, such as a website, acts in a certain manner, such as purchasing a product or registering information.
A campaign plan for determining which promotion should be presented to which customers is mathematically determined by an optimization engine 20. Information may be acquired using known techniques. A reporting and data mining component 22 receives inputs from a conventional web log 24, observation log 26, and transactional database 28. The logs 24 and 26 acquire information either directly or indirectly from the customers at the clients 10, 12 and 14. Indirect information includes the Internet Protocol (IP) address of the client device. As information is acquired, the IP address may be used to identify a particular customer or a particular geographic area in which the client device resides. The indirect information may be obtained from conventional “cookies.” On the other hand, direct information is intentionally entered by the client. For example, the client may complete a questionnaire form or may enter identification information in order to receive return information.
The transactional database 28 is a storage component for the customer-related data. When a customer enters a particular transaction with a business enterprise that is the operator of the web server farm 16, billing information is acquired from the customer. The billing information is stored at the transactional database. As more transactions occur, a customer history may be maintained for determining purchasing tendencies regarding the individual customer. The various customer histories can then be used to deduce common purchasing tendencies, as well as common tendencies with regard to reacting to promotions, so that customer modeling may occur at the segmentation component 30 of the system. Customer segmentation is preferably based upon a number of factors, such as income, geographical location, profession, and product connection. Thus, if it is known that a particular customer previously purchased a specific product, the purchase may be used in the algorithmic determination of customer segments.
A promotions component 32 includes all of the data regarding available promotions. The types of promotions are not critical to the invention. Promotions may be based upon discounts, may be based upon offering add-on items in the purchase of a larger scale item, may be based upon offering future preferential treatment (e.g., a “gold member”) or may be based upon other factors (e.g., free shipping and handling).
A test marketing module 34 is the focus of the invention. The test marketing module may be used to determine a conversion rate which provides an estimate for predicting future customer behavior. For example, the estimate of conversion rate may be used to forecast product procurement needs. That is, the purchase of inventory may be at least partially based upon the estimate of the conversion rate.
Interaction with the design of a promotion campaign plan by a business manager takes place via a workstation 36. The business manager may enter information regarding parameters such as budget constraints, business objectives, costs and revenues. The budget constraints may relate to different stages of the process, so that there are specific budget constraints for the test marketing stage.
FIG. 2 illustrates the four stages of a promotion campaign plan. In a first stage 38, an initial campaign is defined. The defined campaign is passed to a stage 40 for the testing process that is the focus of the invention. It is at this stage that the invention is implemented.
The test results of an initial campaign model are passed from the test stage 40 to an optimization stage 42. It is at this stage that the differential allocation of promotions is determined for the different customer segments. The optimized campaign plan is then passed to an execution stage 44. This execution stage interacts with storefront software 46, such as that offered by Broadvision of Los Altos, Calif. The storefront 46 may be run on the web servers of the farm 16 of FIG. 1, so that clients 10, 12 and 14 may link with the system using conventional techniques, such as an Internet navigator. While the invention is described with respect to the interaction among the four stages, the test stage 40 that is the focus of the invention may be used in other architectures.
A number of actions take place within the campaign definition stage 38. Necessary information is retrieved from a data warehouse 48. One source of information for the data warehouse is the connection to the storefront 46. This connection allows the transactions with customers to be monitored. As relevant information is recognized, the information is stored. This information can then be used to define the customer segments, as indicated at component 50. Within the campaign definition stage 38, the promotions are defined 52 and the tests for ascertaining the effectiveness of the promotions are also defined 54. Thus, the initial model of the campaign can be created 56. This initial campaign plan is stored at a campaign data-base 58.
Within the testing stage 40, the tests that are defined within the component 54 of the campaign definition stage 38 are executed. As will be described more fully below, the testing stage is a system module that includes four cooperative components. As a first component 60 of the module, a manager of the system may incorporate prior knowledge into an initial conversion rate estimation. In one embodiment, the prior knowledge is incorporated by characterizing the knowledge with a suitable probability distribution. In a second component 61, an updating algorithm is used to automatically update the conversion rate estimation as a response to monitoring behavior of customers. Preferably, Bayesian estimation updating techniques are employed. In a third component 62, systematic sampling is employed to determine the minimum test sample size of customers for a given accuracy confidence level. The concern is that the actual number of customers will fall below the expected number, so that systematic sampling will be flawed in some applications. Therefore, a fourth component 63 incorporates negative binomial sampling for those occasions in which the customer count is low. The applicable algorithms will be set forth in detail in sections that follow.
The optimization stage 42 includes defining optimization objectives 64 (i.e., business objectives) and optimization constraints 66, so that an optimized campaign can be identified at component 68 of the stage. The resulting plan is stored at the campaign database 58 and is transferred to the execution stage 44.
As previously noted, the execution of the optimized plan utilizes the storefront 46. Preferably, in addition to the execution component 70, the stage 44 includes a capability 72 of monitoring and reoptimizing the plan. Thus, interactions with customers are monitored to recognize changes in dynamics which affect the campaign plan. The reoptimization is a reconfiguration that is communicated to the campaign database 58.
Details Regarding the Testing Stage
A number of assumptions will be made in the description of the testing stage 40. Firstly, it will be assumed that the goal of this phase is to provide an accurate prediction of future customer behavior. Typically, this prediction is based upon an accurate calculation of the conversion rate. In achieving this goal, generating profit within this stage is not an issue. Nevertheless, it is assumed that there is a testing budget. There may be an overall testing budget for the stage and individual budgets for the different customer segments defined in the component 50 of the campaign definition stage 38. It will also be assumed that the overall testing duration is reasonably set forth.
A “combination” will be defined herein as a segment-promotion pair. That is, each combination includes one customer segment that was defined in component 50 and one promotion that was defined in component 52. Different combinations can have different deterministic/stochastic conversion rates. In the description that is to follow, in some situations it will be assumed that the different conversion rates are not correlated, so that the combinations will be treated separately. In other situations it will be assumed that the conversion rates for the different combinations are correlated, so that they are dealt with jointly by establishing a correlated structure. Empirical Bayesian approaches may be developed in situations where it is assumed that the conversion rates are correlated.
Another assumption is that behaviors of visitors in the same combination are independent of each other and the individual conversion status (Yi) for each visitor has a binomial distribution B(1,θ), where θ is deterministic and is determined by the underlying mean customer characteristics and promotion attribute levels. In this binomial distribution, 1 is the number of trials for the individual visitors and θ is the conversion rate. In a first alternative assumption, customer segmentation is assumed to be perfect as far as conversion rate is concerned. Frequentist's statistical inference approaches will be developed under this model. As a second alternative assumption, it will be assumed that the customer segmentation is not perfect. Consequently, in addition to the variability of the binomial distribution, there is an added variable of the imperfect customer segmentation. Mathematically expressed Yi|θ ̃B(1, θ), and θ ̃G(θ, η), where G captures the additional variability, Bayesian approaches are developed under this model.
A. Incorporation of Prior Knowledge
As previously described, the first component 60 of the testing stage 40 is a component of a testing module that allows a manager to enter previously acquired information relevant to determining the conversion rate of a combination. Referring to the process flow of steps of FIG. 3, the step 76 is one in which the prior knowledge is incorporated into the determination of visitor behavior. The invention will be described in the implementation in which conversion rate is the target measure of customer behavior.
It is possible that the prior knowledge that is incorporated at step 76 is a previously acquired sampling of visitors with regard to a particular segment-promotion combination. If the sampling is designated as Y and includes n visitors, then Y={Y1, Y2, . . . , Yn} If the assumptions are that the customer segmentation is perfect and the correlation rates among the different combinations are not correlated, classic point estimation may be used to determine a point estimate ({circumflex over (θ)}) for the conversion rate of the combination. The point estimate is equal to {overscore (Y)}, so that:




  
    
      
        
          θ
          ^
        
        =
        
          
            Y
            _
          
          =
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                Y
                i
              
              /
              n
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          1
        
        )
      
    
  




This point estimate for the conversion rate is the maximum likelihood estimate (MLE) under the two assumptions. That is:

{overscore (Y)}=argmaxθL(θ|Y)  (Eqn. 2)

where the joint likelihood function is:





  
    
      
        
          L
          ⁡
          
            (
            
              θ
              |
              Y
            
            )
          
        
        =
        
          
            ∏
            
              i
              =
              1
            
            n
          
          ⁢
          
            
              
                θ
                
                  Y
                  i
                
              
              ⁡
              
                (
                
                  1
                  -
                  θ
                
                )
              
            
            
              1
              -
              
                Y
                i
              
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          3
        
        )
      
    
  




Confidence intervals of the conversion rate θ may also be identified. A confidence interval of θ has a lower limit {circumflex over (θ)}L and an upper limit {circumflex over (θ)}U. Thus, for a given confidence level (1−α), the probability function is such that:

P({circumflex over (θ)}L≦θ≦{circumflex over (θ)}U)=1−α  (Eqn. 4)

where the two limits are functions of the observations Y. For example, a confidence interval of 95 percent means that if the experiment is repeated under the same conditions 100 times, within 95 of those times the resulting interval is expected to contain the true conversion rate.

As is known in the art of statistical economics, the confidence interval of confidence level 1−αis:

({circumflex over (θ)}−z1-α/2s.e.({circumflex over (θ)}), {circumflex over (θ)}+z1-α/2s.e.({circumflex over (θ)}))  (Eqn. 5)

where the z value of z1-α/2 is obtainable from a standard table and where s.e.({circumflex over (θ)}) is the standard error of the point estimate ({circumflex over (θ)}), with:

s.e.({circumflex over (θ)})=√{square root over ({circumflex over (θ)}(1−{circumflex over (θ)})/n)}  (Eqn. 6)

Rather than the normal approximation of the confidence interval, a more exact determination can be made. For the sample Y having a sample size of n and having y conversions, the upper and lower limits of the confidence interval can be determined by the following equations:




  
    
      
        
          
            θ
            ^
          
          L
        
        =
        
          y
          
            y
            +
            
              
                (
                
                  n
                  -
                  y
                  +
                  1
                
                )
              
              ⁢
              
                
                  F
                  
                    
                      2
                      ⁢
                      
                        (
                        
                          n
                          -
                          y
                          +
                          1
                        
                        )
                      
                    
                    ,
                    
                      2
                      ⁢
                      y
                    
                  
                
                ⁡
                
                  (
                  
                    1
                    -
                    
                      α
                      /
                      2
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          7
        
        )
      
    
  
  
    
      
        
          
            θ
            ^
          
          U
        
        =
        
          
            y
            +
            1
          
          
            y
            +
            1
            +
            
              
                (
                
                  n
                  -
                  y
                
                )
              
              ⁢
              
                
                  F
                  
                    
                      2
                      ⁢
                      
                        (
                        
                          y
                          +
                          1
                        
                        )
                      
                    
                    ,
                    
                      2
                      ⁢
                      
                        (
                        
                          n
                          -
                          y
                        
                        )
                      
                    
                  
                
                ⁡
                
                  (
                  
                    1
                    -
                    
                      α
                      /
                      2
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        
          E
          ⁢
          
            
          
          ⁢
          q
          ⁢
          
            
          
          ⁢
          
            n
            .
            
              
            
            ⁢
            8
          
        
        )
      
    
  




Thus far, the implementation of step 76 of FIG. 3 has been described with the assumption that customer segmentation is perfect. However, if this assumption is not used, Bayesian approaches may be more advantageous. In one possible scenario, an e-marketing manager may not be able to provide a reasonable estimator for the underlying conversion rate, but may be able to specify some other type information. For example, the manager may be able to provide a mean θ0 for the conversion rate and may be able identify a standard deviation (σ0). From these specifications, parameters of a prior distribution on θ may be calculated using Bayes inference. One choice for the prior is the Beta (α, β) distribution. The algorithms for computing α and β are as follows:




  
    
      
        
          α
          ^
        
        =
        
          
            θ
            0
          
          ⁡
          
            (
            
              
                
                  
                    θ
                    0
                  
                  ⁡
                  
                    (
                    
                      1
                      -
                      
                        θ
                        0
                      
                    
                    )
                  
                
                
                  σ
                  0
                  2
                
              
              -
              1
            
            )
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          9
        
        )
      
    
  
  
    
      
        
          β
          ^
        
        =
        
          
            (
            
              1
              -
              
                θ
                0
              
            
            )
          
          ⁢
          
            (
            
              
                
                  
                    θ
                    0
                  
                  ⁡
                  
                    (
                    
                      1
                      -
                      
                        θ
                        0
                      
                    
                    )
                  
                
                
                  σ
                  0
                  2
                
              
              -
              1
            
            )
          
        
      
    
    
      
        (
        
          E
          ⁢
          
            
          
          ⁢
          q
          ⁢
          
            
          
          ⁢
          
            n
            .
            
              
            
            ⁢
            10
          
        
        )
      
    
  




On the other hand, the e-marketing manager may be able to specify the range of the conversion rate by a confidence interval (x1, x2). That is, for a given confidence level 1−α, the probability specification is:

P(x1≦θ≦x2)=1−α  (Eqn. 11)

From this, the required parameters for the Beta distribution may be calculated as follows:





  
    
      
        
          
            θ
            ^
          
          0
        
        =
        
          
            
              x
              1
            
            +
            
              x
              2
            
          
          2
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          12
        
        )
      
    
  
  
    
      
        
          
            σ
            ^
          
          0
        
        =
        
          
            
              x
              2
            
            -
            
              x
              1
            
          
          
            2
            ⁢
            
              z
              
                1
                -
                
                  α
                  /
                  2
                
              
            
          
        
      
    
    
      
        (
        
          E
          ⁢
          
            
          
          ⁢
          q
          ⁢
          
            
          
          ⁢
          
            n
            .
            
              
            
            ⁢
            13
          
        
        )
      
    
  
  
    
      
        
          α
          ^
        
        =
        
          
            
              θ
              ^
            
            0
          
          ⁡
          
            (
            
              
                
                  
                    
                      θ
                      ^
                    
                    0
                  
                  ⁡
                  
                    (
                    
                      1
                      -
                      
                        
                          θ
                          ^
                        
                        0
                      
                    
                    )
                  
                
                
                  
                    σ
                    ^
                  
                  0
                  2
                
              
              -
              1
            
            )
          
        
      
    
    
      
        (
        
          E
          ⁢
          
            
          
          ⁢
          q
          ⁢
          
            
          
          ⁢
          
            n
            .
            
              
            
            ⁢
            14
          
        
        )
      
    
  
  
    
      
        
          β
          ^
        
        =
        
          
            (
            
              1
              -
              
                
                  θ
                  ^
                
                0
              
            
            )
          
          ⁢
          
            (
            
              
                
                  
                    
                      θ
                      ^
                    
                    0
                  
                  ⁡
                  
                    (
                    
                      1
                      -
                      
                        
                          θ
                          ^
                        
                        0
                      
                    
                    )
                  
                
                
                  
                    σ
                    ^
                  
                  0
                  2
                
              
              -
              1
            
            )
          
        
      
    
    
      
        (
        
          E
          ⁢
          
            
          
          ⁢
          q
          ⁢
          
            
          
          ⁢
          
            n
            .
            
              
            
            ⁢
            15
          
        
        )
      
    
  




After the parameters are calculated, Bayesian estimation may be used to compute a point estimation. The techniques will be described in the following section, since the Bayesian estimation may also be used in the updates of the conversion rate calculation as testing is implemented.
B. Bayesian Update Estimation
Referring to FIGS. 2 and 3, in step 78, observations are obtained during the testing process, so that an updated estimation of the conversion rate can be obtained. The expected value (E) for θ, given Y, is as follows:




  
    
      
        
          E
          ⁡
          
            (
            
              θ
              |
              Y
            
            )
          
        
        =
        
          
            
              (
              
                
                  
                    α
                    ^
                  
                  +
                  
                    β
                    ^
                  
                
                
                  
                    α
                    ^
                  
                  +
                  
                    β
                    ^
                  
                  +
                  n
                
              
              )
            
            ⁢
            
              
                α
                ^
              
              
                
                  α
                  ^
                
                +
                
                  β
                  ^
                
              
            
          
          +
          
            
              (
              
                n
                
                  
                    α
                    ^
                  
                  +
                  
                    β
                    ^
                  
                  +
                  n
                
              
              )
            
            ⁢
            
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  n
                
                ⁢
                
                  Y
                  i
                
              
              n
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          16
        
        )
      
    
  




The parameters {circumflex over (α)} and {circumflex over (β)} may be determined using Eqns. 14, 15 and 16. As can be appreciated, the expected value is the weighted average of the estimation of conversion rate based upon the prior knowledge of step 76 (i.e., {circumflex over (α)}/({circumflex over (α)}+{circumflex over (β)}) and the MLE estimator that is based upon the testing without any prior knowledge (i.e., Eqn. 1). This Bayes estimation is especially useful if we have prior knowledge and only a small number of observations (n is small). As one example, given the current knowledge of on-line conversions, if a sampling of (1, 0, 1, 1) is observed, it typically is safe to estimate that the true conversion rate is much lower than the MLE estimate of 0.75. Such a high MLE estimate may be regarded as an occurrence largely due to chance.

If no prior knowledge is available, the parameters may be estimated using empirical Bayes analysis, which will not be described in detail in this document.
The update of the estimate of conversion is represented by step 80 in FIG. 3. While not critical, the update is preferably executed on a recurring basis. Thus, a conversion rate estimation is automatically updated as the behaviors of more customers are observed. As previously noted, one issue is determining the minimum required sample size in testing of the customers. In accordance with an aspect of the invention which will be described immediately below, the process provides regularly updated minimum sample size determinations. According to this aspect, the system is able to intelligently and promptly either reduce the unneeded size allocated previously in order to save testing cost and time or increase the required sample size in order to ensure that the required confidence level is reached in the final update.
C. Systematic Sampling
Step 82 in FIG. 3 represents the components 62 and 63 in the testing stage 40 of FIG. 2. The systematic sampling works well in applications in which there is a high and predictable number of visitors in each customer segment-promotion pair that defines a combination. On the other hand, negative binomial sampling is better suited for applications in which the number of visitors is either predictably low or unpredictable. Preferably, the system includes both sampling approaches. Therefore, the negative binomial sampling may be utilized until a threshold number of samples is acquired, after which the systematic sampling may be activated.
Within the systematic sampling, a probability criterion is proposed and it is assumed that behaviors of visitors within each combination are independent of each other and that the conversion rates among combinations are not correlated. Regarding the probability criterion, for a given confidence level (1−α) and for an upper bound (d) of the distance between the estimate {circumflex over (θ)}n and the true value of θ (i.e., |{circumflex over (θ)}n−θ|) the probability criterion is:

P(|{circumflex over (θ)}n−θ|≦ε)≧1−α  (Eqn. 17)

where ε is the sampling precision. Therefore, the derived sample size is:





  
    
      
        
          n
          *
        
        =
        
          c
          ⁢
          
            
          
          ⁢
          e
          ⁢
          
            
          
          ⁢
          i
          ⁢
          
            
          
          ⁢
          l
          ⁢
          
            
          
          ⁢
          i
          ⁢
          
            
          
          ⁢
          n
          ⁢
          
            
          
          ⁢
          
            g
            ⁡
            
              [
              
                
                  (
                  
                    
                      
                        z
                        
                          1
                          -
                          
                            α
                            /
                            2
                          
                        
                      
                      ⁢
                      σ
                    
                    ɛ
                  
                  )
                
                2
              
              ]
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          18
        
        )
      
    
  




where σ=σ(Y1)=√{square root over (θ(1−θ))} is the standard deviation of a single conversion variable.

If the total number of expected visitors in a particular combination is N, the systematic sampling scheme is to sample n* visitors from N total visitors. Taking d=floor [N/n*], the scheme is to generate a random start s from integers {1, 2, . . . , d}, and make offers to visitors s, s+d, s+2d, . . . , s+(n*−1)d.
As previously noted, the shortcoming of the systematic sampling scheme is that the required sample size may only be reached if and when the N total visitors of a particular combination have visited the website.
D. Negative Binomial Sampling
It is supposed that the sequentially observed conversions Y1, Y2, . . . , Yn are identically and independently distributed (i.e., i.i.d. ̃B(1, θ)), where θ is the conversion rate. When θ is small, as is experienced in current on-line conversion applications, the negative binomial sampling (also referred to as inverse binomial sampling) provides a faster solution than the random sampling and systematic sampling techniques. If m is the number of conversions that are determined to be needed and T is the total number of trails needed, then T has a negative binomial distribution.




  
    
      
        
          P
          ⁡
          
            (
            
              T
              =
              t
            
            )
          
        
        =
        
          
            (
            
              
                
                  
                    t
                    -
                    1
                  
                
              
              
                
                  
                    m
                    -
                    1
                  
                
              
            
            )
          
          ⁢
          
            θ
            m
          
          ⁢
          
            q
            
              t
              -
              m
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          19
        
        )
      
    
  




where q=1−θ. This negative binomial distribution applies for t=m, m+1 . . . This can be denoted by Y ̃NB(m, θ). As with any other sequential sampling scheme, the stopping point (or sample size) of NB sampling depends upon the actual data. Specifically,





  
    
      
        T
        =
        
          inf
          ⁢
          
            {
            
              
                t
                ≽
                
                  m
                  :
                  
                    
                      ∑
                      
                        i
                        =
                        1
                      
                      t
                    
                    ⁢
                    
                      y
                      i
                    
                  
                
              
              =
              m
            
            }
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          20
        
        )
      
    
  




After m is determined, the implementation of T is straightforward. The expected value of T is m/θ<∞, so that negative binomial sampling necessarily terminates. From this property it can be seen that T/m is an unbiased estimator for 1/θ. In fact, T/m is the uniform minimum variance unbiased (UMVU) estimator of 1/θ. Based upon this, it can also been seen that {circumflex over (θ)} m/T is an estimator for θ.

Thus, it is important to determine the number of conversions m. The following probability criterion is used in the determination of the required success number m for a given precision level e and for a given confidence level 1−α:




  
    
      
        
          P
          ⁢
          
            {
            
              |
              
                
                  T
                  m
                
                -
                
                  1
                  θ
                
              
              |
              
                ≺
                
                  ɛ
                  θ
                
              
            
            }
          
        
        ≽
        
          1
          -
          α
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          21
        
        )
      
    
  




The rationale of this probability criterion will become clearer from the explanation that follows.

For the decomposition:




  
    
      
        T
        ⁢
        
          =
          d
        
        ⁢
        
          
            ∑
            
              i
              =
              1
            
            m
          
          ⁢
          
            T
            i
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          22
        
        )
      
    
  




where T1, T2, . . . , Tm, i.i.d. ̃g(θ), which is the geometric distribution with the success parameter θ. With the central limit theorem, the following approximation can be determined for Eqn. 21:





  
    
      
        
          
            2
            ⁢
            
              Φ
              ⁡
              
                (
                
                  
                    
                      m
                    
                    
                      σ
                      ⁡
                      
                        (
                        
                          T
                          1
                        
                        )
                      
                    
                  
                  ⁢
                  
                    ɛ
                    θ
                  
                
                )
              
            
          
          -
          1
        
        ≽
        
          1
          -
          α
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          23
        
        )
      
    
  




Since σ2(T1)=(1−θ)/θ2, Eqn. 23 can be simplified to:





  
    
      
        
          
            
              m
            
            ⁢
            ɛ
          
          
            
              1
              -
              θ
            
          
        
        ≽
        
          z
          
            1
            -
            
              α
              /
              2
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          24
        
        )
      
    
  




For any implementation, the ceiling of the answer is used in order to obtain the required integer. Therefore, the choice of m is:





  
    
      
        
          m
          *
        
        =
        
          
            
              (
              
                
                  z
                  
                    1
                    -
                    
                      α
                      /
                      2
                    
                  
                
                ɛ
              
              )
            
            2
          
          ⁢
          
            (
            
              1
              -
              θ
            
            )
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          25
        
        )
      
    
  




The random event of the probability criterion of Eqn. 21 can be expressed in terms of the difference between θ and its estimator m/T. The random event is equivalent to the following:





  
    
      
        
          
            1
            -
            ɛ
          
          θ
        
        ⪯
        
          T
          m
        
        ⪯
        
          
            1
            +
            ɛ
          
          θ
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          26
        
        )
      
    
  




It is then, of course, true that:





  
    
      
        
          -
          
            ɛθ
            
              1
              +
              ɛ
            
          
        
        ⪯
        
          
            m
            T
          
          -
          θ
        
        ⪯
        
          ɛθ
          
            1
            -
            ɛ
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          27
        
        )
      
    
  




Setting the lower limit of the precision level εL=−εθ/(1+ε), and setting the upper bound of the precision level εU=εθ/(1−ε), then the criterion of Eqn. 21 becomes:





  
    
      
        
          P
          ⁢
          
            {
            
              
                ɛ
                L
              
              ⪯
              
                
                  m
                  T
                
                -
                θ
              
              ⪯
              
                ɛ
                U
              
            
            }
          
        
        ≽
        
          1
          -
          α
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          28
        
        )
      
    
  




The probability criterion now becomes more intuitive for the purpose of estimating θ by the estimator m/T. Another value of this last equation is that the manager can readily specify the precision level in estimating θ, expressed in terms of either εL or εU. For example, once εU is specified, then:





  
    
      
        ɛ
        =
        
          
            ɛ
            U
          
          
            θ
            +
            
              ɛ
              U
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          29
        
        )
      
    
  








  
    
      
        =
        
          -
          
            
              ɛ
              L
            
            
              θ
              +
              
                ɛ
                L
              
            
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          30
        
        )
      
    
  




Inserting these expressions of ε into Eqn. 25, the calculations of m* become:





  
    
      
        
          m
          *
        
        =
        
          
            
              z
              
                1
                -
                
                  α
                  /
                  2
                
              
              2
            
            ⁡
            
              (
              
                1
                -
                θ
              
              )
            
          
          ⁢
          
            
              (
              
                1
                +
                
                  θ
                  
                    ɛ
                    U
                  
                
              
              )
            
            2
          
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          31
        
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          =
          
            
              
                z
                
                  1
                  -
                  
                    α
                    /
                    2
                  
                
                2
              
              ⁡
              
                (
                
                  1
                  -
                  θ
                
                )
              
            
            ⁢
            
              
                (
                
                  1
                  +
                  
                    θ
                    
                      ɛ
                      L
                    
                  
                
                )
              
              2
            
          
        
      
    
    
      
        (
        
          E
          ⁢
          
            
          
          ⁢
          q
          ⁢
          
            
          
          ⁢
          
            n
            .
            
              
            
            ⁢
            32
          
        
        )
      
    
  




It should be noted that the confidence interval of θ in the probability criterion is not symmetrical about θ, since it is generally true that the absolute of εL is not equal to the absolute of εU. This is different from the traditional statistics inference approach. In fact, it is believed that the generalization to asymmetric confidence intervals has its advantage in the conversion rate context, since conversion rates are not regarded as having the same weight in reality. However, despite the asymmetric confidence interval, the formulas for computing m from either εL or εU are the same.
Using the negative binomial sampling approach, inputs may include (1) the conversion number m, (2) the lower precision level εL, (3) the upper precision level εU, (4) the confidence level 1−α, and (5) the estimated conversion rate θ. If item (1) is specified, then we just keep observing until the actual success number reaches m. However, it is difficult to specify m without any prior knowledge. Therefore, specifying items (2)/(3), (4) and (5) is required in order to compute for m. Note that we only need one of (2) and (3), not both. The desired outputs are the conversion rate point estimate and the conversion rate confidence estimate.
After the total number m of conversions are detected during the testing stage 40 of FIG. 2, the conversion rate point estimate is computed on the basis that {circumflex over (θ)}=m/T. FIG. 3 includes a decision step 84 of determining whether a final required sample size has been reached. That is, a recalculation of the sample size occurs if the conversion number m is reached but the confidence requirements are not satisfied. If the confidence requirements are satisfied, the process ends, but if the sample size is renumbered, the process returns to the step 78 of obtaining observations. This process will be described in the next section. Briefly stated, upon checking on the attained confidence level length, it is determined whether additional sampling is needed.
E. Customer Allocation, Sequential Testing and Termination
During the testing stage, there are number of considerations that must be addressed. One consideration is the technique for allocating promotions to arriving visitors within a particular customer segment. In some situations, the assumed conversion rates are not informative. For example, an e-marketer may not be able to provide any relevant information. In such situations, there are advantages to allocating all promotions to the arriving visitors alternately during the testing stage. Thus, if there are two promotions, the odd numbered visits result in presentation of the first promotion, while the even numbered visits trigger presentation of the second promotion. This achieves some randomization effect which can reduce unaware biases. On the other hand, if informative inputs on the assumed conversion rates are available for the different combinations, a proportional sampling scheme may be implemented in the allocation approach.
For each combination of a customer segment and a promotion, an index (c) can be assigned on the basis of c=(i, k), where i is the customer segment and k is the promotion. Upon reaching a closing time (t), an attained confidence interval length D(c, t) is computed. Then, termination occurs for those c's in which the “convergence” of D(c, t) has been reached. One termination criterion for convergence is whether the variable moving average reaches a threshold. That is, termination occurs for those combinations that satisfy:




  
    
      
        
          
            {
            
              
                ∑
                
                  i
                  =
                  1
                
                t
              
              ⁢
              
                
                  D
                  ⁡
                  
                    (
                    
                      c
                      ,
                      i
                    
                    )
                  
                
                /
                t
              
            
            }
          
          /
          
            
              θ
              ^
            
            t
          
        
        ≤
        
          1
          -
          α
        
      
    
    
      
        (
        
          Eqn
          .
          
            
          
          ⁢
          33
        
        )
      
    
  




where 1−α is a prespecified stabilization confidence level. For those 35 combinations that do not satisfy the criterion, if there is no promotion budget problem for continuing the sampling until t+1, the process runs for those combinations until t+1. On the other hand, if there are promotional budget problems, then ranking may occur for all remaining D(c)=D(c, t), with proper aggregation over t. After the ranking, the combinations with the lowest D values are terminated until there are no longer any promotional budget concerns. For the rest, the sampling continues to run until time t+1, whereafter the criteria of Eqn. 33 is again applied.

Upon the termination of any combination, the resulting conversion rate is used to reevaluate the sample size requirement for additional sampling needs. In some occasions, the termination period will be reestablished. As a note, it may be beneficial to store all raw conversion data in a log for subsequent use.

## Claims

1. A computerized method of processing test data that is relevant to specific behavior of visitors of at least one network accessible site comprising the steps of:
receiving pre-test information related to determining an estimation of anticipated behavior of said visitors to said at least one network accessible site;
monitoring actual behavior of said visitors upon accessing said at least one network accessible site;
employing said pre-test information and a Bayesian estimation approach to said monitoring of said actual behavior so as to provide updated estimations of subsequent visitor behavior, said behavior being related to whether said visitors are converted while accessing said at least one network accessible site, said pre-test information and said updated estimations being related to determination of conversion rates;
determining a required test sample size for said monitoring of said actual behavior in order to provide said updated estimations of subsequent visitor behavior, including adaptively adjusting said determination of said required test sample size on a basis of achieving a target confidence level regarding said updated estimations; and
determining a post-test estimation of said subsequent visitor behavior, including selecting between using a systematic sampling approach and using a negative binomial sampling approach, said negative binomial sampling approach being selected in response to unavailability of said required test sample size for said monitoring;
wherein an automatic process is defined by integration of said steps of receiving, monitoring and employing with said steps of determining a required test sample size and determining said post-test estimation, said post-test estimation being configured to provide a basis for determining interactions during subsequent visits to said at least one network accessible site.

2. The computerized method of claim 1 wherein said step of receiving said pre-test information includes accessing a probability distribution characterization of said anticipated behavior, including utilizing confidence parameters that are based on confidence of accuracy of estimates.

3. The computerized method of claim 1 wherein each said network accessible site is a website available via the global communications network referred to as the Internet.

4. The computerized method of claim 1 wherein said step of determining said required test sample size includes utilizing negative binomial sampling.

5. The computerized method of claim 1 wherein said step of determining said required test sample size includes utilizing systematic sampling.

6. The computerized method of claim 1 wherein said negative binomial sampling approach is used to calculate a predicted conversion rate of a desired behavior at a website.

7. A computerized method of processing test data that is relevant to specific behavior of visitors of at least one network accessible site comprising the computer-executable process steps of:
detecting conversions at said at least one network accessible site, where said conversions are specific interactions that are entered by said visitors;
utilizing automated negative binomial sampling to determine an adaptive minimum sample size for estimating a conversion rate for subsequent visitors, such that an estimated conversion rate is available for basing determinations regarding subsequent operations of said at least one network accessible site, including basing said adaptive minimum sampling size and an estimate of said conversion rate on said detecting of said conversions and upon a measure of confidence; and
activating automated systematic sampling to determine said adaptive minimum sampling size for estimating said conversion rate upon detection of acquiring a threshold number of samples, said negative binomial sampling being disabled following said acquiring said threshold number of samples.

8. The computerized method of claim 7 wherein said step of utilizing negative binomial sampling includes determining a target number (m) of conversions and an anticipated number (T) of visitors in order to reach m, with T having a negative binomial distribution and with said estimate of said conversion rate being equal to m/T.

9. The computerized method of claim 7 wherein said detecting step includes monitoring visitor activity in interaction with a website of the Internet.

10. The computerized method of claim 7 wherein said measure of confidence is a confidence level regarding accuracy of said estimate of said conversion rate.

11. A computer-usable medium containing computer-executable code for processing test data that is relevant to specific behavior of visitors of at least one network accessible site comprising:
a first module component for determining an initial conversion-related estimate on a basis of pre-testing information;
a second module component for generating updates of said conversion-related estimate in response to monitored behavior of said visitors of said at least one network accessible site, thereby enabling operations at said at least one network accessible site to be determined on a basis of said conversion-related estimate;
a third module component for dynamically adjusting a measure of a required test sample size of said visitors while maintaining a target statistical confidence level, said third module component applying systematic sampling; and
a fourth module component for utilizing negative binomial sampling to generate measures of said test sample size for occurrences in which said required test sample size of said third module component is unsatisfied.

12. The computer-readable medium of claim 11 wherein said first, second, third and fourth module components are cooperative to determine said conversion-related estimates as point estimates of conversion rates of said visitors to act in a desired manner, each said act being a conversion.

13. The computer-readable medium of claim 12 further comprising an execution module which monitors said visitors of a website, such that conversions of said visitors are detected.

14. The computer-readable medium of claim 11 wherein said second module component generates said updates utilizing Bayesian estimation.

15. The computer-readable medium of claim 11 wherein said third module component utilizes negative binomial sampling in determining said measure of said required test sample size.