US 8,799,200 B2Grant
Method and system for creating a predictive model for targeting webpage to a surfer
Issue Date:2014-08-05
•17 Claims
•12 Drawing Sheets
Abstract
A system and method for creating a predictive model to select an object from a group of objects that can be associated with a requested web page, wherein a configuration of the requested web page defines a subgroup of one or more selected objects from the group of objects. Exemplary embodiments of the present invention seek to provide novel solutions for determining which content object, taken from a group of content objects, will be best suited for presentation in association with a link on a web page that has been requested by a certain surfer. Each web page can include one or more links to be associated with content objects from the group.
For each content object presented over a requested web page, a predictive model with relevant predictive factors is processed such that the predicted objective, the probability of success for example, is calculated. A success is defined as a surfer responding to the presented content. For example, should a surfer select a relevant content object, the probability of the objects that can be presented is calculated. Subsequently, the objects with the highest predictive expected utility are selected to be associated with the links in the web page requested by the surfer.
Metadata
Assignee
- Liveperson, Inc.
Inventor
- Shlomo Lahav
Application Information
Application Number:US 12/504,265
Filing Date:2009-07-16
Priority Date:2008-07-25
Art Unit:2129
Classifications
IPC:
G06N7/00G06Q30/02
Field of Search:
G06N 7/005G06Q 30/0251
Patent Drawings (12 sheets)
Description
Cross-Reference to Related Applications
[0001] This application claims the benefit of the filing date of U.S. Provisional Application for Patent entitled METHOD AND SYSTEM FOR PROVIDING TARGETED CONTENT TO A SURFER, filed on Jul. 25, 2008 and assigned Ser. No. 61/083,551 as well as the filing date of U.S. Provisional Application for Patent entitled METHOD AND SYSTEM FOR CREATING A PREDICTIVE MODEL FOR TARGETING CONTENT TO A SURFER, filed on Jul. 25, 2008 and assigned Ser. No. 61/083,558.
[0002] This application is related to a U.S. patent application Ser. No. 12/503,925 that has a title of METHOD AND SYSTEM FOR PROVIDING TARGETED CONTENT TO A SURFER, which was filed concurrently with this application and is hereby incorporated by reference in its entirety.
Background
[0003] More and more people are communicating via the Internet and other networks. The Internet, in particular, is a hierarchy of many smaller computer networks, all of which are interconnected by various types of server computers. Some of the servers interconnected through the Internet provide database housing as well as storage of a plurality of web pages, generally referred to as the World Wide Web (WWW). By virtue of being accessible through the WWW, these web pages may be retrieved by random Internet users, i.e. surfers, operating computers with a browser.
[0004] Some common examples of browser applications used by Internet surfers are Openwave Systems Inc. or Opera Mobile Browser (a trademark of Opera Software ASA), Microsoft Internet Explorer (a trademark of Microsoft), and Firefox Web Browser. Using a web browser application on a computer that is connected to the Internet, surfers may retrieve web pages that include information such as news, professional information, advertisements, e-commerce links, content downloads, etc. A common browser application may use Hyper Text Transport Protocol (HTTP) in order to request a web page from a website. Upon receipt of a web page request by a browser, the website responds by transmitting a markup language file, such as Hypertext Markup Language (HTML), that is representative of the requested page or pages. Notably, HTTP requests and HTML responses are well known in the art and are used as representative terms for the respective markup language files throughout this disclosure.
[0005] A common web page may include numerous buttons, or links, operable to redirect a surfer to other locations within the website or on the Internet. These links offer a surfer a path to a next event which may be the presentation of another web page, embedded content within the present web page (e.g. an image, an advertisement, a banner, etc.), a playable media file, a number for forwarding a short message service (SMS) with a password, an application form, a registration form, etc.
[0006] A common link design may display a name of a category of information, such as news, sport, or economics. Other link designs may comprise a banner or an image intended to attract the attention of a surfer to an advertisement, an image, a text message that prompts the surfer to dial a number and use a password, etc. If a surfer is enticed to explore the offer shown on the link design, the surfer will use a pointing device such as a mouse, and place the pointer over the selected button, which may be comprised of a banner for example, and issue a command by “clicking” the mouse to “click through” on that button. In such a scenario, the surfer's browser may return information from a website associated with the particular banner that comprised the link.
[0007] In the present description, the terms “selecting button,” “selection button,” “redirecting button,” “slot”, “link,” “Hyper Link” and “banner” are used interchangeably. The terms “banner” and “slot” can be used as a representative term for the above group. An “advertisement” (AD) or “object” may be used as representative terms for content. Exemplary types of content can be the text of an AD as well as an AD's font, color, design of the object, an image, the design of the page in which the object is presented, etc.
[0008] The benefit from presenting a web page, as well as improving a surfer's experience when surfing the web page, can be increased if the selection buttons within the web page are targeted toward the immediate observer. There are numerous existing methods and systems for offering targeted content in a web based environment. Some of the methods employ questionnaires containing categorized questions on user preferences. Such methods require the management of huge databases containing information on a large number of users. Besides the cumbersome management of all the information acquired from questionnaires, another negative is that many users prefer not to even reply to a personalize questionnaire.
[0009] Other methods for identifying and offering targeted content in a web environment make use of client applications installed on a user's computer. The client applications are operable to track a user's activity on the web and subsequently report a compilation of the tracked activity to an associated web server or content server. Such methods are not popular with many users concerned with privacy. Further, such methods require the often costly and awkward installation of a client application on a user's computer.
[0010] Some methodologies for delivery of targeted content may comprise a learning period and an ongoing period. During the learning period, a plurality of options of content within a certain web page may be presented to various surfers. The response of the surfers to the various content options is monitored throughout the learning period in anticipation of ultimately employing the best performing alternative. During the subsequent ongoing period, all a surfers requesting the certain web page will be exposed to the previously selected alternative. Such an algorithm is often referred to as “The king of the Hill” algorithm. While a “King of the Hill” approach can fit the preference of a large group of surfers, it is prone to missing other groups of surfers that prefer other content delivery alternatives.
[0011] Therefore, there is a need in the art for a method and system that can calculate predictive models for determining an object to be presented in association with a given link in a web page used to attract an observer and entice a response. Exemplary responses may be the selection, or clicking of, a the link (banner, for example), sending of an SMS, calling a number and using a password, etc. In an embodiment of the present invention, when calculating the predictive model the expected value to the content provider is taken into account. In order to save expenses and complexity, it is recommended that the system be transparent to a surfer and will not require a database for storing information associated with a number of surfers.
Brief Summary
[0012] Exemplary embodiments of the present invention seek to provide novel solutions for determining which content object taken from a group of content objects will be best suited for presentation in association with a link on a requested web page. Exemplary types of content objects may comprise the text, topic, font, color or other attribute of an advertisement. Still other content objects may comprise the specific design of the object, an image, the design of the page in which the object is presented, etc. The decision process for selecting a content object can be based on predictive information that is associated with the request, such as a common HTTP request. Exemplary associated predictive information may include the day and time of receipt of the request for the web page, the IP address and\or domain from which the request was sent, the type and the version of the browser application that is used for requesting the web page, and the URL used by a surfer for requesting the web page with the parameters that are attached to the URL.
[0013] Other types of predictive information can be statistical information indicative of the behavior of a surfer in relation to the website to which the request was sent. Behavioral information may include timers, frequency of visits by a surfer to the website, the last time that a surfer requested a web page, etc. Other behavioral information may include one or more counters wherein each counter can count the number of events of a certain type. Exemplary counters can measure the number of visits by a specific surfer to the relevant website, the number of requests for a certain web page within the website, the number of times a certain offer (content object) was selected or not selected, etc. Even further, some of the exemplary counters may be time dependent such that the value of the counter descends over time. In some exemplary embodiments of the present invention, the behavioral information may be embedded within a cookie that is related to the relevant website or a third party cookie.
[0014] Still other exemplary types of predictive information comprise grouping or categorizing information. Grouping information can be delivered by a web server that contains a requested web page. The grouping information can be associated with a group to which a current surfer belongs—surfer's grouping information (SGI). Exemplary surfer's grouping information can be used to define attributes of the group such as preferred sport clothing, preferred brand names, marital status, gender, age, etc. Surfer's grouping information can be managed by the web server and added to a field in a cookie associated with a certain surfer, for example.
[0015] Other grouping predictive information can reflect attributes of the content-content grouping information (CGI). The CGI can be related to the requested web page as well as attributes of the content objects presented in the requested web page. Exemplary CGI can define attributes of the page or the content object such as the cost of a product, a product brand, vacation information, etc. CGI can be managed by the web server and added to a field in the URL of a certain web page or URL of a certain content object, for example.
[0016] Each type of predictive information, associated predictive information, predictive statistical information and grouping predictive information can be retrieved and processed for defining one or more predictive factors which can be used in one or more predictive models. The predictive factors are used for calculating the predictive value gained by the website when presenting each content element. This value can also be the probability of a certain content object from a group to be selected by a surfer currently observing the requested web page.
[0017] An alternative is to use a utility value. A utility value can represent a website's benefit when the alternative is explored by a surfer. The probability can be multiplied by the associated utility to obtain the expected utility when presenting the alternative. In the present description, the terms “predictive information,” “predictive factor,” and “predictive variable” may be used interchangeably.
[0018] An exemplary embodiment of the present invention can create a bank of predictive models. Each predictive model can be associated with a content object from the set of content objects that can be presented over the requested web page. An exemplary predictive model may include one or more predictive factors with each predictive factor (predictive variable) being associated with a coefficient in a predictive formula. Exemplary predictive formulas can be based on known predictive algorithms such as, but not limited to, logistic regression, linear regression, decision tree analysis, etc. Some exemplary embodiments of the present invention can use linear or logistic regression, with or without stepwise methods, while calculating the predictive formula.
[0019] A predictive factor can also be a subset of values of certain variables such as, for example, the weekdays Monday and Saturday. The coefficient can thus outline the effect a predictive factor has on the probability that a relevant content object will trigger a desired response from a surfer. Exemplary predictive factors may include, for example, the day in the week (Monday and Saturday, for example), the hour, the browser type, the number of visits to the site, the content object that is presented in accordance with another link on the same web page, the total elapsed time from the last visit, etc.
[0020] Exemplary predictive models can include some constants that are related to the content object associated with the model. Exemplary constants may be a utility constant which reflects the benefits the owner of the website receives when the relevant content object is selected or an arithmetic factor.
[0021] For each content object presented over a requested web page, a predictive model with relevant predictive factors is processed such that the predicted objective, the probability of success for example, is calculated. A success is defined as a surfer responding to the presented content. For example, should a surfer select a relevant content object, the probability of the objects that can be presented is calculated. Subsequently, the objects with the highest predictive expected utility are selected to be associated with the links in the web page requested by the surfer. The markup file that represents the web page is modified such that its links point to the selected objects. The predictive objective value can be calculated to correspond to the predictive model. For example, in the logistic regression predictive model, the optimal linear predictive function is calculated and converted using a link function such as “Log Odds,”
[0022] Another exemplary embodiment of the present invention may include a learning module. An exemplary learning module may be adapted to monitor the data exchange between a plurality of random surfers at one or more websites. Further, it can collect predictive information on content objects embedded within the requested web pages as well as track how each of the random surfers responds to those offers. From time to time, the exemplary learning module can process the sampled data in order to determine which predictive factors are relevant for each one of the objects and calculated an associated coefficient for success. Per each object, its associated statistical module can be updated or recalculated using the new or updated predictive factors.
[0023] An exemplary embodiment of the present invention operates in either of two modes of operation, i.e. learning mode and ongoing mode. The learning mode can be executed after the initialization or when the content of the website is changed. During the learning mode, new predictive models are calculated. The ongoing mode can be executed after the learning mode and may monitor and tune existing predictive models.
[0024] During the learning mode, a large portion of communication sessions are sampled in order to define the new predictive models. Also during the ongoing mode, the size of the sample can be reduced and the predictive model tuned. When a significant change in the performance of a predictive model is observed, then a notification can be issued and/or a new predictive model can be created
[0025] The foregoing summary is not intended to summarize each potential embodiment or every aspect of the present disclosure. Other features and advantages of the present disclosure will become apparent upon reading the following detailed description of the embodiments with the accompanying drawings and appended claims.
Brief Description of the Several Views of the Drawing
[0026] Exemplary embodiments of the present invention will be understood and appreciated more fully from the following detailed description, taken in conjunction with the drawings in which:
[0027] FIG. 1 is a simplified block diagram illustration of an exemplary portion of a communication network in which exemplary embodiments of the present invention can be used.
[0028] FIG. 2 schematically illustrates a simplified block diagram with relevant elements of an exemplary content adaptive server (CAS) that operates according to certain technique of the present disclosure.
[0029] FIGS. 3A & 3B schematically illustrate a flowchart showing relevant processes of an exemplary embodiment of a management method.
[0030] FIG. 4 schematically illustrates a flowchart showing relevant processes of an exemplary embodiment of a method for handling a request for a web page.
[0031] FIG. 5 schematically illustrates a flowchart showing relevant processes of an exemplary embodiment of a method for storing sampled data.
[0032] FIG. 6 schematically illustrates a flowchart showing relevant processes of an exemplary embodiment of a method for handling a ML file of a requested web page.
[0033] FIG. 7 schematically illustrates a flowchart showing relevant processes of an exemplary embodiment of a method for selecting an optional object to be presented on a requested web page.
[0034] FIG. 8 schematically illustrates a flowchart showing relevant processes of an exemplary embodiment of a method for controlling the predictive models.
[0035] FIGS. 9A & 9B schematically illustrate a flowchart showing relevant processes of an exemplary embodiment of a method for building a predictive model.
Detailed Description
[0036] The present invention relates to the presentation of data over communication networks, such as the Internet, and more particularly to selecting one or more objects (content of a web link) from a group of objects of content, to be presented over a requested web page.
[0037] Turning now to the figures in which like numerals represent like elements throughout the several views, exemplary embodiments of the present invention are described. For convenience, only some elements of the same group may be labeled with numerals. The purpose of the drawings is to describe exemplary embodiments. Therefore, features shown in the figures are chosen for convenience and clarity of presentation only.
[0038] FIG. 1 depicts a block diagram with relevant elements of an exemplary communication system 100, which is a suitable environment for implementing exemplary embodiments of the present invention. Communication system 100 may comprise a plurality of surfer terminals (ST) 110; a network 120 such as, but not limited to, the Internet; one or more improved content servers ICS 140; and one or more adaptive content domains (ACD) 150.
[0039] The communications system 100 may be based on the Internet Protocol (IP) and represent one or more network segments including, but not limited to, one or more Internet segments, one or more Intranets, etc. Network 120 may run over one or more types of physical networks such as, but not limited to, Public Switched Telephone Network (PSTN), Integrated Services Digital Network (ISDN), cellular networks, satellite networks, etc. Further, network 120 may run over a combination of network types. Network 120 may also include intermediate nodes along the connection between a surfer and a content server. The intermediate nodes may include, but are not limited to, IP service provider servers, cellular service provider servers and other types of network equipment.
[0040] It will be appreciated by those skilled in the art that depending upon its configuration and the needs, communication system 100 may comprise more than three ST 110, three ICS 140 and three ACD 150. However, for purposes of simplicity of presentation, three units of each are depicted in the figures. Further, it should be noted that the terms “terminals,” “endpoint computer,” “endpoint,” “surfer,” “random surfer,” “user's device,” “mobile phone” and “user” may be used interchangeably herein.
[0041] A plurality of ST 110 may be served by system 100 for surfing the Internet 120 and fetching web pages from the one or more ICS 140 or ACD 150. Exemplary ST 110 can be a personal computer (PC), a laptop, a notebook computer, a cellular telephone, a handheld computer, a personal data assistant (PDA), or any other computing device with wired or wireless communication capabilities communicable over an IP network. A common ST 110 may run a browser application such as, but not limited to, Openwave Systems Inc. or Opera Mobile Browser (a trademark of Opera Software ASA), Microsoft Internet Explorer (a trademark of Microsoft), or Firefox Web Browser. The browser application can be used for rendering web pages. Exemplary web pages may include information such as news, professional information, advertisements, e-commerce content, etc.
[0042] A common browser application can use HTTP while requesting a web page from a website. The website can respond with a markup language file such as but not limited to HTML files. Herein the term HTML is used as a representative term for a markup language file. HTTP requests and HTML responses are well known in the art.
[0043] Exemplary ICS 140 and/or ACD 150 may receive HTTP requests from the plurality of ST 110 and deliver web pages in the form of markup language files such as, but not limited to, HTML files. An exemplary ICS 140 may comprise a surfer's interface unit (SIU) 143 and a content adaptive module (CAM) 146. Exemplary SIU 143 can execute common activities of a content server. Further, it may receive HTTP requests and respond with HTML files. In addition, exemplary SIU 143 may communicate with CAM 146 and/or deliver information about the activities of the different ST 110. The activity can be the web pages requested by the surfers, for example.
[0044] In some exemplary embodiments of the present invention, SIU 143 may deliver to CAM 146 information about surfer attributes. Exemplary attributes may be a surfer's purchasing habits (expensive, not-expensive, brand name, etc.). A specific surfer's information can be managed by the web server and be added to a field in the cookie associated with the particular surfer.
[0045] In some embodiments, the information can also be related to the requested web page as well as particular attributes of the content objects to be presented in the requested web page. Exemplary information that may define attributes of the web page or the content object include, but are not limited to, the cost of a product, the brand of a product, vacation information, etc. This type of information can be managed by the web server and added to a field in the URL of a certain web page or URL of a certain content object, for example.
[0046] CAM 146 may process requests of different surfers in order to create a plurality of predictive modules, wherein each predictive module can be associated with an optional object that is presented over a requested web page in one of the slots (redirection-button) from a set of optional slots. The predictive modules can be used to select an object that maximizes an expected benefit to the site owner. In the present description, the terms “expected benefit” and “expected utility” can be used interchangeably. The sets of slots, in which an optional object can be presented, and the selected optional object to be presented in each slot (Slot/Optional-object) can be defined within the configuration of the web page. The configuration of the object/redirection-buttons with the optimal prediction to be selected for the requesting surfer is transferred to SIU 143. In response, SIU 143 may modify the HTML file to include those objects in the relevant links.
[0047] Exemplary ACD 150 can include a plurality of common content servers 152 and one or more content adaptive servers (CAS) 154. CAS 154 can be connected as an intermediate node between the plurality of ST 110 and the content servers 152. In one exemplary embodiment, CAS 154 may be configured as the default gateway of the ACD 150. In another exemplary embodiment, CAS 154 may physically reside between the ACD 150 and the network 120.
[0048] In yet another exemplary embodiment of the present invention, a redirector may be included and CAS 154 configured as a transparent proxy. In such an embodiment, CAS 154 may be transparent to both sides of the connection, to ST 110 and to the content servers 152. In an alternate exemplary embodiment of the present invention CAS 154 may be used as a non-transparent proxy. In such an embodiment, the ST 110 can be configured to access CAS 154 as their proxy, for example.
[0049] CAS 154 can intercept the data traffic between the plurality of ST 110 and content servers 152. CAS 154 tracks the behavior of a plurality of surfers in order to create predictive models for content objects to be associated with requested web pages. Subsequently, when operating in an ongoing mode, the predictive models can be used for determining which objects to assign to a web page requested by a given surfer.
[0050] Toward ACD 150, CAS 154 can process requests of surfers, for retrieving a plurality of predictive factors to be used in a plurality of predictive modules, similar to the predictive modules that are used by exemplary CAM 146. In the other direction, CAS 154 can process the responses (the HTML files, for example) and determine, based on the predictive models, which object to present. The HTML file, which represents the web page, is modified to include those objects in the links. More information on the operation of ICS 140 and CAS 154 is disclosed below in conjunction with FIGS. 2 to 9 .
[0051] FIG. 2 illustrates a block diagram with relevant elements of an exemplary embodiment of a content adaptive server (CAS) 200 that operates according to certain techniques of the present disclosure. Exemplary CAS 200 can be installed in association with ACD 150, as unit 154 (FIG. 1 ) for example. In one exemplary embodiment, CAS 200 may intercept the communication between the plurality of ST 110 and the plurality of content servers 152 (FIG. 1 ). CAS 200 can process surfer requests in order to track and learn about the behavior of each surfer. Based on learned information obtained from a plurality of surfers, CAS 200 can create a plurality of predictive models that correspond to given surfers. Each predictive model can be assigned to an object that is associated with a redirecting button in a requested web page.
[0052] After creating the predictive models, CAS 200 can use the models in order to determine which combination of optional objects can be associated with certain redirecting buttons in a requested web page such that the profit of the owner of the ACD 150 is maximized. This configuration is referred to as a predictive configuration of the web page. Markup language files, such as HTML files, are transferred from content servers 152 toward ST 110 and can be modified by CAS 200, for example, in order to match the predicted configuration.
[0053] The behavior of surfers can be monitored and learned during the ongoing operation of an exemplary CAS 200. The monitored data can be used in order to improve the predictive models.
[0054] An exemplary CAS 200 can be divided into two sections, a network interface section and a content adaptation section. The network interface section may comprise an HTTP proxy 210, a page request module (PRM) 220, an active surfer table (AST) 215 and a markup language file handler (MLFH) 230. The content adaptation section may include one or more page data collectors (PDC) 240, one or more page object selection modules (POSM) 250, and a management and prediction module (MPM) 260. Data communication between the internal modules of CAS 200 may be implemented by using components such as, but not limited to, shared memory, buses, switches, and other components commonly known in the art that are not necessarily depicted in the drawings.
[0055] An exemplary ICS 140 (FIG. 1 ), in addition to common elements of a typical web server, may comprise elements which are similar to the elements of CAS 200. For example, SIU 143 (FIG. 1 ) may comprise elements having functionality similar to an HTTP proxy 210, a PRM 220, an AST 215 and an MLFH 230. An exemplary CAM 146 (FIG. 1 ) may comprise elements that are similar to those of a PDC 240, a POSM 250, and an MPM 260. Therefore, the operation of an exemplary ICS 140 may be learned by one skilled in the art from the detailed description of a CAS 154 and, to avoid unnecessary redundancy, will not be specifically described herein.
[0056] In exemplary embodiments of the present invention, in which the communication over network 120 is based on IP, HTTP proxy 210 may be adapted to handle the first four layers of the OSI (open system interconnection) seven layer communication stack. The layers may be the Physical Layer, Data Link Layer, Network Layer, and the Transport Layer (the TCP stack). In exemplary embodiments of the present invention, in which the CAS 200 is transparent to the ST 110 (FIG. 1 ) as well as to the content servers 152 (FIG. 1 ), the HTTP proxy 210 may behave as a transparent proxy and may use a redirector. The transparent HTTP proxy 210 may be adapted to collect packets traveling from/to the plurality of ST 110 (FIG. 1 ) and to/from the plurality of the content servers 152 of the domain 150. The header of the packets may be processed in order to determine how to route the received packets. HTTP requests for web pages may be routed toward PRM 220 and responses that include web pages in the form of a markup language file may be routed toward MLFH 230. Other packet types may be transferred toward their destination in an “as is” form.
[0057] Data coming from the internal module of CAS 200 is transferred via HTTP proxy 210 toward their destination. For example, HTTP requests for web pages, after being processed by PRM 220, are transferred toward the appropriate content server 152 (FIG. 1 ). HTML files, after being handled by MLFH 230, are transferred toward the appropriate ST 110 via HTTP proxy 210 to network 120.
[0058] Exemplary PRM 220 may comprise a bank of domain counters 222, a cookie decompression and update module (CDUM) 224 and a timer 226. PRM 220 may receive, from HTTP proxy 210, requests for web pages that are targeted toward content servers 152 (FIG. 1 ). The requests are processed in order to collect information that may be used for preparing predictive models, monitoring the predictive models, or retrieving predictive factors to be placed in a predictive model. After processing the request, the processed request is transferred toward the content servers 152 via HTTP proxy 210. The collected information may be written in an entry of AST 215 that is associated with the requester of the web page.
[0059] The collected information may include associated information such as, but not limited to, the day and the time the request for the web page was received, the IP address or IP port from which the request was sent, the type and the version of the browser application used for requesting the web page, and the URL used by a surfer for requesting the web page with the parameters that are attached to the URL.
[0060] In addition, the retrieved information may include behavioral information. The behavioral information may be statistical information that is managed by CAS 200. It may be divided into a requester's related behavioral information and a domain's related information. The requester's related behavioral information may include timers indicating one or more previous visits by the requester to the domain ACD 150 (FIG. 1 ), the last time that the requester requested a certain web page, the number of the requester's visits in the relevant ACD 150, etc. In some exemplary embodiments of the present invention, the requester's related behavioral information may include some attributes of the relevant surfer such as gender, age, income, etc. The requester's behavioral information may be retrieved from a cookie that is associated with the request.
[0061] The domain related behavioral information may include the number of requests for a certain web page from the domain and the time of the last request for this page, the number of times a certain offer (content object) was selected, the last time that it was selected, etc. Some of the exemplary counters may be time dependent such that the value of the counter may decrease over time. The domain related behavioral information may be counted and recorded in a plurality of domain counters 222 by PRM 220. In some exemplary embodiments of the present invention, behavioral information may be written within a cookie that is related to ACD 150 (FIG. 1 ).
[0062] The counters may be incremented by PRM 220 each time a request for an event that is related to the counter is identified by PRM 220. Incrementing the value of a counter may be time dependent such that the last value may decrease according to the time difference between the last event and the current event. Then the decreased value is incremented by one and the time of the current event is recorded. Fading the value of the counters may be done by using an exponential formula using a half-life-time constant, for example. The half-life-time constant may have a configurable value or an adaptive one. It should be understood that the fading algorithm described above is offered herein for exemplary purposes only and should not be interpreted to limit the present scope. Those skilled in the art with appreciate that other exemplary embodiments of the present invention may use other fading algorithms for adjustment of a counter.
[0063] PRM 220 may retrieve an associated cookie from the request, if one exists. In one exemplary embodiment, in which the cookie is compressed, the cookie is transferred to CDUM 224. Those skilled in the art will appreciate that different methods may be used for compressing/decompressing information written in a cookie. An exemplary compression method may express the values of the counters using a subset of ASCII based characters in lieu of decimal based characters. Other embodiments may express the counters by using logarithmic numbers (integer and mantissa), for example. Still other embodiments may use the combination of the two.
[0064] The decompressed cookie is parsed to identify a requester's ID wherein a requester's ID is an ID number that has been allocated to the requester by PRM 220. An exemplary ID may be defined randomly from a large number of alternatives. It may be a 32 bit or 64 bit number. If a requester's ID exists, then the AST 215 is searched for a section in AST 215 that is associated with the requester's ID. If a section exists, then a new entry is allocated in the relevant section of AST 215 for recording the associated and behavioral information that is relevant to the requester's request. If a section in AST 215 was not found, a new ID may be allocated for the given requester. In some exemplary embodiments of the present invention, a field in the cookie may point to a file stored at the server that includes behavioral information associated with a surfer.
[0065] If a requester's ID was not found in the cookie, a new requester's ID may be allocated to the requester. To do so, a new section in AST 215 may be allocated by PRM 210 to be associated with the new requester's ID and a new entry in the section allocated for storage of the information that is related to the current request for a web page.
[0066] Timer 226 may be used while managing behavioral information of a user. It may be used for timing indication on previous activities such as previous visiting, previous purchasing, etc. Further, the value of timer 226 may be used in the process of time fading of the counters. The clock of timer 226 may range from a few seconds to a few minutes, for example. Timer 226 may be a cyclic counter having a cycle of six months, for example.
[0067] Exemplary AST 215 may be a table, which is stored in a random access memory (RAM), for example. AST 215 may be divided into a plurality of sections such that each section is associated with a requester's ID and represents an active surfer. Further, each section may include a plurality of entries. Each entry may be associated with a request of a surfer from the web site ACD 150 (FIG. 1 ). Each entry may have a plurality of fields for storing information that may be used in the prediction process.
[0068] Each entry may include fields such as, but not limited to, the receipt time of the relevant request or associated information retrieved from the relevant request. Exemplary associated information may be such as, but not limited to, the type and the version of the browser application used for requesting the web page or the URL used by a surfer for requesting the web page along with the parameters that are attached to the URL.
[0069] In some embodiments of the present invention, some the URLs may include content grouping information such as, but not limited to, attributes of the content objects. Exemplary attributes may be the cost of a product, the brand of a product, vacation information, etc.
[0070] Other fields in an entry of AST 215 may store updated requester related behavioral information. Still other fields may store domain related behavioral information that was valid when the previous web page was sent from the domain to the requester. Yet another group of fields may store management information that is related to the operation of CAS 200 and indicate whether the current section is associated with a control surfer or a common surfer, for example. A common surfer may be a surfer for whom the object was presented as a result of using the object's prediction module. A control surfer may be a surfer for whom the object was selected randomly to be presented.
[0071] New sections and new entries in AST 215 are allocated by PRM 210. Different modules of CAS 200 may read and write information from/to the AST 215, as disclosed below relative to the description of the other modules of CAS 200. Once every configurable period, AST 215 may be scanned by MPM 260 looking for one or more inactive sections of AST 215. Exemplary periods may range from a few seconds to a few minutes. An inactive section is a section that the time period between the last received request (the time associated with the last entry of the section) is longer than a certain configurable value. Entries of inactive sections of AST 215 may be released after any stored data is copied to the appropriate PDC 240.
[0072] After allocating an entry for the current request in the appropriate section of AST 215, PRM 210 may write the retrieved associated information in the appropriate fields of the entry. A requester's related behavioral information may be retrieved from the decompressed cookie. The appropriate counters of the requester's retrieved related behavioral information may be updated. The received value of the appropriate counters may be manipulated to include the time affect of the period from the last visit (i.e., the fading affect). The time adapted value may be incremented by one, counting the current visit. The updated value may be stored in the relevant field of the entry.
[0073] PRM 210 may determine whether a requester that was assigned a new ID value can be designated as either a “control” or “common” requester. The decision may be based on configurable parameters, which may depend on the mode of operation of CAS 200, such as, for example, whether CAS 200 is operating in a “learning” mode or an “ongoing” mode. The decision on how to label the requester may be written in the appropriate field in the associated entry or section.
[0074] In the case that the requester has a valid ID, the URL associated with the request is parsed in order to determine which web page was previously delivered to the requester. The determination of the previously delivered web page may indicate the stimulus that prompted the user to make the current request. Once determined, the requester's section in AST 215 is searched for an entry that is associated with a previously delivered page (PDP). If such an entry is found, then an indication of “success” is written in association with the combination of the requested object and the link design (i.e., slot or redirection button). The success indication may be marked in a response field that is associated with the combination object and slot of the entry that includes the PDP that prompted the current requested object. While processing the information that is stored in the AST, object and slot combinations that do not have a success indication may be marked as “failures.”
[0075] After processing the request, PRM 210 may replace the cookie, or write a new cookie if the request does not already include a cookie, with updated behavioral information. Subsequently, the request with the new cookie may be transferred to one of the content servers 152 (FIG. 1 ) via HTTP proxy 210. More information on the operation of PRM 210 is disclosed below in conjunction with FIG. 4 .
[0076] An exemplary MLFH 230 may comprise a cookie update and compression module (CCM) 232. MLFH 220 receives, via HTTP proxy 210, markup language (ML) files such as HTML files, for example, that represent the requested web pages sent from content servers 152 toward ST 110 (FIG. 1 ). Each received ML file is parsed and the requester's ID retrieved. In addition, the web page ID may be defined. Based on the requester's ID, the relevant entry in the requester section of AST 215 is retrieved and parsed and the requester's assigned type (“control” or “common”) is determined.
[0077] For a “control” requester, based on the web page ID, MLFH 230 may randomly configure the received ML file. The configuration may include the set of links (i.e., slots or redirection buttons) in the web page and an assigned object for each one of the links in the set. The assigned object may be selected randomly from a group of objects that may be presented on the requested web page, as determined by ID of the web page. In the case that the requester is not a “control” requester, the location of the entry in AST 215 that is relevant to the current page is transferred to one of the POSM 250 associated with the page ID of the current received ML file. In response, POSM 250 may initiate a selection process for determining the predicted configuration (object and slot) of the received ML file. As an example, the predicted configuration may be the configuration which maximizes the predicted expected value obtained by presenting the particular configuration.
[0078] When MLFH 230 has a defined configuration (randomly selected or predicted), it may manipulate the received ML file in order to include the configuration. Per each set (object and slot), the URL of the selected object may be assigned to the relevant link (slot) in the ML file. In addition, the entry in AST 215 may be updated to include the configuration of the page. Fields of the relevant entry in AST 215 that need to be included in an updated cookie, such as, but not limited to requester ID, updated page ID counters, and timers, are retrieved from AST 215 by MLFH 230. Identified fields are compressed by CCM 232, according to one of the compression methodologies previously anticipated. The compressed cookie is added to the header of the modified ML file. The modified ML file with the new cookie may then be transferred toward one of ST 110 (FIG. 1 ) via HTTP proxy 210. More information on the operation of MLFH 230 is disclosed below in conjunction with FIG. 6 .
[0079] Each PDC 240 is associated with a web page that is stored in one of the content servers 152 (FIG. 1 ) and includes one or more links (slots) as well as a group or set of optional objects that may be assigned to those slots. Exemplary PDC 240 stores and manage the sampled data that is needed for calculating predictive models for objects that are associated with the given web page. An exemplary PDC 240 may comprise an event logger (ELOG) 242, an observation manager module (OMM) 246, and/or an objects historical database (OHDB) 248 that may include a plurality of database couples 249as & af to 249ns & nf. Each couple is associated with an object (objects a-n that may be assigned to the page). Each couple of databases, one database, 249af for example, stores records of events in which a link to the relevant object appeared in a delivered web page but the object was not selected. The second DB 249as stores records of events in which the relevant object was selected, for example.
[0080] From time to time, one or more entries of an inactive section may be retrieved from AST 215 by MPM 260. These entries may be sorted according to the web pages that are associated with the entry and copied to ELOG 242 of the relevant PDC 240. Wherein each PDC 240 is associated with one web page of the one or more web pages, each one of these entries, in AST 215, may be transferred as a record into ELOG 242 and the inactive entries released from AST 215.
[0081] OMM 246 manages the stored records that are related to its associated web page. In order to reduce the cost and the complexity of the PDC 240 storage volume, the storage volume may be divided into two types, short term (ELOG 242) and long term (the bank of databases OHDB 248). Periodically, once in a configurable transfer period (TP), an hour for example, the records in the ELOG 248 may be copied into appropriate ODB 249 and then released.
[0082] In one embodiment of PDC 240, OHDB 248 is managed in a cyclic mode. The volume of each ODB 249 is divided into a plurality of sub-ODB. Each sub-ODB is associated with a transfer period. A transfer period, for example, may be the time interval between transferring the data of ELOG 242 to OHDB 248 and the number of sub-ODB may be a configurable number that depends on the volume of each ODB 249 and the number of records for sub-ODB that are needed. The number of records in sub-OBD may vary according to the mode of operation, i.e. “learning” or “ongoing” mode, for example.
[0083] It is conceivable that the number of records copied from ELOG to a sub-ODB may be larger than the size of the sub-ODB. In such a scenario, dropping of records may be required. It is anticipated that in order to keep the integrity of the sampled data when record dropping is required, the ratio between the number of success-records that are copied to ODB 249s and the number of fail-records (not having a success indication) that are copied into ODB 249f must be taken into consideration. More information on the operation of PDC 240 is disclosed below in conjunction with FIG. 5 .
[0084] Each POSM 250 is associated with a web page that is stored in one of the content servers 152 (FIG. 1 ) and includes one or more links (slots) and a group of optional objects that may be assigned to those slots. In an exemplary embodiment of the present invention, POSM 250 may receive, from MLFH 230, a pointer to an entry in AST 215 that is associated with a markup language file (HTML, for example) currently processed by MLFH 230. After processing the information that is retrieved from the relevant entry in AST 215, POSM 250 may deliver a predictive configuration, which is a set of pairs, each pair comprised of a slot and an object, to be embedded in the markup language file that is currently handled. An exemplary POSM 250 may comprise a predictive factors buffer (PFB) 253, an object selecting processor (OSP) 255 and a bank of current predictive models that includes a plurality of object's predictive model (OPM) 257a to 257k. Each OPM 257 is associated with an object that may be presented on the currently processed HTML file.
[0085] A plurality of predictive factors may be retrieved by OSP 255 from the relevant entry in AST 215 and stored in PFB 253. Different methods may be used for determining which configuration of a delivered web page maximizes the expected predicted value obtained by presenting the configuration. In one exemplary method for defining the predictive configuration, each one of the OPM 257a-k may be processed either singularly or in parallel. Per each OPM 257a-k, one or more relevant predictive factors are copied from PFB 253 into the relevant location in OPM 257 and the predictive value of the object, as well as the predictive value of the configuration (set of objects and slots), is calculated and written in a table of prediction values. After calculating the predictive value of a first object and the recommended configuration of the page in view of the first object, OSP 255 may repeat the process for the remaining one or more objects.
[0086] After calculating the predictive values and the configuration per each object, OSP 255 may scan the table of prediction values in order to determine which web page configuration (set of slots and objects) without conflicts has the highest probability of being selected by a surfer. The identified configuration may be stored in the relevant entry of AST 215 and indication that a selection was made may be sent to MLFH 230.
[0087] An alternative embodiment of OSP may use another method, such as exhausting search, for defining the predictive configuration for the requested web page. In such an embodiment, the table of prediction values may include an entry per each possible configuration (permutation) of the web page. Each entry in the table conceivable may have a plurality of fields wherein each field may be associated with an optional slot. Per each cell (a junction between a row and a column in the table), the OPM 257 of the object that is associated with the slot may be fetched and calculated in view of the other configuration pairs of the web page. The predictive value of the configuration of the web page may be calculated as the average of the predictive value of each cell in the row such that the configuration with the highest value may be selected as the predictive configuration. More information on the operation of POSM 250 is disclosed below in conjunction with FIG. 7 .
[0088] MPM 260 manages the operation of CAS 200. It may comprise a prediction model builder (PMB) 262, a manager module 264 and a predictive model monitoring module (PMM) 266. Exemplary manager 264 may communicate with the administrator of ACD 150 (FIG. 1 ) in order to collect information on the various web pages such as, but not limited to, which optional objects may be associated with a web page, which slots the optional objects may be assigned, the value of each object to the owner of the content server, the time of the day in which an object may be presented, etc.
[0089] Among other tasks, manager module 264 may define the operation mode of CAS 200. It may determine whether to work in a learning (training) mode or in ongoing mode, for example. Further, it may get monitoring reports from PMM 266 and generate a decision as to whether the current predictive models are valid, need tuning or need replacing. Manager module 264 may further communicate with the administrator of ACD 150 (FIG. 1 ) in order to deliver reports or gather information on new pages, expired pages, etc.
[0090] On a configurable schedule, manager module 264 may be adapted to scan the AST 215 and identify any inactive sections. An exemplary scanning period may be in the range of few minutes to a few hours. An inactive section is a section that the time period between the last received request (the time associated with the last entry of the section) and the scanning time is longer than a certain configurable value. Manger module 264 may sort the entries of each inactive section according to their associated web page. Each identified entry in the inactive section may be copied into the ELOG 242 that is associated with the PDC 240 and assigned to the specific web page. After the data of the inactive entries of AST 215 has been copied, the inactive entries may be released. More information on the operation of Manager module 264 is disclosed below in conjunction with FIGS. 3A & 3B .
[0091] An exemplary PMB 262 may be operable to create a plurality of predictive models wherein each predictive model may be associated with an object that may be presented in a certain web page. A predictive model may include one or more predictive formulas. In order to calculate a predictive formula, an exemplary PMB 262 may use a known predictive algorithm such as, but not limited to, logistic regression, linear regression, decision tree analysis, etc. Further, some exemplary embodiments of PMB 262 may use stepwise methods while calculating the predictive formula. An exemplary predictive model may include one or more predictive factors wherein each set of values of the predictive factor may be associated with a coefficient in a predictive formula. Exemplary value sets may be a list of values or a range values. The coefficient may represent the effect of a predictive factor on the prediction that the relevant content object will be selected by a surfer. Exemplary predictive factors may be such as, but not limited to, the day in the week, the hour, the browser type, the number of visits to the site, the content object that is presented in another selecting button in the same web page, the time from the last visit, a surfer's attribute, a content object attribute, etc.
[0092] PMB 262 may use one or more sets of properties which can be used during the preparation of the predictive model. Each set of properties may be composed of a set of parameters that can be used while preparing a prediction model. An exemplary parameter may be an “aging” parameter that assigns a weight to an entry based on its age. Other parameters may define the minimum number of appearances required for a predictive factor to be considered relevant. Another parameter may define the minimum predictive score value required for a predictive model to be processed further.
[0093] The process of preparing an object's prediction model may include organizing the raw data from success and fail ODB 249 into an object's table. Each entry from the ODBs 249Ns & 249Nf is copied into a row (record) in the object's table. The rows are sorted by time, regardless of success indication. Each column in the object's table may be associated with a parameter of the record, which is stored in the row. Exemplary columns may be the weight of the record (the weight may reflect the decreased value of the ODB from which the record was copied), the result, success or failure designation, or various predictive factors that are stored in the relevant record. Exemplary predictive factors may include relevant URL keys that were embedded within the associated information that was stored in the record wherein some of the URL keys may include attributes of the requested web page such as behavioral information values In some embodiments, the cookie may include one or more attributes of a surfer and those attributes may be associated with certain columns in the object's table. The object's table may be divided into a validation table and a training table. The training table may be referred as an analyzing table.
[0094] After organizing the object's table, a bin creating process may be initiated. A bin may be a set of values of a certain predictive factor that differs from the other sets by a certain variance in prediction efficiency. When the predictive factor is nominally scaled, then a bin may be a list of names. When the predictive factor is ordinarily scaled, then the set of values may be an interval of values. The certain variance may be a parameter in the set of properties. The overall prediction efficiency of a bin may be calculated as the percentage of success compare to the total number of records in the training table that belong to the same set (the same bin), while taking into account the weight of the records when the bin is true and when the bin is false.
[0095] An exemplary bin may be the time interval between 8:00 am to 2:00 pm, for example. A bin table is created based on the training table by dividing each column of the training table into one or more bins (each bin represented by a column in the bin table). Each cell in the bin's table may represent a true or false value. The value may be “true” if the value in the relevant cell in the training table is in the bin's interval and false if the value in the relevant cell in the training table is not in the bin's interval.
[0096] In addition, a legend may be associated with the bin's table. The legend may define the predictive factor from which the bin was processed, the interval that the bin includes and the predictive efficiency of the bin. The process of creating a bin's table is repeated per each set of properties.
[0097] The bin's table and its legend may be loaded into a predictive. The calculated predictive model that was created based on the first set of properties is stored. PMB 262 may repeat the steps of creating a second bin's table and a second predictive model based on the second set of properties. The second predictive model may be stored as well and PMB 262 may continue the process for the remaining property sets.
[0098] When a set of predictive models is calculated, one per each set of properties, each one of the predictive models is applied to the records of the validation table. The results of the predictions are compared with the actual recorded responses of surfers and a prediction score is granted to the predictive model. An exemplary prediction score may be the percentage of the successful predictions, when compared to the actual recorded responses, out of the total records in the validation table. The group of calculated predictive models, one per each set of properties, may be sorted according to the respective prediction scores. The models having a score below a predetermined minimum (one of the parameters in a set of properties) may be ignored. Then an object prediction model is calculated as a weighted average of the predictive models having prediction scores above the predetermined minimum.
[0099] In order to reduce the number of ignored prediction models, another exemplary PMB 262 may further process the comparison between the prediction results of the different models in order to adjust the associated property sets. For example, if one or more predictive models have a prediction score below the limit and use property sets in which the half-life time constant has a large value, the value may be adjusted to a smaller one.
[0100] PMB 262 may repeat the above described process for each one of the possible objects in a certain web page and then it may repeat this process for each web page. In an alternate embodiment of the present invention, MPM 260 may comprise a plurality of PMB 262. Each PMB 262 may be associated with a web page, for example. More information on the operation of PMB 262 is disclosed below in conjunction with FIGS. 9A & 9B .
[0101] An exemplary PMM 266 monitors the plurality of predictive models wherein each predictive model may be associated with an object that can be presented in a certain web page. PMM 266 may be adapted to monitor the performance of each one of the object's prediction models that are currently used by CAS 200. Per each web page, an exemplary PMM 266 may periodically monitor the ELOG 242 of the PDC 240 that is assigned to the current monitored web page. The period between consecutive monitoring may be a configurable period that depends on the mode of operation of CAS 200. In “learning” mode (training mode), the configurable time period, Tmt, may range from a few minutes to tens of minutes. During “ongoing” mode, the configurable period, Tmo, may be tens of minutes to a few hours, for example.
[0102] Per each object that may be associated with the web page, PMM 266 may scan the records in ELOG 242 looking for records in which a delivered web page presents the relevant object to be selected by a surfer. Each found record may be subsequently parsed in order to determine whether the record was executed by a “common” surfer (a surfer for whom the object was presented as a result of using the object's prediction module) or a “control” surfer (a surfer for whom the object was selected randomly to be presented). The record may be further parsed in order to determine the response of a surfer, whether the object was selected by a surfer (success) or not (failure). At the end of the process, PMM 266 may calculate two probability values per each object's prediction model, i.e. the probability of success of a “common” surfer and/or the probability of success of a “control” surfer. The two probability values per each object's prediction model in the web page may be written in a web page comparison table. The web page comparison table may be transferred to the manager module 264 and/or PMB 262. After processing the records stored in ELOG 242, an indication may be sent to OMM 246 of the same PDC 240 informing the OMM 246 that it may initiate the process of transferring the information from ELOG 242 to OHDB 248.
[0103] At this point, PMM 266 may repeat the process for the next web page and continue in a loop. In an alternate embodiment of the present invention, MPM 260 may comprise a plurality of PMM 266 wherein each PMM 266 may be assigned to a web page. More information on the operation of PMM 266 is disclosed below in conjunction with FIG. 8 .
[0104] FIGS. 3A & 3B depict a flowchart illustrating relevant processes of an exemplary method 300 used by some embodiments of the present invention for managing the operation of CAS 200 (FIG. 2 ). Method 300 may be implemented within the manager module 264 (FIG. 2 ), for example. Method 300 may be initialized 302 after upon “power on” status and may run in a loop as long as the CAS 200 is active. During the initialization process 302 & 304, the manager 264 may be loaded with configurable information such as information on relevant resources that stand for the internal modules of CAS 200. Accordingly, the manager 264 may allocate resources to the other modules such as PRM 220, PDC 240, POSM 250, etc. The AST 215 (FIG. 2 ) may be created and introduced to the appropriate modules. The clock of CAS 200 may be adjusted. Further, the clock may use a proprietary format. For example, the clock may count minutes in continuous mode from 00:00 of the first day of January until 23:59 of December 31. In alternate embodiments, the clock may be reset every six months, etc.
[0105] After setting the internal models, the manager 264 may get updated information from the content servers 152 and/or the administrator of ACD 150 (FIG. 1 ) such as, but not limited to, information related to a web page, optional objects that may be presented, optional slots (redirection buttons or links), priorities and the value of each object, etc.
[0106] At the end of the initiation process, MLFH 230 (FIG. 2 ) may be instructed 306 to treat all responses (ML files) as if each was associated with a “control” surfer. In response, MLFH 230 may randomly select objects to be placed and presented in a requested web page. Other modules such as PRM 220, OMM 246 and PMM 266 (FIG. 2 ) may be instructed to work in a “learning” or “training” mode. During the learning mode, PRM 220 may mark all surfers as “control” surfers. Further, OMM 246 and PMM 266 may operate at higher rates than when the embodiment is in “ongoing” mode. Stage timer (ST) is reset and used to define the time limit of the current mode of operation.
[0107] At such point, method 300 may wait 310 until the value of ST reaches a configurable value predefined to correspond to the “Learning Period”. The “Learning Period” may be in the range of few tens of minutes to a few days, depending on the volume of requests sent toward ACD 150 (FIG. 1 ), for example. If 310 the ST reached the value of the “Learning Period,” then PMB 262 (FIG. 2 ) may be checked 312 in order to determine if 320 it was successful in preparing a set of predictive models for objects. If the set is not ready, method 300 may inform 322 an administrator of ACD 150 (FIG. 1 ) about the number of cycles of the “Learning Period” that were completed without success. In such a case, ST may be reset and method 300 looped to step 310.
[0108] If 320 a set of object's predictive models is ready, then the set is loaded 324 into POSM 250. Other internal modules such as PRM 220, MLFH 230, OMM 246, PMB 262, OSP 255 and PMM 266 (FIG. 2 ) may be instructed to change mode into a “monitoring” mode (period). The monitoring mode is used for tracking the individual predictive models. During the monitoring mode, PRM 220 designates a certain percentage (a configurable number in the range of 5% to 50%, for example) of surfers as “control” surfers. PMM 266 may compare the probability of success of control surfers to the probability of success of the common surfers and create a set of comparison tables, one per each object's predictive model. The comparison tables may be used by manager 264 (FIG. 2 ) in order to determine the performance of each set of object's predictive models.
[0109] In an alternate embodiment of the present invention, the monitoring mode may be implemented on a page level and not on an object level. In such an embodiment, the two counters, ST and a model's lifetime counter, are reset. The model's lifetime counter may be used for defining the overall time limit or maximum age of the predictive models. A typical, and exemplary, maximum age may be 24 hours, for example.
[0110] Then method 300 waits 330 until the value of ST reaches a configurable value predetermined to define the “Monitor Period.” The “Monitor Period” may be in the range of few tens of minutes to a few hours, depending on the volume of requests which were sent toward ACD 150 (FIG. 1 ), for example. If 330 the ST reached the value of the “Monitor Period,” then PMM 266 (FIG. 2 ) may be requested to deliver a set of web page comparison tables, one per each web page 332. A web page comparison table may comprise the two probability values per each object's prediction model that may be assigned to a given web page. The two probability values may represent the probability of success of a common surfer and the probability of success of a control surfer.
[0111] In some embodiments of the present invention, in which the monitoring mode is implemented at a page level, the probability values may be calculated at such level. In such an embodiment, a success of a page may be defined as responding to one of the presented objects. In some cases, each observation may be weighed by the percentage of the utility value of the selected object from the utility value of the page itself. The manager module 264 (FIG. 2 ) may process the results from the table and compare them to a predefined set of values that are stipulated by the administrator of ACD 150 (FIG. 1 ). If 334 the results of the predictive models are better than the required values, then method 300 proceeds to step 340 in FIG. 3B . If 334, in the alternative, the results are below the stipulated performance threshold, then PMB 262 (FIG. 2 ) may be adjusted 336 accordingly. The set of properties which were used for calculating the predictive model may be adjusted, for example. In addition, an indication may be sent to the administrator and method 300 may return to step 306.
[0112] FIG. 3B depicts the ongoing operation mode of method 300. At step 340, PRM 220, MLFH 230, OMM 246, PMB 262, OSP 255 and PMM 266 (FIG. 2 ) may be instructed to change mode into an ongoing mode while the performance of the loaded sets of object's predictive models, one set per each web page, is monitored and ST is reset. During the ongoing mode, PRM 220 designates a small percentage of surfers as control surfers. PMM 266 may compare the probability of success of control surfers to the probability of success of common surfers and create a set of comparison tables, one per each object's predictive model. The comparison tables may be used by manager 264 (FIG. 2 ) for determining the performance of the sets of the object's predictive models.
[0113] Method 300 may wait 342 until the value of ST reaches a configurable value predefined to correlate with the “Ongoing Period.” The “Ongoing Period” may be in the range of a few tens of minutes to a few days, depending on the volume of requests which were sent toward ACD 150 (FIG. 1 ), for example. When 342 the ST reaches the value of the “Ongoing Period,” then PMM 266 (FIG. 2 ) may be requested to deliver a set of web page comparison tables, one per each web page. The manager module 264 (FIG. 2 ) may subsequently process the results in the table and compare them to a predefined set of values that are stipulated by the administrator of ACD 150 (FIG. 1 ) 344. If 350 the results of the predictive models exceed the required values, then the predictive models may be considered as valid and method 300 proceeds to step 354. If 350 the results are below the required performance, then the predictive models may be considered as not valid and method 300 returns 362 to step 306 (FIG. 3 a) for calculating new sets of object's predictive models.
[0114] At step 354, the value of the model's lifetime counter is checked and a determination is made 360 as to whether the value is below a configurable value Tmax. Exemplary Tmax may be a few hours to a few days, for example. If 360 the value is below Tmax, which would indicate that the sets of object's predictive models are still valid, then the ST counter may be reset 364 and method 300 returned to step 342. If the value of the lifetime counter is above Tmax, then method 300 may proceed to step 362 and returned to step 306 (FIG. 3 a) to initiate calculation of a new set of predictive models.
[0115] FIG. 4 illustrates a flowchart with relevant processes of an exemplary method 400 that may be used for handling surfer's requests that are sent toward content servers 152 (FIG. 1 ). Method 400 may be implemented within the PRM 220 (FIG. 2 ), for example, and initialized 402 by the manager module 264 during the “power on” process each time the manager determines to change the mode of operation of CAS 200 (learning, monitoring and ongoing). After initiation, method 400 may run in a loop as long as the mode is not changed. During the initialization process 402, PRM 220 may be loaded with information that is relevant for communicating with other internal modules of CAS 200, modules such as the manager 264 and AST 215 (FIG. 2 ). In addition, accessory counters that are used by PRM 220 may be initialized, counters such as a sample counter (SCNT) and control counter (CCNT). Two parameters, N1 and N2, are loaded according to the mode of operation. N1 may define a portion of sampled surfers (a sampled surfer is a surfer upon whose behavior the predictive models are based) out of the total number of surfers. N2 may define the portion of control surfers out of the total number of surfers. In addition, AST 215 may be initialized.
[0116] After the initiation stage, method 400 may start processing surfer's requests that are transferred via HTTP proxy 210 (FIG. 2 ) to a queue of PRM 220. The next request in the queue is fetched 404 and parsed in order to identify any attached cookie. If 410 the request does not include a cookie (a new surfer), an ID is allocated to the new surfer and method 400 proceeds to step 412 for handing the request of the new surfer. If 410 a cookie is found, exemplary embodiments of the present invention may decompress 430 and parse the cookie (assuming the cookie is compressed). In other exemplary embodiments, in which compression is not used, any identified cookie is just parsed without prior decompression. Once parsed, a cookie is searched for a requester ID and, according to the ID, the AST 215 (FIG. 2 ) is searched 432 for a section that is associated with the ID. If 432 a section in the active session table AST 215 (FIG. 2 ) was not found, then method 400 proceeds to step 412. If 432 a session in the active session table AST 215 (FIG. 2 ) was found, indicating that the request is associated with a current active surfer having at least one recent request served by CAS 200, then method 400 proceeds to step 440 and continues serving the active surfer.
[0117] At step 412, the first request of a new active surfer his handled. In the case that the mode of operation is one other than a learning mode, then the sampled counter (SCNT) and control counter (CCNT) are incremented by one. In the case that the current mode is a learning mode, the SCNT is disabled and a new section in AST 215 (FIG. 2 ) is allocated to the new active surfer. Subsequently, the new section in AST 215 is associated with the allocated requester's ID. In the new section, an entry is allocated for the current request. At this point, method 400 starts writing the information associated with the request to the appropriate fields of the allocated entry. The associated information may include, for example, the receipt time according to the clock of CAS 200, the URL which is associated with the request, the source IP and the destination IP of the request, etc. In some exemplary embodiments of the present invention, the URL may include one or more fields that reflect attributes of the requested webpage. Exemplary attributes may be the topic of the page (vacation, news, sports, etc.).
[0118] The decompressed cookie, if it exists, is updated or a new cookie may be written. The cookie may include behavioral information associated with the surfer such as the date and time of the surfer's last visit to the web page, the frequency of visits by the surfer to the web page, etc.
[0119] Other behavioral information may include one or more counters wherein each counter may count the number of events of a certain type. Exemplary counters may count the number of the active surfer's visits to the relevant website, the number of requests for a certain web page from the website, the number of times a certain offer (content object) was selected, etc. Updating the counters may be time dependent Such that the value of the counter may decrease over time, as previously described. In some embodiments, the cookie may include labels for a surfer's attributes. Exemplary attributes may be a surfer's age, gender, hobbies, etc. The updated information of the cookie is stored in the appropriate fields of the entry in AST 215.
[0120] After writing the appropriate information into the allocated entry in AST 215, a determination is made 420 as to whether the operating mode is a learning mode and\or whether SCNT value is smaller than N1. If 420 one or both of the determinations are found to be true, then method 400 proceeds to step 422. If 420 the operating mode is other than learning mode or SCNT value is equal to or greater than N1, then the sample field in the associated entry (in AST 215) is set as “true” 426 in order to indicate that the current active surfer is selected to be a sampled. A sampled surfer is a surfer upon whose behaviors the predictive models are based and whose decisions may be analyzed by PDC 240, PMM 266 and PMB 262 (FIG. 2 ), for example. Typically, an N1 value that is associated with the monitoring period is smaller than an N1 value that is associated with the ongoing mode. Consequently, the portion of the sampled surfers in the monitoring period is likely to be larger than the sampled portion during the ongoing mode. The value is a configurable value and may be in the range of a few hundred to a few tens of thousands of surfers depending on the traffic through CAS 200.
[0121] After setting the sampled field in the entry of AST 215, the SCNT is reset and method 400 proceeds to step 456 in which the requester ID is written in the cookie of the request and the request is transferred toward its destination (one of the servers 152 in FIG. 1 ) via the http proxy 210 (FIG. 2 ). Method 400 returns to step 404 for processing the next request.
[0122] If 420 the operating mode is a learning mode and\or SCNT is smaller than N1, then a determination is made 422 as to whether CCNT is equal to N2. If 422 yes, the control field in the associated entry is set 424 to indicate that the current active surfer is selected to be a control surfer. A control surfer is a surfer upon whose behavior the predictive models are not implemented, i.e. the objects to be presented to a control surfer are selected randomly. Later, a surfer's decisions are sampled and may be analyzed by PDC 240, PMM 266 and PMB 262 (FIG. 2 ), for example. The N2 value that is associated with a learning mode is set to 1 and, consequently, each surfer is designated as a control surfer.
[0123] In the monitoring period, the value of N2 is smaller than the value of N2 that is associated with the ongoing mode. Consequently, the portion of the control surfers in a monitoring period is larger than the control portion during the ongoing mode. The value of N2 is a configurable value and may be in the range of a few hundreds to a few tens of thousands of surfers depending on the traffic via CAS 200.
[0124] After setting the control field in the entry of AST 215, the CCNT is reset 424 and method 400 proceeds to step 456. In the case 422 that the CCNT is not equal to N2, than method 400 proceeds to step 456.
[0125] In an alternate exemplary embodiment of the present invention, defining a surfer as a sampled surfer may be executed after receiving a surfer's response. In such an embodiment, a surfer that responded positively may be defined as a sampled surfer and the SCNT may be reset. One of the reasons for using this sorting method is to increase the size of the positive samples, since the positive samples are less populated than non-responding surfers.
[0126] Returning now to step 432, if a section that is associated with the requester's ID exists, then a surfer's section in AST 215 (FIG. 2 ) is retrieved 440 and parsed. The requester's section in AST 215 is searched for an entry that is associated with a previously delivered page (PDP) that points to the current requested object. If such an entry is found, then a success indication is written in association with the requested object and redirection button (slot) combination. The success indication is marked in a response field associated with the combination of the specific object and slot of the entry that includes the PDP that prompted the current requested object. While processing the information that is stored in the AST, object and slot combinations that do not have a success indication may be referred to as failures. Next, a new entry in the section is allocated for storing information that is relevant to the current received request. The information associated with the request is written into the appropriate fields of the new entry. The decompressed cookie is updated written to the appropriate fields of the new entry, as disclosed above in conjunction with step 412. Notably, in some embodiments the cookie may include an indication of a surfer's attribute, while the URL may include an indication on attributes of the requested web page.
[0127] After writing the information in the new entry, the URL that is associated with the request is parsed 442 in order to determine whether the current request originated from a web page that was recently sent via CAS 200 as a response to a recently received request from the particular surfer. Presumably, such a web page included an object and slot combination which reflects the URL that is associated with the current received request. Therefore, the entries that belong to the same surfer's section, and are associated with recently received requests and delivered web pages, are parsed 442 looking for an entry in which the configuration of the web page reflects the associated URL. This entry may be associated with a previously delivered page (PDP) that was sent recently toward the surfer.
[0128] If 450 such an entry is found, then a success indication is written 452 in the result field that is associated with the object and slot combination of the URL associated with the current request. At such point, method 400 proceeds to step 456. If 450 a PDP is not found, method 400 proceeds to step 456.
[0129] FIG. 5 illustrates a flowchart with relevant processes of an exemplary method 500 that may be used for managing a page data collector module (PDC) 240 (FIG. 2 ). Method 500 may be implemented within the OMM 246 (FIG. 2 ), for example. Method 500 may be initialized 502 by the manager module 264 (FIG. 2 ) during the “power on” process. After initialization, method 500 may run in a loop as long as CAS 200 is active. Method 500 may be used for transferring the stored data from ELOG 242 (FIG. 2 ) to OHDB 248 (FIG. 2 ) while keeping the integrity of the sampled data as a representative sample of a surfers' behavior.
[0130] During the initialization process 502 & 504, OMM 246 may be loaded with information that is relevant for communicating with other internal modules of CAS 200 such as the manager 264, PMM 266, ELOG 242, (FIG. 2 ) etc. In addition, information is retrieved from manger module 264 (FIG. 2 ). The retrieved information may be relevant to the web page, which is associated with the PDC 240 that includes the relevant OMM 246. The information may include the objects that may be associated with the web page and the slots in by which the objects may be presented. Timers, such as the OMM timer (OT), may be reset.
[0131] After the initiation process, a determination is made 506 as to whether the current operating mode is a learning mode (training mode). If not a learning mode, method 500 may wait 507 for an indication from PMM 266, in which PMM 266 may inform OMM 246 that the data, which is stored in the current ELOG 242, was inspected and that OMM 246 may start transferring the data from the ELOG 242 toward OHDB 248 (FIG. 2 ). When 507 an indication is received, method 500 may proceed to step 509. If 506 the operating mode is a learning mode, then method 500 may wait until OT is greater than Telog 508. Telog may be a configurable parameter in the range of a few tens of seconds to a few tens of minutes, for example. When OT is greater than Telog, method 500 proceeds to step 509.
[0132] At step 509 a new ELOG 242 is allocated 509 for storing the future events that are related to the relevant web page and method 500 begins processing and transferring the stored data from the old ELOG 242 into OHDB 248. A loop from step 510 to step 520 may be initiated and each cycle in the loop may be associated with an optional object that may be presented over the relevant web page.
[0133] At step 512, the oldest sub-ODB in each one of the ODB couples associated with the current object, object “a” for example which comprises the success ODB 249as and the failure ODB 249af, are released and a new sub-ODB is allocated for storing data that is transferred from the old ELOG 242 that is related to the current object. The old ELOG 242 (FIG. 2 ) is searched for entries that include the current object. The result field in each entry is parsed and the entries are divided into two groups, a success group (having a success indication) and a failure group (do not have a success indication). The entries in each group may be sorted by time such that the newest entry appears at the top of the group, for example, and the total number of each group calculated. The portion of the entries from each group that may be stored in the appropriate new sub-ODB is calculated 514 by dividing the number of entries in each one of the appropriate new sub-ODB (success or failure) by the total number of entries in each group (success or failure, respectively). If at least one of the groups has a portion value smaller than one, meaning that some of the entries of the group will be dropped in lieu of being stored in the new sub-ODB, then the smallest portion value may be selected for determining the number of entries from each group (success or failure) that will be stored in the appropriate sub-ODB (success or failure, respectively).
[0134] The total number of entries in each group is multiplied by the smallest portion value for determining the numbers of entries (NE) from each group that will be stored in the appropriate new sub-ODB. NE entries from the top (the newest entries) of each group are copied 516 to the appropriate sub-ODB. If for both groups the portion values are greater than “one,” then all the entries of each group (success or failure) may be copied to the appropriate new sub-ODB (success or failure, respectively). The portion value of the deletion per each group (success and failure) may be recorded in association with the success ODB 249as-ns and the failure ODB 249af-nf (respectively). In some exemplary embodiments of the present invention, old entries in the success ODB 249as-ns and the failure ODB 249af-nf may be released only when there is no free space available for storage of new observations.
[0135] After copying 516 the entries to the new sub-ODB, a determination is made 520 as to whether additional objects may be presented in the relevant web page. If yes, method 500 may start a new cycle in the loop for the next object and return to step 510. If 520 there are no more objects, then the old ELOG 242 is released 522, timer OT is reset, and method 500 returns to step 506.
[0136] FIG. 6 illustrates a flowchart with relevant processes of an exemplary method 600 that may be used for handling web pages, in the form of markup language files (an HTML, for example), which is sent from one of the content servers 152 (FIG. 1 ) in response to a surfer's requests. Method 600 may be implemented within the MLFH 230 (FIG. 2 ), for example. Method 600 may be initialized 602 by the manager module 264 (FIG. 2 ) during the “power on” process. After initialization, method 600 may run in a loop as long as CAS 200 (FIG. 2 ) is active. During the initialization process 602, MLFH 230 may be loaded with information that is relevant for communicating with other internal modules of CAS 200, modules such as the manager 264, the plurality of POSM 250 and AST 215 (FIG. 2 ).
[0137] After the initiation stage, method 600 may start processing received web pages that are transferred via HTTP proxy 210 (FIG. 2 ) to a queue of MLFH 230. The next packet in the queue is fetched 604 and parsed in order to determine whether a cookie is attached. If a cookie is found, the cookie is furthered processed and the requester ID, which is written in the cookie, is retrieved. AST 215 is searched for a section that is associated with the requester ID. The last entry in the requester's section is retrieved and parsed to identify the fields that define a surfer's type, i.e. sampled, common or control. In addition, the page ID is defined by parsing the header of the received web page.
[0138] If 610 a surfer is designated as a control surfer, then at step 612, based on the web page ID, a list of optional objects and a list of slots in the web page are fetched. Per each slot, an optional object is selected randomly and method 600 proceeds to step 622.
[0139] If 610 the requester of the web page is not designated as a control surfer, then a POSM 257 is selected 614 based on the page ID. The entry number in AST 215 that is associated with the request for the given web page is transferred to a queue of the selected POSM 257. Method 600 may wait 620 until a decision from the relevant POSM 250 is received that identifies the web page configuration that has the highest probability of prompting an active surfer to respond through the selection of one of the optional objects. The identified configuration may include a list of slot and object combinations that have the highest associated probabilities. Then method 600 proceeds to step 622.
[0140] At step 622, either the identified configuration of the web page or the randomly selected configuration of the web page, having a set of object and slot combinations, is written 622 to the appropriate fields in the relevant entry of AST 215. The HTML file is modified to include the selected one or more objects, each object being associated with an appropriate slot. The updated cookie, which was prepared by PRM 220 and stored in the entry, is compressed and added as a cookie to the modified ML file. The requester's ID is also added and associated with the cookie. The modified ML file with the cookie is transferred to HTTP proxy 210 and sent toward the destination of the ML file of the requester surfer. Method 600 returns to step 604 and starts processing a new received ML file.
[0141] In an alternate embodiment, the set of pairs in the configuration may influence the design of a web page. In such an embodiment, a pair may include a design feature in lieu of a slot and the value of the design feature in lieu of the object. Exemplary design features may be background color, font size, font type, etc. Exemplary corresponding values may be red, 12 points, Times New Roman, etc.
[0142] FIG. 7 illustrates a flowchart with relevant processes of an exemplary method 700 that may be used for calculating the prediction value for each optional configuration (set of optional-object and slot combinations) from a plurality of optional configurations of a delivered web page. The prediction value may represent the probability that the requester of the delivered web page will respond (select one of the presented objects) while observing the delivered web page. Method 700 may be implemented within the OSP 255 (FIG. 2 ), for example. Method 700, at a selected POSM 257 that is associated with a delivered web page, may be initialized 702 upon receipt of an entry number in AST 215 (FIG. 2 ). The entry is associated with the request for the delivered web page that is currently processed (step 614, FIG. 6 ) by MLFH 230 (FIG. 2 ).
[0143] After initiation, method 700 may fetch 704 the entry from AST 215 that is associated with the request for this delivered web page. The entry may be parsed and a plurality of predictive factors retrieved from the associated information, behavioral information, and grouping information (if such exists). Exemplary predictive factors that may be retrieved from the associated information stored at the entry may include the receipt time of the request, the URL keys associated with the request, etc. Exemplary predictive factors that may be retrieved from the behavioral information may include the elapsed time from the last visit of the requester in ACD 150 (FIG. 1 ), the number of positive responses from the requester, etc. Exemplary grouping information may include indications on a surfer's attribute such as, but not limited to, gender, age, purchasing habits, etc. Further, the indication may be coded in a code which is unknown to CAS 200 (FIG. 2 ). Moreover, the predictive factors may be stored in PFB 253 (FIG. 2 ) of the POSM 250 that is associated with the delivered web page.
[0144] The optional configurations of the requested web page are calculated. A configuration may define a set of the slots, in which an optional object may be presented, and a selected optional object that is presented in each slot (Slot/Optional-object). Usually, an exemplary web page has a certain amount of slots and a certain amount of optional-objects such that the number of possible configurations may be defined. The optional configurations may include all possible combinations of slots and objects, for example. A table of prediction values may be allocated 704 for storing the calculated prediction value for each optional configuration.
[0145] An exemplary table of prediction values may include a plurality of entries. Each entry may be associated with an optional configuration of the delivered web page. Further, each entry may include a plurality of fields and each field may be associated with a specific slot number with an additional field defining the predicted value of each configuration. Each cell (a junction of a configuration and a slot number) in the table may include the calculated prediction value of the object that is assigned to the slot in that configuration, wherein the calculation of the predictive value is done in view of the rest of the slots and optional-objects in the configuration. The prediction value of the configuration may be the sum of the predictive values of each one of the slot fields in this entry.
[0146] In some exemplary embodiments of the present invention, the number of optional configurations may be calculated once, during the initialization of POSM 250 or upon receiving information on changes in the associated web page. In such case, an exemplary table of prediction values may be defined once and allocated again and again each time the relevant web page is delivered.
[0147] After allocating the table of prediction values, a loop between steps 710 to 740 may be initiated to process all the possible configurations of the web page written in the allocated table. For each configuration, an internal loop is initiated between steps 720 to 730. The internal loop may be executed per each slot of the configuration. An OPM 257a-n (FIG. 2 ) that is associated with an object that was assigned to a first slot of a first configuration in the table is fetched 722. Relevant predictive factors included in the model are retrieved 722 from PFB 253 and placed in the appropriate location in the model. The model is adapted to reflect the configuration. Therefore, if the model has one or more variables that reflect the configuration (objects in the other slots, etc.), then those variables are defined as true or false depending on the configuration.
[0148] Then the predictive value of the object that is associated with the first slot of the first configuration is calculated 724 by executing the model. Next, the calculated predictive value is written in the table's cell at the junction of the first configuration and the first slot and a decision is made 730 as to whether there are additional slots in the configuration. If so, method 700 returns to step 720 and starts the loop for the next slot (a second slot, etc.) in the first configuration. The loop may continue to the third slot and so on until there 730 are no more slots in the configuration. Then, the predictive value of the configuration is calculated 732 by averaging the predictive value of each slot, for example.
[0149] At step 740, a determination is made as to whether there are additional optional configurations in the table. If yes, method 700 returns to step 710 and starts the loop for the next configuration (a second configuration, etc) in the table. The loop may continue for the third configuration and so on until there 740 are no more configurations to be processed.
[0150] After calculating 740 the predictive value of all the possible configurations of the web page, an optimal configuration is selected 742. Notably, as previously disclosed, the prediction value also reflects the benefit that the owner of CAS 200 will get when a surfer responds to the presented web page via the selection of one of the optional objects. The configuration with the highest predictive value may be defined as the preferred configuration. This preferred configuration, and its predictive value, may be stored 744 in the entry of AST 215 (FIG. 2 ) and delivered to MLFH 230 (FIG. 2 ). At this point, method 700 may be terminated 746. Method 700 may be initiated again upon receiving a next delivered web page that is associated with POSM 250.
[0151] FIG. 8 illustrates a flowchart depicting relevant processes of an exemplary method 800 that may be used for monitoring the performance of the current predictive models of a certain web page. Method 800 may be implemented within the PMM 266 (FIG. 2 ), for example.
[0152] Method 800 may be initialized 802 by the manager module 264 (FIG. 2 ) during the “power on” process. After initiation, method 800 may run in a loop as long as CAS 200 is active. Method 800 may be used for monitoring the results of the stored data at ELOG 242 (FIG. 2 ), which is assigned to the certain web page being currently monitored, before transferring it to OHDB 248 (FIG. 2 ). After processing the records stored in ELOG 242, an indication may be sent to OMM 246 of the PDC 240, which is assigned to the web page that is currently monitored. The indication may inform the OMM 246 that it may start the process of transferring the information from ELOG 242 to OHDB 248. In addition, the results of the evaluation may be transferred to the manager module 264 and/or PMB 262. After monitoring the results of one web page, PMM 266 (FIG. 2 ) may proceed to the next web page and so on. In an alternate embodiment of the present invention, PMM 266 may execute a plurality of processes 800 in parallel, one per each web page.
[0153] After initiation, a timer Tm is reset 804 and the current mode of operation, which is defined by the manager module 264 (FIG. 2 ), is determined. If 810 the operating mode is a “learning” (training) mode, then method 800 may wait until the end of the learning period. If 810 the operating mode is a “monitoring” mode, then method 800 may wait 814 until the value of timer Tm is greater than a configurable value Tmm. Tmm may be in the range of a few minutes to a few tens of minutes, for example. If 810 the operating mode is an “ongoing” mode, then method 800 may wait 816 until the value of timer Tm is greater than a configurable value Tmo. Tmo may be in the range of a few tens of minutes to a few hours, for example.
[0154] When timer Tm reaches the value of Tmm or Tmo, depending on the operating mode, a web page comparison table is allocated 820. The web page comparison table may have two entries wherein one may be assigned to the average utility of the control surfer while the other may be assigned to the average utility of the common surfer.
[0155] At step 836, the ELOG is scanned and the average utilities of the control surfer and the common surfer are calculated. The results may be written in the web page comparison table at the appropriate entry that is assigned to the relevant surfer.
[0156] The web page comparison table is transferred 842 to the manager module 264 (FIG. 2 ). Timer Tm is reset and indication is sent to OMM 246 (FIG. 2 ) of the PDC 240, which is assigned to the relevant web page. In response, OMM 246 may start transferring the information from ELOG 242 to OHDB 248 as previously disclosed. At such point, method 800 may return to step 810 and, based on the current mode of operation, may proceed per the methodologies previously disclosed.
[0157] FIGS. 9A & 9B illustrate a flowchart depicting relevant processes of an exemplary method 900 that may be used for creating a new set of object's predictive models, one per each optional-object that may be associated with a web page that is served by CAS 200 (FIG. 2 ). Method 900 may be implemented within the predictive model builder (PMB) 262 (FIG. 2 ), for example.
[0158] Method 900 may be initialized 902 by the manager module 264 (FIG. 2 ) each time a new set of predictive models is needed. During the initialization process 904, PMB 262 may allocate resources that may be needed for calculation of the predictive models. Information, or memory pointers to information, needed while processing the predictive models may be retrieved. Required counters may be reset. Furthermore, a counter may be used as an index.
[0159] When the initial step 904 is completed, an external loop between steps 910 and 960 (FIG. 9 b) is initiated. Each cycle in the external loop is associated with an optional-object (an alternative object) that may be associated with a web page. At step 912, counter N is incremented by one, indicating the object's number that is currently handled in the current cycle of the loop. The two historical DBs of the object N, 249Ns (success) and 249Nf (failure) (FIG. 2 ), are processed and a decreased weight per each ODB is calculated based on the deleted portion that was associated to the ODB by OMM 246 (FIG. 2 ) during the transfer of records from ELOG 242 (FIG. 2 ) to the ODBs, as previously disclosed above in conjunction with step 516 (FIG. 5 ).
[0160] The raw data from the success and failure ODB 249Ns & 249Nf are organized 914 into an object's table. Each entry from the ODBs 249Ns & 249Nf is copied into a line in the table. The lines are sorted by time, independent of any success indication. The newest record may be stored at the top of the object's table while the oldest record may be stored at the bottom of the object's table, but it should be understood that choice of storage organization should not limit the scope of the invention.
[0161] Each record in the table, i.e. line, has a plurality of columns (fields). Each column may be associated with a factor of the record, which is stored in the record. Exemplary columns may be designated to represent the weight of the record (the weight may reflect the decreased weight of the ODB from which the record was copied), the result, success or failure (not success), relevant URL keys that were embedded within the associated information that was stored in the record, attributes indication on the web page and/or the object, etc. Additional columns may reflect the values of behavioral information, which is stored in the record. Other columns may represent information such as counters and timers that were stored in the cookie associated with the request, indications of attributes associated with a surfer that that were stored in the cookie, etc.
[0162] The associated information may be the receiving time of the request that is written in the record, the URL that was associated with the request, information regarding the configuration of the web page from which the request was selected, etc. Each cell at the junction of a column and a row may store the URL key's value if it exists, missing key indication if the record does not include the key, or a missing value indication if the record includes the key but no value, for example. Each cell in the junction of a behavioral information factor and a line (record) may store the value of a relevant counter, timer, etc. which are associated with the column.
[0163] The object's table may be searched 914 for irrelevant keys (few instances), for example. Irrelevant keys may be defined as keys that have a small number of records (lines) in which the key has a value. The minimum number of records may be a configurable value in the range of a few tens to a few thousands, depending on the volume of data stored in the ODB 249, for example. The minimum number of records may be one of the properties that are stored in a set of properties, for example. A column of irrelevant keys may be removed from the object's table. The object's table may be divided into two tables: a validation table including the newer records and a training table with the older records. Usually, the training table includes more records than the validation table. The validation table may be used later for determining the quality of the predictive models or the score of the model.
[0164] The training table is further processed 916 in order to calculate the predictive model of the object. The type of the columns in the training table may be defined. Defining the type may be executed by observing the key in view of a plurality of syntax protocols and determining whether the value of the key complies with one or more of those protocols. Next, the type is defined based on the protocol.
[0165] Exemplary protocols may be Internet protocols (IP), text protocols, time protocols, etc. If the value of the key does not comply with any of the protocols, it may be defined as “other.” Exemplary types may included IP, time, text, other, etc. Types of columns that are associated with behavioral information are known and may include counters and timers, for example. After defining the type of the keys, the type of the value of each key may be defined. Exemplary types of values may be scale, ordinal, nominal, cyclic, etc.
[0166] In some exemplary embodiments, method 900 may further process the training table in order to identify columns that may be divided into two or more. For example, a time column may be divided into multiple columns representing days, hours, and minutes. An IP address may be divided into four columns, etc. Each sub-column (a portion of a predictive factor) may be referred to as a predictive variable or a predictive key.
[0167] When the raw data is organized in the training table, method 900 starts converting 916 key values that are not ordinal into ordinal values. A value of a text column (a certain string of text) may be converted into an ordinal number that reflects its frequency (number of appearances along the column). A nominal number or a cyclic number may be converted into an ordinal number that reflects the influence of the nominal value on the result of a record (success or failure).
[0168] At this point, the training table is ready to be further processed such that each column (a predictive variable/factor/key) is converted into one or more bins and the training table converted overall into a bins table. The bins table is further processed for determining a predictive model per each set of properties. A middle loop from step 920 to 950 (FIG. 9 b) may be initiated. Each cycle in the loop is associated with a set of properties. Each set of properties may define and comprise a set of parameters that may be used while preparing a predictive model.
[0169] An exemplary parameter may be relative aging weight. Other parameters may define the minimum number of appearances of a certain key, a number below which a key may be considered as irrelevant. Another parameter may define the minimal value of a predictive score that a predictive model may get in order to be used. Yet another parameter may define the half-life-time constant of a record, etc.
[0170] The value of M counter is incremented 922 by one indicating the ID number of the set of properties that is associated with the current cycle of the loop. The appropriate set of properties is fetched and parsed and, according to its properties, an equivalent weight per each line may be defined. The equivalent weight may reflect the decreased weight which is due to the result of the record's (line) success or failure, age, the benefit that is created to the owner of CAS 200 (FIG. 2 ) if the object is selected, etc. After defining the equivalent weight, method 900 proceeds to step 930 (FIG. 9B ) and initiates the internal loop between steps 930 to 940.
[0171] Each cycle in the internal loop is associated with a column, i.e. a predictive variable. The range of the ordinal values written in the column is divided 932 into one or more sub-intervals (bins) according to the ability to predict the success. Dividing the range of the values of the column into bins may be executed in several methods. One exemplary method may divide the interval into a configurable number of equal intervals (units). The number of units (the resolution) may be a few units to a few tens of units, for example. The resolution may be one of the properties that are included in a set of properties, for example. A predictive score per each interval unit, along the interval of the values of the current column, may be calculated by dividing the weighted number of success records by the total weighted number of records, which have an ordinal value of the predictive variable (column), in the current interval unit.
[0172] The one or more bins may be created 932 by grouping one or more adjacent interval units into one bin, wherein the variance between the rates of success of the adjacent interval units is below a certain value, i.e. a variance threshold. The variance threshold may have a configurable value and may be one of the properties that are stored in a set of properties, for example. After creating one or more bins for each predictive variable (column), a rate of success is calculated for the bin. The rate of success is calculated as the weighted number of success records divided by the weighted total number of records. Information on the bins (information on its predictive variable, the bin's interval, etc.) along with associated prediction scores is stored in a bins legend. Then, a determination is made 940 as to whether the training table includes more columns (predictive variables). If 940 yes, method 900 returns to step 930 and starts a new cycle in the internal loop for dividing the next predictive variable (a next column, in the training table) into one or more bins.
[0173] If 940 there are no more columns, then a bins table is created 942. The bins table may have the same number of lines as in the training table and a column per each bin. In each cell, at the junction of a line (record) and a bin (column), a binary value, true or false, may be written depending on the value of the relevant predictive variable.
[0174] In another exemplary embodiment of method 900, step 942 may include a validation process. An exemplary validation process may repeat the loop from step 930 to 940 on the records that are stored in the validation table. If the bins that were created by processing the validation table are similar to the bins that were created by processing the training table, then the bins may be considered as valid and method 900 may proceed to step 944. If not, one or more properties in the current set of properties may be slightly modified. For example, the resolution of the range of a certain column may be reduced. Then, the loop from step 930 to 940 may be repeated twice with the modified set of parameters. During the first repetition a second set of bins is calculated using the records stored in the training table. During the second repetition, the second set is validated by using the validation table. The validation process may have one or more cycles. In some exemplary embodiments the bins validation table may have other records than the validation table that is used for validating the predictive models.
[0175] Yet another exemplary embodiment of method 900 may respond to non valid sets of bins by marking the set of properties as a problematic one and may jump to step 950, skipping the stage of calculating a predictive model according to the problematic set of parameters. In yet another embodiment, a set of bins may be ignored entirely.
[0176] The bins table and the bins legend is transferred 944 toward a predictive model engine. The predictive model engine may implement, over the bins table, a statistical algorithm such as, but not limited to, logistic regression, linear regression, decision tree analysis, etc. The calculated predictive model that was created is stored as a prediction model (N;M). The N stands for the optional-object for which the model was calculated and the M stands for the set of properties that was used for calculating the model.
[0177] At step 950, a determination is made as to whether there are more sets of properties. If yes, method 900 returns to step 920 (FIG. 9 a) and starts a new cycle for creating an additional predictive model, for the object N, based on the next set of properties (M+1). If 950 there are no more sets of properties, then an object's predictive model N is calculated 952 as an equivalent model of the M models that were calculated and stored in step 944.
[0178] An exemplary predictive model (N:M) may include one or more constants, one or more predictive variables that are derived from associated information, each having an associated coefficient, one or more predictive variables that are derived from behavioral information, each having an associated coefficient, one or more web page configuration variables that reflect objects in the other slots, each having an associated coefficient.
[0179] In some embodiments, additional predictive variables may be used. For example, one or more predictive variables that are derived from web page attributes, surfer's attributes, or object attributes may be included. Exemplary constants may be a result of the regression process (an arithmetic constant), for example. Another constant may reflect the benefit of selecting the object M. Exemplary predictive variables that are derived from associated information may be the day, the browser type, etc. An exemplary predictive variable that is derived from the behavioral information stored in the cookie may be the number of visits to a certain page, etc. An exemplary web page configuration variable may be object X in slot Y, for example.
[0180] An exemplary calculation of a predictive value of an object may be executed based on the following formula:
[0181]
[0182] The relevant coefficients are the coefficients that are associated with variables that are true for a received request.
[0183] An exemplary method 900 may execute 952 the M models of the optional-object N on the records that are stored in the validation table. The M models may be executed on each record in the validation table that includes the object M in a web page configuration that was sent as a response to the request that initiated the record. After performing the M models on the validation table, a predictive fitness score is calculated per each model. In an alternate embodiment of the present invention, the records that are stored in the validation table plus the records that are stored in the training table may be used in step 952.
[0184] PMB 262 may select 952 a group of calculated predictive models out of the M models that have the best scores. Then, the object N predictive model may be calculated as a representative model of the group of the best models. Calculating the representative model may be executed by calculating an average value per each coefficient. The average may be weighted by the predictive score of the selected best models, for example. The representative model may be stored as “object N ready to be used predictive model”.
[0185] At step 960, a decision is made whether there are additional optional-objects that may be associated with the relevant web page. If yes, method 900 returns to step 910 and start the external loop for calculating a prediction model for a next object (M+1). If there are no more objects, Manager module 264 (FIG. 2 ) may be informed that a set of object's predictive models for that web page are ready 962 and method 900 may be terminated 964. Method 900 may be initiated again for handling a second web page. In an alternate embodiment of the present invention, several processes 900 may be executed in parallel, one per each web page.
[0186] In the description and claims of the present application, each one of the verbs, “comprise”, “include” and “have”, and conjugates thereof, are used to indicate that the object or objects of the verb are not necessarily a complete listing of members, components, elements, or parts of the subject or subjects of the verb.
[0187] In this application the words “unit” and “module” are used interchangeably. Anything designated as a unit or module may be a stand-alone unit or a specialized module. A unit or a module may be modular or have modular aspects allowing it to be easily removed and replaced with another similar unit or module. Each unit or module may be any one of, or any combination of, software, hardware, and/or firmware. Software of a logical module may be embodied on a computer readable medium such as but not limited to: a read/write hard disc, CDROM, Flash memory, ROM, etc. In order to execute a certain task, a software program may be downloaded to an appropriate processor as needed.
[0188] The present invention has been described using detailed descriptions of embodiments thereof that are provided by way of example and are not intended to limit the scope of the invention. The described embodiments comprise different features, not all of which are required in all embodiments of the invention. Some embodiments of the present invention utilize only some of the features or possible combinations of the features. Variations of embodiments of the present invention that are described and embodiments of the present invention comprising different combinations of features noted in the described embodiments will occur to persons of the art.
[0189] It will be appreciated by persons skilled in the art that the present invention is not limited by what has been particularly shown and described herein above. Rather the scope of the invention is defined by the claims that follow.
Claims
What is claimed is:
1. A computer-implemented method, comprising:
receiving, by a computing device, a plurality of requests for a web page from a plurality of sources, wherein the web page includes a configuration defining one or more objects presented with the web page, wherein each object is associated with a separate predictive model including one or more predictive factors, wherein the one or more predictive factors are determined using the plurality of received requests, wherein the one or more predictive factors are used to calculate a predictive value, and wherein a predictive value corresponds to a likelihood that an object will be selected by any one of the plurality of sources when presented in the configuration of the web page;
retrieving predictive information related to the plurality of requests;
determining one or more predictive factors for an object presented with the web page, wherein the one or more predictive factors are determined using the retrieved predictive information;
dividing one or more of the predictive factors into one or more bins, wherein each bin includes a range of predictive factor values, wherein each bin is defined by a prediction efficiency of the range of predictive values within a bin, and wherein prediction efficiency relates to an ability to predict whether an object will be selected;
creating a bins table for the object, wherein the bins table includes the one or more bins;
generating a predictive model for the object using the bins table, wherein the generated predictive model is associated with the object;
receiving a subsequent request for the web page from a source, wherein the subsequent request is received after the plurality of requests, and wherein the subsequent request includes subsequent predictive information;
retrieving the predictive model associated with the object;
retrieving one or more predictive factors for the object, wherein the one or more predictive factors are associated with the subsequent predictive information;
determining a predictive value for the object using the generated predictive model, wherein the predictive value is determined by inputting the one or more retrieved predictive factors; and
selecting the object for inclusion in the configuration of the web page, wherein the object is selected using the predictive value.
2. The method of claim 1, wherein generating the predictive model includes performing logistic regression, linear regression, or decision tree analysis.
3. The method of claim 1, wherein the predictive information includes behavioral information and information associated with the request for the web page.
4. The method of claim 3, wherein the behavioral information includes a time of one or more previous visits in a domain that includes the requested web page, a time that the web page was last requested, a number of visits in the domain, a number of times that the object has been presented, or a number of times that the object has been selected.
5. The method of claim 4, wherein the behavioral information is stored in a cookie.
6. The method of claim 3, wherein the information associated with the request for the web page includes a receipt time of the request, a uniform resource locator key associated with the request, an internet protocol address, or a type of browser application.
7. The method of claim 1, wherein the predictive model for the object is generated using a property set selected from a group of property sets, wherein the property set includes one or more parameters associated with the object.
8. The method of claim 7, further comprising:
generating a predictive model for each property set in the group of property sets to create a group of predictive models.
9. The method of claim 8, wherein the predictive model for the object is generated from the group of predictive models.
10. A system, comprising:
a processor; and
a non-transitory computer-readable storage medium containing instructions configured to cause the processor to perform operations including:
receiving a plurality of requests for a web page from a plurality of sources, wherein the web page includes a configuration defining one or more objects presented with the web page, wherein each object is associated with a separate predictive model including one or more predictive factors, wherein the one or more predictive factors are determined using the plurality of received requests, wherein the one or more predictive factors are used to calculate a predictive value, and wherein a predictive value corresponds to a likelihood that an object will be selected by any one of the plurality of sources when presented in the configuration of the web page;
retrieving predictive information related to the plurality of requests;
determining one or more predictive factors for an object presented with the web page, wherein the one or more predictive factors are determined using the retrieved predictive information;
dividing one or more of the predictive factors into one or more bins, wherein each bin includes a range of predictive factor values, wherein each bin is defined by a prediction efficiency of the range of predictive values within a bin, and wherein prediction efficiency relates to an ability to predict whether an object will be selected;
creating a bins table for the object, wherein the bins table includes the one or more bins;
generating a predictive model for the object using the bins table, wherein the generated predictive model is associated with the object;
receiving a subsequent request for the web page from a source, wherein the subsequent request is received after the plurality of requests, and wherein the subsequent request includes subsequent predictive information;
retrieving the predictive model associated with the object;
retrieving one or more predictive factors for the object, wherein the one or more predictive factors are associated with the subsequent predictive information;
determining a predictive value for the object using the generated predictive model, wherein the predictive value is determined by inputting the one or more retrieved predictive factors; and
selecting the object for inclusion in the configuration of the web page, wherein the object is selected using the predictive value.
11. The system of claim 10, wherein the predictive information includes behavioral information and information associated with the request for the web page.
12. The system of claim 11, wherein the behavioral information includes a time of one or more previous visits in a domain that includes the requested web page, a time that the web page was last requested, a number of visits in the domain, a number of times that the object has been presented, or a number of times that the object has been selected.
13. The system of claim 12, wherein the behavioral information is stored in a cookie.
14. The system of claim 11, wherein the information associated with the request for the web page includes a receipt time of the request, a uniform resource locator key associated with the request, an internet protocol address, or a type of browser application.
15. A computer-program product, tangibly embodied in a non-transitory machine-readable medium, including instructions configured to cause a data processing apparatus to:
receive a plurality of requests for a web page from a plurality of sources, wherein the web page includes a configuration defining one or more objects presented with the web page, wherein each object is associated with a separate predictive model including one or more predictive factors, wherein the one or more predictive factors are determined using the plurality of received requests, wherein the one or more predictive factors are used to calculate a predictive value, and wherein a predictive value corresponds to a likelihood that an object will be selected by any one of the plurality of sources when presented in the configuration of the web page;
retrieve predictive information related to the plurality of requests;
determine one or more predictive factors for an object presented with the web page, wherein the one or more predictive factors are determined using the retrieved predictive information;
divide one or more of the predictive factors into one or more bins, wherein each bin includes a range of predictive factor values, wherein each bin is defined by a prediction efficiency of the range of predictive values within a bin, and wherein prediction efficiency relates to an ability to predict whether an object will be selected;
create a bins table for the object, wherein the bins table includes the one or more bins;
generate a predictive model for the object using the bins table, wherein the generated predictive model is associated with the object;
receive a subsequent request for the web page from a source, wherein the subsequent request is received after the plurality of requests, and wherein the subsequent request includes subsequent predictive information;
retrieve the predictive model associated with the object;
retrieve one or more predictive factors for the object, wherein the one or more predictive factors are associated with the subsequent predictive information;
determine a predictive value for the object using the generated predictive model, wherein the predictive value is determined by inputting the one or more retrieved predictive factors; and
select the object for inclusion in the configuration of the web page, wherein the object is selected using the predictive value.
16. The computer-program product of claim 15, wherein the predictive information includes behavioral information stored in a cookie and information associated with the request for the web page.
17. The computer-program product of claim 16, wherein the behavioral information includes a time of one or more previous visits in a domain that includes the requested web page, a time that the web page was last requested, a number of visits in the domain, a number of times that the object has been presented, or a number of times that the object has been selected, and wherein the information associated with the request for the web page includes a receipt time of the request, a uniform resource locator key associated with the request, an internet protocol address, or a type of browser application.
Patent Citations (509)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4881261(A) | 1989-11-01 | Oliphant et al. | Applicant |
| US5187735(A) | 1993-02-01 | Herrero Garcia et al. | Applicant |
| US5206903(A) | 1993-04-01 | Kohler et al. | Applicant |
| US5208748(A) | 1993-05-01 | Flores et al. | Applicant |
| US5235519(A) | 1993-08-01 | Miura | Applicant |
| US5239462(A) | 1993-08-01 | Jones et al. | Applicant |
| US5262941(A) | 1993-11-01 | Saladin et al. | Applicant |
| US5289371(A) | 1994-02-01 | Abel et al. | Applicant |
| US5319542(A) | 1994-06-01 | King et al. | Applicant |
| US5351186(A) | 1994-09-01 | Bullock et al. | Applicant |
| US5372507(A) | 1994-12-01 | Goleh | Applicant |
| US5375055(A) | 1994-12-01 | Togher et al. | Applicant |
| US5387783(A) | 1995-02-01 | Mihm et al. | Applicant |
| US5450537(A) | 1995-09-01 | Hirai et al. | Applicant |
| US5517405(A) | 1996-05-01 | McAndrew et al. | Applicant |
| US5563805(A) | 1996-10-01 | Arbuckle et al. | Applicant |
| US5572643(A) | 1996-11-01 | Judson | Applicant |
| US5581702(A) | 1996-12-01 | McArdle et al. | Applicant |
| US5583763(A) | 1996-12-01 | Atcheson et al. | Applicant |
| US5590038(A) | 1996-12-01 | Pitroda | Applicant |
| US5592378(A) | 1997-01-01 | Cameron et al. | Applicant |
| US5611052(A) | 1997-03-01 | Dykstra et al. | Applicant |
| US5636346(A) | 1997-06-01 | Saxe | Applicant |
| US5664115(A) | 1997-09-01 | Fraser | Applicant |
| US5668953(A) | 1997-09-01 | Sloo | Applicant |
| US5678002(A) | 1997-10-01 | Fawcett et al. | Applicant |
| US5694163(A) | 1997-12-01 | Harrison | Applicant |
| US5696907(A) | 1997-12-01 | Tom | Applicant |
| US5699526(A) | 1997-12-01 | Siefert | Applicant |
| US5704029(A) | 1997-12-01 | Wright | Applicant |
| US5710887(A) | 1998-01-01 | Chelliah et al. | Applicant |
| US5715402(A) | 1998-02-01 | Popolo | Applicant |
| US5724155(A) | 1998-03-01 | Saito | Applicant |
| US5724522(A) | 1998-03-01 | Kagami et al. | Applicant |
| US5727048(A) | 1998-03-01 | Hiroshima et al. | Applicant |
| US5727163(A) | 1998-03-01 | Bezos | Applicant |
| US5732400(A) | 1998-03-01 | Mandler et al. | Applicant |
| US5745654(A) | 1998-04-01 | Titan | Applicant |
| US5748755(A) | 1998-05-01 | Johnson et al. | Applicant |
| US5758328(A) | 1998-05-01 | Giovannoli | Applicant |
| US5760771(A) | 1998-06-01 | Blonder et al. | Applicant |
| US5761640(A) | 1998-06-01 | Kalyanswamy et al. | Applicant |
| US5761649(A) | 1998-06-01 | Hill | Applicant |
| US5764916(A) | 1998-06-01 | Busey et al. | Applicant |
| US5765142(A) | 1998-06-01 | Allred et al. | Applicant |
| US5774869(A) | 1998-06-01 | Toader | Applicant |
| US5774870(A) | 1998-06-01 | Storey | Applicant |
| US5774882(A) | 1998-06-01 | Keen et al. | Applicant |
| US5774883(A) | 1998-06-01 | Andersen et al. | Applicant |
| US5778164(A) | 1998-07-01 | Watkins et al. | Applicant |
| US5784568(A) | 1998-07-01 | Needham | Applicant |
| US5793365(A) | 1998-08-01 | Tang et al. | Applicant |
| US5794207(A) | 1998-08-01 | Walker et al. | Applicant |
| US5796393(A) | 1998-08-01 | MacNaughton et al. | Applicant |
| US5797133(A) | 1998-08-01 | Jones et al. | Applicant |
| US5799151(A) | 1998-08-01 | Hoffer | Applicant |
| US5805159(A) | 1998-09-01 | Bertram et al. | Applicant |
| US5806043(A) | 1998-09-01 | Toader | Applicant |
| US5812769(A) | 1998-09-01 | Graber et al. | Applicant |
| US5815663(A) | 1998-09-01 | Uomini | Applicant |
| US5818907(A) | 1998-10-01 | Mahoney et al. | Applicant |
| US5819029(A) | 1998-10-01 | Edwards et al. | Applicant |
| US5819235(A) | 1998-10-01 | Tamai et al. | Applicant |
| US5819236(A) | 1998-10-01 | Josephson | Applicant |
| US5819291(A) | 1998-10-01 | Haimowitz et al. | Applicant |
| US5825869(A) | 1998-10-01 | Brooks et al. | Applicant |
| US5826241(A) | 1998-10-01 | Stein et al. | Applicant |
| US5826244(A) | 1998-10-01 | Huberman | Applicant |
| US5828839(A) | 1998-10-01 | Moncreiff | Applicant |
| US5832465(A) | 1998-11-01 | Tom | Applicant |
| US5835087(A) | 1998-11-01 | Herz et al. | Applicant |
| US5838682(A) | 1998-11-01 | Dekelbaum et al. | Applicant |
| US5838910(A) | 1998-11-01 | Domenikos et al. | Applicant |
| US5839117(A) | 1998-11-01 | Cameron et al. | Applicant |
| US5850517(A) | 1998-12-01 | Verkler et al. | Applicant |
| US5852809(A) | 1998-12-01 | Abel et al. | Applicant |
| US5857079(A) | 1999-01-01 | Claus et al. | Applicant |
| US5859974(A) | 1999-01-01 | McArdle et al. | Applicant |
| US5862330(A) | 1999-01-01 | Anupam et al. | Applicant |
| US5866889(A) | 1999-02-01 | Weiss et al. | Applicant |
| US5870721(A) | 1999-02-01 | Norris | Applicant |
| US5878403(A) | 1999-03-01 | DeFrancesco et al. | Applicant |
| US5895454(A) | 1999-04-01 | Harrington | Applicant |
| US5903641(A) | 1999-05-01 | Tonisson | Applicant |
| US5907677(A) | 1999-05-01 | Glenn et al. | Applicant |
| US5911135(A) | 1999-06-01 | Atkins | Applicant |
| US5916302(A) | 1999-06-01 | Dunn et al. | Applicant |
| US5918014(A) | 1999-06-01 | Robinson | Applicant |
| US5924082(A) | 1999-07-01 | Silverman et al. | Applicant |
| US5930776(A) | 1999-07-01 | Dykstra et al. | Applicant |
| US5940811(A) | 1999-08-01 | Norris | Applicant |
| US5940812(A) | 1999-08-01 | Tengel et al. | Applicant |
| US5943416(A) | 1999-08-01 | Gisby | Applicant |
| US5943478(A) | 1999-08-01 | Aggarwal et al. | Applicant |
| US5945989(A) | 1999-08-01 | Freishtat et al. | Applicant |
| US5948061(A) | 1999-09-01 | Merriman et al. | Applicant |
| US5950179(A) | 1999-09-01 | Buchanan et al. | Applicant |
| US5956693(A) | 1999-09-01 | Geerlings | Applicant |
| US5958014(A) | 1999-09-01 | Cave | Applicant |
| US5960411(A) | 1999-09-01 | Hartman et al. | Applicant |
| US5963625(A) | 1999-10-01 | Kawecki et al. | Applicant |
| US5963635(A) | 1999-10-01 | Szlam | Applicant |
| US5966699(A) | 1999-10-01 | Zandi | Applicant |
| US5970475(A) | 1999-10-01 | Barnes et al. | Applicant |
| US5970478(A) | 1999-10-01 | Walker et al. | Applicant |
| US5974396(A) | 1999-10-01 | Anderson | Applicant |
| US5974446(A) | 1999-10-01 | Sonnenreich et al. | Applicant |
| US5987434(A) | 1999-11-01 | Libman | Applicant |
| US5991740(A) | 1999-11-01 | Messer | Applicant |
| US5995947(A) | 1999-11-01 | Fraser et al. | Applicant |
| US6000832(A) | 1999-12-01 | Franklin et al. | Applicant |
| US6003013(A) | 1999-12-01 | Boushy | Applicant |
| US6009410(A) | 1999-12-01 | LeMole et al. | Applicant |
| US6014644(A) | 2000-01-01 | Erickson | Applicant |
| US6014645(A) | 2000-01-01 | Cunningham | Applicant |
| US6014647(A) | 2000-01-01 | Nizzari | Applicant |
| US6016504(A) | 2000-01-01 | Arnold et al. | Applicant |
| US6026370(A) | 2000-02-01 | Jermyn | Applicant |
| US6028601(A) | 2000-02-01 | Machiraju et al. | Applicant |
| US6029141(A) | 2000-02-01 | Bezos et al. | Applicant |
| US6029149(A) | 2000-02-01 | Dykstra et al. | Applicant |
| US6029890(A) | 2000-02-01 | Austin et al. | Applicant |
| US6044146(A) | 2000-03-01 | Gisby et al. | Applicant |
| US6044360(A) | 2000-03-01 | Picciallo | Applicant |
| US6049784(A) | 2000-04-01 | Weatherly et al. | Applicant |
| US6052447(A) | 2000-04-01 | Golden | Applicant |
| US6052730(A) | 2000-04-01 | Felciano | Applicant |
| US6055573(A) | 2000-04-01 | Gardenswartz et al. | Applicant |
| US6058428(A) | 2000-05-01 | Wang et al. | Applicant |
| US6061658(A) | 2000-05-01 | Chou et al. | Applicant |
| US6064987(A) | 2000-05-01 | Walker et al. | Applicant |
| US6070149(A) | 2000-05-01 | Tavor et al. | Applicant |
| US6073112(A) | 2000-06-01 | Geerlings | Applicant |
| US6076100(A) | 2000-06-01 | Cottrille et al. | Applicant |
| US6078892(A) | 2000-06-01 | Anderson et al. | Applicant |
| US6084585(A) | 2000-07-01 | Kraft et al. | Applicant |
| US6085126(A) | 2000-07-01 | Mellgren, III et al. | Applicant |
| US6085195(A) | 2000-07-01 | Hoyt et al. | Applicant |
| US6088686(A) | 2000-07-01 | Walker et al. | Applicant |
| US6105007(A) | 2000-08-01 | Norris | Applicant |
| US6112190(A) | 2000-08-01 | Fletcher et al. | Applicant |
| US6119101(A) | 2000-09-01 | Peckover | Applicant |
| US6119103(A) | 2000-09-01 | Basch et al. | Applicant |
| US6131087(A) | 2000-10-01 | Luke et al. | Applicant |
| US6131095(A) | 2000-10-01 | Low et al. | Applicant |
| US6134318(A) | 2000-10-01 | O'Neil | Applicant |
| US6134530(A) | 2000-10-01 | Bunting et al. | Applicant |
| US6134532(A) | 2000-10-01 | Lazarus et al. | Applicant |
| US6134533(A) | 2000-10-01 | Shell | Applicant |
| US6138139(A) | 2000-10-01 | Beck et al. | Applicant |
| US6141653(A) | 2000-10-01 | Conklin et al. | Applicant |
| US6144991(A) | 2000-11-01 | England | Applicant |
| US6163607(A) | 2000-12-01 | Bogart et al. | Applicant |
| US6167395(A) | 2000-12-01 | Beck et al. | Applicant |
| US6170011(B1) | 2001-01-01 | Macleod Beck et al. | Applicant |
| US6173053(B1) | 2001-01-01 | Bogart et al. | Applicant |
| US6182050(B1) | 2001-01-01 | Ballard | Applicant |
| US6182124(B1) | 2001-01-01 | Lau et al. | Applicant |
| US6185543(B1) | 2001-02-01 | Galperin et al. | Applicant |
| US6189003(B1) | 2001-02-01 | Leal | Applicant |
| US6192319(B1) | 2001-02-01 | Simonson | Applicant |
| US6192380(B1) | 2001-02-01 | Light et al. | Applicant |
| US6199079(B1) | 2001-03-01 | Gupta et al. | Applicant |
| US6202053(B1) | 2001-03-01 | Christiansen et al. | Applicant |
| US6202155(B1) | 2001-03-01 | Tushie et al. | Applicant |
| US6208979(B1) | 2001-03-01 | Sinclair | Applicant |
| US6222919(B1) | 2001-04-01 | Hollatz et al. | Applicant |
| US6236975(B1) | 2001-05-01 | Boe et al. | Applicant |
| US6240396(B1) | 2001-05-01 | Walker et al. | Applicant |
| US6249795(B1) | 2001-06-01 | Douglis | Applicant |
| US6262730(B1) | 2001-07-01 | Horvitz | Applicant |
| US6267292(B1) | 2001-07-01 | Walker et al. | Applicant |
| US6272506(B1) | 2001-08-01 | Bell | Applicant |
| US6282284(B1) | 2001-08-01 | Dezonno et al. | Applicant |
| US6285983(B1) | 2001-09-01 | Jenkins | Applicant |
| US6289319(B1) | 2001-09-01 | Lockwood | Applicant |
| US6292786(B1) | 2001-09-01 | Deaton | Applicant |
| US6295061(B1) | 2001-09-01 | Park et al. | Applicant |
| US6311169(B2) | 2001-10-01 | Duhon | Applicant |
| US6311178(B1) | 2001-10-01 | Bi et al. | Applicant |
| US6324524(B1) | 2001-11-01 | Lent et al. | Applicant |
| US6327574(B1) | 2001-12-01 | Kramer et al. | Applicant |
| US6330546(B1) | 2001-12-01 | Gopinathan et al. | Applicant |
| US6334110(B1) | 2001-12-01 | Walter | Applicant |
| US6338066(B1) | 2002-01-01 | Martin | Applicant |
| US6349290(B1) | 2002-02-01 | Horowitz et al. | Applicant |
| US6356909(B1) | 2002-03-01 | Spencer | Applicant |
| US6374230(B1) | 2002-04-01 | Walker et al. | Applicant |
| US6377936(B1) | 2002-04-01 | Henrick et al. | Applicant |
| US6381640(B1) | 2002-04-01 | Beck | Applicant |
| US6385594(B1) | 2002-05-01 | Lebda et al. | Applicant |
| US6393479(B1) | 2002-05-01 | Glommen et al. | Applicant |
| US6405181(B2) | 2002-06-01 | Lent et al. | Applicant |
| US6438526(B1) | 2002-08-01 | Dykes et al. | Applicant |
| US6449358(B1) | 2002-09-01 | Anisimov | Applicant |
| US6449646(B1) | 2002-09-01 | Sikora et al. | Applicant |
| US6463149(B1) | 2002-10-01 | Jolissaint et al. | Applicant |
| US6477533(B2) | 2002-11-01 | Schiff et al. | Applicant |
| US6507851(B1) | 2003-01-01 | Fujiwara et al. | Applicant |
| US6510418(B1) | 2003-01-01 | Case et al. | Applicant |
| US6510427(B1) | 2003-01-01 | Bossemeyer, Jr. et al. | Applicant |
| US6516421(B1) | 2003-02-01 | Peters | Applicant |
| US6519628(B1) | 2003-02-01 | Locascio | Applicant |
| US6535492(B2) | 2003-03-01 | Shtivelman | Applicant |
| US6542936(B1) | 2003-04-01 | Mayle et al. | Applicant |
| US6546372(B2) | 2003-04-01 | Lauffer | Applicant |
| US6549919(B2) | 2003-04-01 | Lambert et al. | Applicant |
| US6567791(B2) | 2003-05-01 | Lent et al. | Applicant |
| US6571236(B1) | 2003-05-01 | Ruppelt | Applicant |
| US6597377(B1) | 2003-07-01 | MacPhai | Applicant |
| US6606744(B1) | 2003-08-01 | Mikurak | Applicant |
| US6618746(B2) | 2003-09-01 | Desai et al. | Applicant |
| US6622131(B1) | 2003-09-01 | Brown et al. | Applicant |
| US6622138(B1) | 2003-09-01 | Bellamkonda | Applicant |
| US6662215(B1) | 2003-12-01 | Moskowitz et al. | Applicant |
| US6665395(B1) | 2003-12-01 | Busey et al. | Applicant |
| US6671818(B1) | 2003-12-01 | Mikurak | Applicant |
| US6691159(B1) | 2004-02-01 | Grewal et al. | Applicant |
| US6701441(B1) | 2004-03-01 | Balasubramaniam et al. | Applicant |
| US6718313(B1) | 2004-04-01 | Lent et al. | Applicant |
| US6725210(B1) | 2004-04-01 | Key | Applicant |
| US6741995(B1) | 2004-05-01 | Chen | Applicant |
| US6760429(B1) | 2004-07-01 | Hung et al. | Applicant |
| US6766302(B2) | 2004-07-01 | Bach | Applicant |
| US6795812(B1) | 2004-09-01 | Lent et al. | Applicant |
| US6804659(B1) | 2004-10-01 | Graham et al. | Applicant |
| US6826594(B1) | 2004-11-01 | Pettersen | Applicant |
| US6829585(B1) | 2004-12-01 | Grewal et al. | Applicant |
| US6836768(B1) | 2004-12-01 | Hirsch | Applicant |
| US6839680(B1) | 2005-01-01 | Liu | Applicant |
| US6850896(B1) | 2005-02-01 | Kelman et al. | Applicant |
| US6865267(B2) | 2005-03-01 | Dezonno | Applicant |
| US6892347(B1) | 2005-05-01 | Williams | Applicant |
| US6904408(B1) | 2005-06-01 | McCarthy et al. | Applicant |
| US6920434(B1) | 2005-07-01 | Cossette | Applicant |
| US6922705(B1) | 2005-07-01 | Northrup | Applicant |
| US6925441(B1) | 2005-08-01 | Jones | Applicant |
| US6925442(B1) | 2005-08-01 | Shapira et al. | Applicant |
| US6950983(B1) | 2005-09-01 | Snavely | Applicant |
| US6965868(B1) | 2005-11-01 | Bednarek | Applicant |
| US6981028(B1) | 2005-12-01 | Rawat et al. | Applicant |
| US6993557(B1) | 2006-01-01 | Yen | Applicant |
| US7003476(B1) | 2006-02-01 | Samra et al. | Applicant |
| US7039599(B2) | 2006-05-01 | Merriman et al. | Applicant |
| US7051273(B1) | 2006-05-01 | Holt et al. | Applicant |
| US7076443(B1) | 2006-07-01 | Emens et al. | Applicant |
| US7085682(B1) | 2006-08-01 | Heller et al. | Applicant |
| US7092959(B2) | 2006-08-01 | Chen | Applicant |
| US7106850(B2) | 2006-09-01 | Campbell et al. | Applicant |
| US7143063(B2) | 2006-11-01 | Lent et al. | Applicant |
| US7181492(B2) | 2007-02-01 | Wen et al. | Applicant |
| US7200614(B2) | 2007-04-01 | Reid et al. | Applicant |
| US7242760(B2) | 2007-07-01 | Shires | Applicant |
| US7243109(B2) | 2007-07-01 | Omega et al. | Applicant |
| US7251648(B2) | 2007-07-01 | Chaudhuri et al. | Applicant |
| US7287000(B2) | 2007-10-01 | Boyd et al. | Applicant |
| US7313575(B2) | 2007-12-01 | Carr et al. | Applicant |
| US7337127(B1) | 2008-02-01 | Smith et al. | Applicant |
| US7346576(B2) | 2008-03-01 | Lent et al. | Applicant |
| US7346604(B1) | 2008-03-01 | Bharat et al. | Applicant |
| US7346606(B2) | 2008-03-01 | Bharat | Applicant |
| US7370002(B2) | 2008-05-01 | Heckerman et al. | Applicant |
| US7376603(B1) | 2008-05-01 | Mayr et al. | Applicant |
| US7403973(B2) | 2008-07-01 | Wilsher et al. | Applicant |
| US7424363(B2) | 2008-09-01 | Cheng | Applicant |
| US7523191(B1) | 2009-04-01 | Thomas et al. | Applicant |
| US7526439(B2) | 2009-04-01 | Freishtat et al. | Applicant |
| US7536320(B2) | 2009-05-01 | McQueen et al. | Applicant |
| US7552080(B1) | 2009-06-01 | Willard et al. | Applicant |
| US7590550(B2) | 2009-09-01 | Schoenberg | Applicant |
| US7630986(B1) | 2009-12-01 | Herz et al. | Applicant |
| US7657465(B2) | 2010-02-01 | Freishtat et al. | Applicant |
| US7689924(B1) | 2010-03-01 | Schneider et al. | Applicant |
| US7702635(B2) | 2010-04-01 | Horvitz et al. | Applicant |
| US7716322(B2) | 2010-05-01 | Benedikt et al. | Applicant |
| US7734503(B2) | 2010-06-01 | Agarwal et al. | Applicant |
| US7734632(B2) | 2010-06-01 | Wang | Applicant |
| US7739149(B2) | 2010-06-01 | Freishtat et al. | Applicant |
| US7818340(B1) | 2010-10-01 | Warren | Applicant |
| US7827128(B1) | 2010-11-01 | Karlsson et al. | Applicant |
| US7865457(B2) | 2011-01-01 | Ravin et al. | Applicant |
| US7877679(B2) | 2011-01-01 | Ozana | Applicant |
| US7958066(B2) | 2011-06-01 | Pinckney et al. | Applicant |
| US7966564(B2) | 2011-06-01 | Catlin et al. | Applicant |
| US7975020(B1) | 2011-07-01 | Green et al. | Applicant |
| US8010422(B1) | 2011-08-01 | Lascelles et al. | Applicant |
| US8185544(B2) | 2012-05-01 | Oztekin et al. | Applicant |
| US8260846(B2) | 2012-09-01 | Lahav | Applicant |
| US8266127(B2) | 2012-09-01 | Mattox et al. | Applicant |
| US8392580(B2) | 2013-03-01 | Allen et al. | Applicant |
| US2001/0011245(A1) | 2001-08-01 | Duhon | Applicant |
| US2001/0011246(A1) | 2001-08-01 | Tammaro | Applicant |
| US2001/0011262(A1) | 2001-08-01 | Hoyt et al. | Applicant |
| US2001/0011282(A1) | 2001-08-01 | Katsumata et al. | Applicant |
| US2001/0013009(A1) | 2001-08-01 | Greening et al. | Applicant |
| US2001/0014877(A1) | 2001-08-01 | Defrancesco, Jr. et al. | Applicant |
| US2001/0025249(A1) | 2001-09-01 | Tokunaga | Applicant |
| US2001/0027436(A1) | 2001-10-01 | Tenembaum | Applicant |
| US2001/0032140(A1) | 2001-10-01 | Hoffman | Applicant |
| US2001/0032244(A1) | 2001-10-01 | Neustel | Applicant |
| US2001/0034689(A1) | 2001-10-01 | Heilman | Applicant |
| US2001/0054041(A1) | 2001-12-01 | Chang | Applicant |
| US2001/0054064(A1) | 2001-12-01 | Kannan | Applicant |
| US2001/0056405(A1) | 2001-12-01 | Muyres | Applicant |
| US2002/0002491(A1) | 2002-01-01 | Whitfield | Applicant |
| US2002/0004735(A1) | 2002-01-01 | Gross | Applicant |
| US2002/0010625(A1) | 2002-01-01 | Smith et al. | Applicant |
| US2002/0016731(A1) | 2002-02-01 | Kupersmit | Applicant |
| US2002/0023051(A1) | 2002-02-01 | Kunzle et al. | Applicant |
| US2002/0026351(A1) | 2002-02-01 | Coleman | Applicant |
| US2002/0029188(A1) | 2002-03-01 | Schmid | Applicant |
| US2002/0029267(A1) | 2002-03-01 | Sankuratripati et al. | Applicant |
| US2002/0035486(A1) | 2002-03-01 | Huyn et al. | Applicant |
| US2002/0038230(A1) | 2002-03-01 | Chen | Applicant |
| US2002/0045154(A1) | 2002-04-01 | Wood | Applicant |
| US2002/0046086(A1) | 2002-04-01 | Pletz et al. | Applicant |
| US2002/0046096(A1) | 2002-04-01 | Srinivasan et al. | Applicant |
| US2002/0047859(A1) | 2002-04-01 | Szlam et al. | Applicant |
| US2002/0055878(A1) | 2002-05-01 | Burton et al. | Applicant |
| US2002/0059095(A1) | 2002-05-01 | Cook | Applicant |
| US2002/0067500(A1) | 2002-06-01 | Yokomizo et al. | Applicant |
| US2002/0073162(A1) | 2002-06-01 | McElfresh et al. | Applicant |
| US2002/0082923(A1) | 2002-06-01 | Merriman et al. | Applicant |
| US2002/0083095(A1) | 2002-06-01 | Wu et al. | Applicant |
| US2002/0083167(A1) | 2002-06-01 | Costigan et al. | Applicant |
| US2002/0091832(A1) | 2002-07-01 | Low et al. | Applicant |
| US2002/0107728(A1) | 2002-08-01 | Bailey et al. | Applicant |
| US2002/0111850(A1) | 2002-08-01 | Smrcka et al. | Applicant |
| US2002/0123926(A1) | 2002-09-01 | Bushold | Applicant |
| US2002/0161620(A1) | 2002-10-01 | Hatanaka et al. | Applicant |
| US2002/0161664(A1) | 2002-10-01 | Shaya et al. | Applicant |
| US2002/0167539(A1) | 2002-11-01 | Brown et al. | Applicant |
| US2003/0014304(A1) | 2003-01-01 | Calvert et al. | Applicant |
| US2003/0023754(A1) | 2003-01-01 | Eichstadt et al. | Applicant |
| US2003/0029415(A1) | 2003-02-01 | Pfaeffle et al. | Applicant |
| US2003/0036949(A1) | 2003-02-01 | Kaddeche et al. | Applicant |
| US2003/0041056(A1) | 2003-02-01 | Bossemeyer et al. | Applicant |
| US2003/0055778(A1) | 2003-03-01 | Erlanger | Applicant |
| US2003/0110130(A1) | 2003-06-01 | Pelletier | Applicant |
| US2003/0140037(A1) | 2003-07-01 | Deh-Lee | Applicant |
| US2003/0149937(A1) | 2003-08-01 | McElfresh et al. | Applicant |
| US2003/0154196(A1) | 2003-08-01 | Goodwin et al. | Applicant |
| US2003/0167195(A1) | 2003-09-01 | Fernandes et al. | Applicant |
| US2003/0195848(A1) | 2003-10-01 | Felger | Applicant |
| US2003/0217332(A1) | 2003-11-01 | Smith et al. | Applicant |
| US2003/0221163(A1) | 2003-11-01 | Glover et al. | Applicant |
| US2004/0034567(A1) | 2004-02-01 | Gravett | Applicant |
| US2004/0064412(A1) | 2004-04-01 | Phillips et al. | Applicant |
| US2004/0088323(A1) | 2004-05-01 | Elder et al. | Applicant |
| US2004/0128390(A1) | 2004-07-01 | Blakley et al. | Applicant |
| US2004/0153368(A1) | 2004-08-01 | Freishtat et al. | Applicant |
| US2004/0163101(A1) | 2004-08-01 | Swix et al. | Applicant |
| US2004/0167928(A1) | 2004-08-01 | Anderson et al. | Applicant |
| US2004/0193377(A1) | 2004-09-01 | Brown | Applicant |
| US2004/0210820(A1) | 2004-10-01 | Tarr et al. | Applicant |
| US2004/0243539(A1) | 2004-12-01 | Skurtovich et al. | Applicant |
| US2004/0260574(A1) | 2004-12-01 | Gross | Applicant |
| US2005/0004864(A1) | 2005-01-01 | Lent et al. | Applicant |
| US2005/0014117(A1) | 2005-01-01 | Stillman | Applicant |
| US2005/0033728(A1) | 2005-02-01 | James | Applicant |
| US2005/0114195(A1) | 2005-05-01 | Bernasconi | Applicant |
| US2005/0132205(A1) | 2005-06-01 | Palliyil et al. | Applicant |
| US2005/0138115(A1) | 2005-06-01 | Llamas et al. | Applicant |
| US2005/0171861(A1) | 2005-08-01 | Bezos et al. | Applicant |
| US2005/0183003(A1) | 2005-08-01 | Peri | Applicant |
| US2005/0198120(A1) | 2005-09-01 | Reshef et al. | Applicant |
| US2005/0198212(A1) | 2005-09-01 | Zilberfayn et al. | Applicant |
| US2005/0216342(A1) | 2005-09-01 | Ashbaugh | Applicant |
| US2005/0256955(A1) | 2005-11-01 | Bodwell et al. | Applicant |
| US2005/0262065(A1) | 2005-11-01 | Barth et al. | Applicant |
| US2005/0273388(A1) | 2005-12-01 | Roetter | Applicant |
| US2005/0288943(A1) | 2005-12-01 | Wei et al. | Applicant |
| US2006/0015390(A1) | 2006-01-01 | Rijsinghani et al. | Applicant |
| US2006/0021009(A1) | 2006-01-01 | Lunt | Applicant |
| US2006/0026237(A1) | 2006-02-01 | Wang et al. | Applicant |
| US2006/0041476(A1) | 2006-02-01 | Zheng | Applicant |
| US2006/0047615(A1) | 2006-03-01 | Ravin et al. | Applicant |
| US2006/0059124(A1) | 2006-03-01 | Krishna | Applicant |
| US2006/0106788(A1) | 2006-05-01 | Forrest | Applicant |
| US2006/0122850(A1) | 2006-06-01 | Ward et al. | Applicant |
| US2006/0168509(A1) | 2006-07-01 | Boss et al. | Applicant |
| US2006/0253319(A1) | 2006-11-01 | Chayes et al. | Examiner |
| US2006/0271545(A1) | 2006-11-01 | Youn et al. | Applicant |
| US2006/0282327(A1) | 2006-12-01 | Neal et al. | Applicant |
| US2006/0282328(A1) | 2006-12-01 | Gerace et al. | Applicant |
| US2006/0284378(A1) | 2006-12-01 | Snow et al. | Applicant |
| US2006/0288087(A1) | 2006-12-01 | Sun | Applicant |
| US2006/0293950(A1) | 2006-12-01 | Meek et al. | Applicant |
| US2007/0027771(A1) | 2007-02-01 | Collins et al. | Applicant |
| US2007/0027785(A1) | 2007-02-01 | Lent et al. | Applicant |
| US2007/0053513(A1) | 2007-03-01 | Hoffberg | Applicant |
| US2007/0061412(A1) | 2007-03-01 | Karidi et al. | Applicant |
| US2007/0061421(A1) | 2007-03-01 | Karidi | Applicant |
| US2007/0073585(A1) | 2007-03-01 | Apple et al. | Applicant |
| US2007/0094228(A1) | 2007-04-01 | Nevin et al. | Applicant |
| US2007/0100653(A1) | 2007-05-01 | Ramer et al. | Applicant |
| US2007/0100688(A1) | 2007-05-01 | Book | Applicant |
| US2007/0116238(A1) | 2007-05-01 | Jacobi | Applicant |
| US2007/0116239(A1) | 2007-05-01 | Jacobi | Applicant |
| US2007/0162501(A1) | 2007-07-01 | Agassi et al. | Applicant |
| US2007/0239527(A1) | 2007-10-01 | Nazer et al. | Applicant |
| US2007/0250585(A1) | 2007-10-01 | Ly et al. | Applicant |
| US2007/0260596(A1) | 2007-11-01 | Koran et al. | Examiner |
| US2007/0265873(A1) | 2007-11-01 | Sheth et al. | Applicant |
| US2008/0021816(A1) | 2008-01-01 | Lent et al. | Applicant |
| US2008/0033941(A1) | 2008-02-01 | Parrish | Applicant |
| US2008/0040225(A1) | 2008-02-01 | Roker | Applicant |
| US2008/0072170(A1) | 2008-03-01 | Simons | Applicant |
| US2008/0147480(A1) | 2008-06-01 | Sarma et al. | Applicant |
| US2008/0147741(A1) | 2008-06-01 | Gonen et al. | Applicant |
| US2008/0183806(A1) | 2008-07-01 | Cancel et al. | Applicant |
| US2008/0201436(A1) | 2008-08-01 | Gartner | Applicant |
| US2008/0215541(A1) | 2008-09-01 | Li et al. | Applicant |
| US2008/0222656(A1) | 2008-09-01 | Lyman | Applicant |
| US2008/0244024(A1) | 2008-10-01 | Aaltonen et al. | Applicant |
| US2008/0262897(A1) | 2008-10-01 | Howarter et al. | Applicant |
| US2008/0270294(A1) | 2008-10-01 | Lent et al. | Applicant |
| US2008/0270295(A1) | 2008-10-01 | Lent et al. | Applicant |
| US2008/0319778(A1) | 2008-12-01 | Abhyanker | Applicant |
| US2009/0006174(A1) | 2009-01-01 | Lauffer | Applicant |
| US2009/0006179(A1) | 2009-01-01 | Billingsley et al. | Applicant |
| US2009/0006622(A1) | 2009-01-01 | Doerr | Applicant |
| US2009/0030859(A1) | 2009-01-01 | Buchs et al. | Applicant |
| US2009/0055267(A1) | 2009-02-01 | Roker | Applicant |
| US2009/0076887(A1) | 2009-03-01 | Spivack et al. | Applicant |
| US2009/0099904(A1) | 2009-04-01 | Affeld et al. | Applicant |
| US2009/0119173(A1) | 2009-05-01 | Parsons et al. | Applicant |
| US2009/0138606(A1) | 2009-05-01 | Moran et al. | Applicant |
| US2009/0164171(A1) | 2009-06-01 | Wold et al. | Applicant |
| US2009/0177771(A1) | 2009-07-01 | Britton et al. | Applicant |
| US2009/0210405(A1) | 2009-08-01 | Ortega et al. | Applicant |
| US2009/0222572(A1) | 2009-09-01 | Fujihara | Applicant |
| US2009/0240586(A1) | 2009-09-01 | Ramer et al. | Applicant |
| US2009/0287534(A1) | 2009-11-01 | Guo et al. | Applicant |
| US2009/0287633(A1) | 2009-11-01 | Nevin et al. | Applicant |
| US2009/0307003(A1) | 2009-12-01 | Benyamin et al. | Applicant |
| US2009/0319296(A1) | 2009-12-01 | Schoenberg | Applicant |
| US2010/0023581(A1) | 2010-01-01 | Lahav | Applicant |
| US2010/0049602(A1) | 2010-02-01 | Softky | Applicant |
| US2010/0106552(A1) | 2010-04-01 | Barillaud | Applicant |
| US2010/0205024(A1) | 2010-08-01 | Shachar et al. | Applicant |
| US2010/0281008(A1) | 2010-11-01 | Braunwarth | Applicant |
| US2011/0041168(A1) | 2011-02-01 | Murray et al. | Applicant |
| US2011/0055207(A1) | 2011-03-01 | Schorzman et al. | Applicant |
| US2011/0055331(A1) | 2011-03-01 | Adelman et al. | Applicant |
| US2011/0055338(A1) | 2011-03-01 | Loeb et al. | Applicant |
| US2011/0112893(A1) | 2011-05-01 | Karlsson et al. | Applicant |
| US2011/0113101(A1) | 2011-05-01 | Ye et al. | Applicant |
| US2011/0119264(A1) | 2011-05-01 | Hu et al. | Applicant |
| US2011/0138298(A1) | 2011-06-01 | Alfred et al. | Applicant |
| US2011/0161792(A1) | 2011-06-01 | Florence et al. | Applicant |
| US2011/0246406(A1) | 2011-10-01 | Lahav et al. | Applicant |
| US2011/0270926(A1) | 2011-11-01 | Boyd | Applicant |
| US2011/0271175(A1) | 2011-11-01 | Lavi et al. | Applicant |
| US2011/0307331(A1) | 2011-12-01 | Richard et al. | Applicant |
| US2011/0320715(A1) | 2011-12-01 | Ickman et al. | Applicant |
| US2012/0042389(A1) | 2012-02-01 | Bradley et al. | Applicant |
| US2012/0059722(A1) | 2012-03-01 | Rao | Applicant |
| US2012/0136939(A1) | 2012-05-01 | Stern et al. | Applicant |
| US2012/0150973(A1) | 2012-06-01 | Barak | Applicant |
| US2012/0323346(A1) | 2012-12-01 | Ashby et al. | Applicant |
| US2013/0013362(A1) | 2013-01-01 | Walker et al. | Applicant |
| US2013/0036202(A1) | 2013-02-01 | Lahav | Applicant |
| US2013/0132194(A1) | 2013-05-01 | Rajaram | Applicant |
| US2013/0182834(A1) | 2013-07-01 | Lauffer | Applicant |
| US2013/0238714(A1) | 2013-09-01 | Barak et al. | Applicant |
| US2013/0268468(A1) | 2013-10-01 | Vijayaraghavan et al. | Applicant |
| US2013/0275862(A1) | 2013-10-01 | Adra | Applicant |
| US2013/0290533(A1) | 2013-10-01 | Barak et al. | Applicant |
| US2013/0311874(A1) | 2013-11-01 | Schachar et al. | Applicant |
| US2013/0326375(A1) | 2013-12-01 | Barak et al. | Applicant |
| US2013/0336471(A1) | 2013-12-01 | Agarwal et al. | Applicant |
| EP840244(A1) | 1998-05-01 | Applicant | |
| EP1233361(A1) | 2002-08-01 | Applicant | |
| EP1276064(A2) | 2003-01-01 | Applicant | |
| EP1549025(A1) | 2005-06-01 | Applicant | |
| EP1840803(A1) | 2007-10-01 | Applicant | |
| EP1845436(A2) | 2007-10-01 | Applicant | |
| EP1850284(A1) | 2007-10-01 | Applicant | |
| FR2950214(A1) | 2011-03-01 | Applicant | |
| JP9288453(A2) | 1997-11-01 | Applicant | |
| JP2004-054533 | 2004-02-01 | Applicant | |
| KR20040110399(A) | 2004-12-01 | Applicant | |
| KR20050010487(A) | 2005-01-01 | Applicant | |
| KR20080046310(A) | 2008-05-01 | Applicant | |
| KR20080097751(A) | 2008-11-01 | Applicant | |
| WO9722073(A1) | 1997-06-01 | Applicant | |
| WO9845797(A2) | 1998-10-01 | Applicant | |
| WO9909470(A1) | 1999-02-01 | Applicant | |
| WO9922328(A1) | 1999-05-01 | Applicant | |
| WO9944152(A1) | 1999-09-01 | Applicant | |
| WO/57294(A1) | 2000-09-01 | Applicant | |
| WO127825(A1) | 2001-04-01 | Applicant | |
| WO1/35272(A2) | 2001-05-01 | Applicant | |
| WO2/065367(A2) | 2002-08-01 | Applicant | |
| WO3/032146(A1) | 2003-04-01 | Applicant | |
| WO2013/158830(A1) | 2003-10-01 | Applicant | |
| WO2004/057473(A1) | 2004-07-01 | Applicant | |
| WO2005/059777(A1) | 2005-06-01 | Applicant | |
| WO2007/044757(A1) | 2007-04-01 | Applicant | |
| WO2007/129625(A1) | 2007-11-01 | Applicant | |
| WO2008/057181(A2) | 2008-05-01 | Applicant | |
| WO2008/143382(A1) | 2008-11-01 | Applicant | |
| WO2009/029940(A1) | 2009-03-01 | Applicant | |
| WO2010/099632(A1) | 2010-09-01 | Applicant | |
| WO2010/119379(A1) | 2010-10-01 | Applicant | |
| WO2010/144207(A2) | 2010-12-01 | Applicant | |
| WO2011/127049(A1) | 2011-10-01 | Applicant | |
| WO2013/163426(A1) | 2013-10-01 | Applicant |
Non-Patent Literature (168)
- Richardson et al (“Predicting Clicks: Estimating the Click-Through Rate for New Ads” May 2007).Examiner
- Non-Final Office Action of Oct. 30, 2013 for U.S. Appl. No. 13/961,072, 10 pages.Applicant
- Non-Final Office Action of Dec. 5, 2013 for U.S. Appl. No. 12/967,782, 14 pages.Applicant
- Notice of Allowance of Jan. 3, 2014 for U.S. Appl. No. 11/360,530, 29 pages.Applicant
- Chartrand Sabra, “A new system seeks to ease the bottleneck in the customer-service information highway,” The New York Times (Apr. 30, 2001), 2 pages.Applicant
- Just Answer (2004 Faq) Archive.org cache of www.justanswer.com circa (Dec. 2004), 8 pages.Applicant
- Pack Thomas, “Human Search Engines the next Killer app,” (Dec. 1, 2000) Econtent DBS vol. 23; Issue 6, 7 pages.Applicant
- Match.Com “Match.com Launches Match.com Advisors,” PR Newswire (Oct. 14, 2003), 2 pages.Applicant
- Sitel, “Sitel to Provide Live Agent Support Online for Expertcity.com,” PR Newswire (Feb. 28, 2000), 2 pages.Applicant
- Webmaster World, “Link to my website is in a frame with banner ad at the top,” www.webmasterworld.com (Nov. 11, 2003), 2 pages.Applicant
- Bry et al., “Realilzing Business Processes with ECA Rules: Benefits, Challenges, Limits,” Principles and Practice of Sematic Web Reasoning Lecture Notes in Computer Science, pp. 48-62, LNCS, Springer, Berlin, DE (Jan. 2006).Applicant
- Fairisaac, “How SmartForms for Blaze Advisor Works,” www.fairisaac.com 12 pages. (Jan. 2005).Applicant
- Mesbah A et al., “A Component-and Push-Based Architectural Style for Ajax Applications,” The Journal of Systems & Software, 81 (12): pp. 2194-2209, Elsevier North Holland, New York, NY US (Dec. 2008).Applicant
- Oracle Fusion Middleware Administrators Guide for Oracle SOA (Oracle Guide) Suite 11g Release 1 (11.1.1) Part No. E10226-02 www.docs.oracle.com (Oct. 2009), 548 pages.Applicant
- “OAuth core 1.0 Revision A [XP002570263],” OAuth Core Workgroups, pp. 1-27 www.ouath.net/core/1.0a/ (retrieved Jan. 31, 2013), 24 pages.Applicant
- Anon., “AnswerSoft Announces Concerto; First to Combine Call Center Automation with Power of Web,” Business Wire, (Feb. 3, 1997) 3 pages.Applicant
- Emigh, J., “AnswerSoft Unveils Concerto for Web-Based Call Centers Feb. 5, 1996,” Newsbytes, (Feb. 5, 1997) 2 pages.Applicant
- Grigonis, R., “Webphony-It's not Just Callback Buttons Anymore,” Computer Telephony, (Dec. 1997) 4 pages.Applicant
- Wagner, M., “Caring for Customers,” Internet World, (Sep. 1, 1999) 3 pages.Applicant
- Sweat, J., “Human Touch-A New Wave of E-Service Offerings Blends the Web, E-Mail, and Voice Bringing People back into the Picture,” Information week, (Oct. 4, 1999) 2 pages.Applicant
- Kirkpatrick, K., “Electronic Exchange 2000, The, ” Computer Shopper, (Nov. 1999) 5 pages.Applicant
- Anon., “InstantService.com Teams with Island Data to provide Integrated Solution for Online Customer Response,” Business Wire, (May 22, 2000) 3 pages.Applicant
- Kersnar, S., “Countrywide Offers Proprietary Technology for Online Wholesale Lending,” National Mortgage News, vol. 24, No. 38, (Jun. 5, 2000) 2 pages.Applicant
- Douglas Armstrong, Firstar Web site helps add up future, Milwaukee Journal Sentinel, (Mar. 28, 1996) 3 pages.Applicant
- redhat—.com downloaded on Jul. 23, 2006.Applicant
- apache.org downloaded on Jul. 23, 2006.Applicant
- mysql.com downloaded on Jul. 23, 2006.Applicant
- developer.com downloaded on Jul. 23, 2006.Applicant
- Canter, Ronald S., “Lender Beware-Federal Regulation of Consumer Credit”, Credit World, vol. 81, No. 5, pp. 16-20, (May 1993).Applicant
- Staff, “On-Line System Approves Loans While Customer Waits,” Communication News, vol. 31, Issue 9, (Sep. 1994) 3 pages.Applicant
- “Low-Rent Loan Officer in a Kiosk”, Bank Technology News vol. 8 No. 2, p (Feb. 1995) 2 pages.Applicant
- Duclaux, Denise, “A Check for $5,000 in Ten Minutes”, ABA Banking Journal, vol. 87, No. 8, p. 45, AUQ. (1995) 2 pages.Applicant
- “World Wide Web Enhances Customers Choice”, Cards International, No. 143, p. 9, (Nov. 1995) 2 pages.Applicant
- Wells Fargo Launches First Real-Time, Online Home Equity Credit Decision-Making Service, Business Wire, (Jun. 3, 1998), Dialog— File 621: New Product Announcement, 3 pages.Applicant
- Handley, John, “Credit Review Lets the Numbers Do the Talking in Home Mortgage Game”, Chicago Tribune (Jul. 1998) 3 pages.Applicant
- Sherman, Lee, “Wells Fargo Writes a New Online Script”, Interactive Week, vol. 5, No. 31, p. 29, (Aug. 1998) 2 pages.Applicant
- Calvey, Mark, “Internet Gives Bankers a Snappy Comeback”, San Francisco Business Times, vol. 13, No. 5, p. 3 (Sep. 1998) 2 pages.Applicant
- McCormick, Linda, “Users of Credit Scoring Face Tough Rules on Notification”, American Banker, Dialog File 625: American Banker Publications, (Mar. 21, 1982) 2 pages.Applicant
- What the Credit Bureau is Saying About You: If a Mistake Sneaks Into Your Record, You May Not Know About it Until You Get Turned Down for Credit, Changing Times, vol. 37, p. 56, (Jul. 1983) 2 pages.Applicant
- McShane. Peter K., “Got Financing?”, Business Journal Serving Southern Tier, CNY, Mohawk Valley, Finger Lakes. North, vol. 11, Issue 19, p. 9, (Sep. 15, 1997) 3 pages.Applicant
- Borowsky, Mark, “The Neural Net: Predictor of Fraud or Victim of Hype?”, Bank Technology News DialoQ File 16:PROMT, p. 7 (Sep. 1993) 2 pages.Applicant
- FICO http://houseloans.idis.com/fico (2009) 1 page.Applicant
- Altavista: search, FICO http://www.altavista.com (2001) 3 pages.Applicant
- “What Do FICO Scores Mean to Me?”, http://www.sancap.com. (1999) 3 pages.Applicant
- “What is a FICO Score?”, http://www.aspeenloan.com (2009) 1 page.Applicant
- “Credit”, The New Encyclopedia Britannica vol. 3 p. 722. (1994) 3 pages.Applicant
- “Creditnet.com—An Online Guide to Credit Cards”, http://www.creditnet/com. (1999) 1 page.Applicant
- “Phillips 66 Introduces Mastercard with Rebate Feature”, PR Newswire, p914NY067, (Sep. 14, 1995) 1 page.Applicant
- Anon, “VAR Agreement Expands Credit Bureau Access.”, (CCS America, Magnum Communications Ltd expand CardPac access, Computers in Banking, v6, n10, (1) (Oct. 1989) 2 pages.Applicant
- Wortmann, Harry S., “Reengineering Update—Outsourcing: An Option Full of Benefits and Responsibilities”, American Banker, (Oct. 24, 1994), p. 7A vol. 159, No. 205 3 pages.Applicant
- Anon. “To Boost Balances, AT&T Renews No-Fee Universal Credit Card Offer”, Gale Group Newsletter, V 10, N. 13, (Mar. 30, 1992) 2 pages.Applicant
- Anon. “Citgo Puts a New Spin on the Cobranded Oil Card”, Credit Card News, p. 4, (Nov. 1, 1995) 2 pages.Applicant
- Anon. “Microsoft Targets More than PIM Market with Outlook 2000,” Computer Reseller News, N. 805 pp. 99, (Aug. 31, 1998) 2 pages.Applicant
- Chesanow, Neil, “Pick the Right Credit Cards-and use them wisely”, Medical Economics, v. 75, n. 16, p. 94, (Aug. 24, 1998) 4 pages.Applicant
- Friedland, Marc, “Credit Scoring Digs Deeper into Data”, Credit World, v. 84, n. 5 p. 19-23, (May 1996) 5 pages.Applicant
- Hollander, Geoffrey, “Sibling Tool Personator 3 untangles File Formats”, InfoWorld, v20, n5, pp. 102 (Feb. 2, 1998) 2 pages.Applicant
- Kantrow, Yvette D., “Banks Press Cardholders to Take Cash Advances”, American Banker, v. 157, n. 18 pp. 1-2. (Jan. 28, 1992) 2 pages.Applicant
- Lotus News Release: “Lotus Delivers Pre-Release of Lotus Notes 4.6 Client Provides Compelling New Integration with Internet Explorer”, (May 20, 1997) 2 pages.Applicant
- Stetenfeld, Beth, “Credit Scoring: Finding the Right Recipe”, Credit Union Management, v. 17, n 11, pp. 24-26 (Nov. 1994).Applicant
- Block, Valerie, “Network Assembles Card Issuers at an Internet Site”, Am. Banker, V160, (1998) 1 page.Applicant
- CreditNet Financial Network http://consumers.creditnet.com (1999) 1 page.Applicant
- Anon., “Lending Tree: Lending Tree Provides Borrowers Fast and Easy Online Access to Multiple Loan Offers,” Business Wire, Jun. 23, 1998, 2 pages.Applicant
- Anon, Regulation Z Commentary Amendments, Retail Banking Digest, vol. 15, No. 2, p. 17-18, (Mar.-Apr. 1995).Applicant
- Anon, San Diego Savings Association Offers Customers No-Fee Visa Product, Card News, (Feb. 29, 1988) 1 page.Applicant
- Bloom, J.K., “For This New Visa, Only Web Surfers Need Apply,” American Banker, vol. 1163, No. 34 12 (Feb. 20, 1998) 2 pages.Applicant
- Harney, K.R., “Realty Brokers, Lenders Face Restrictions,” Arizona Republic, Final Chaser edition, Sun Living section, (Feb. 10, 1991) 2 pages.Applicant
- Higgins, K.T., “Mr. Plastic Joins the Marketing Team,” Credit Card Management, vol. 6, No. 3, pp. 26-30, Jun. 1993.Applicant
- Microsoft Press Computer Dictionary, Third Edition, Microsoft Press, Redmond, 1997, 4 pages.Applicant
- Whiteside, D.E., “One Million and Counting,” Collections and Credit Risk, vol. 1, No. 11 (Nov. 1996) 5 pages.Applicant
- Fickenscher, L., “Providian Undercuts rivals with 7.9% Rate Offer,” American banker, vol. 163, Oct. 8, 1998, 2 pages.Applicant
- Fargo, J., “The Internet Specialists,” Credit Card Management, vol. 11, No. 10, pp. 38-45, Jan. 1999.Applicant
- Lemay, T., “Browsing for a Mortgage a Click away,” Financial Post, (Jan. 15, 2000) 1 page.Applicant
- Wijnen, R., “Banks Fortify Online Services,” Bank Technology News, vol. 13, No. 3, Mar. 2000, 3 pages.Applicant
- Anon. “IAFC Launches NextCard, The First True Internet Visa,” Business Wire, New York: (Feb. 6 1998), 3 pages.Applicant
- Lazarony, Lucy, “Only Online Applicants Need Apply,” Bank Advertising News, North Palm Beach, Mar. 23 1998, vol. 21, Issue 15, 3 pages.Applicant
- FIData, Inc., News & Press Releases, “Instant Credit Union Loans via the Internet,” http://web.archive.org/web/19990221115203/www.fidata-inc.com/news-pr01.htm (1999) 2 pages.Applicant
- FIData, Inc., Press Releases, “Instant Loan Approvals via the Internet,” http://www.fidata-—inc.com/news/pr—040198.htm, (Apr. 1, 1998) 2 pages.Applicant
- Staff, “On-Line System Approves Loans While Customer Waits”—Abstract, Communication News, vol. 31, Issue 9, (Sep. 1994) 3 pages.Applicant
- Anon. “Affordable Lending Systems Now Available for Smaller Financial Institutions,” Business Wire, (May 18, 1998), 2 pages.Applicant
- Nexis—All News Sources—Examiners NPL Search Results in U.S. Appl. No. 11/932,498, included with Office Action issued Oct. 8, 2008, 14 pages.Applicant
- “Sample Experian Credit Report” by Consumer Information consumerinfo.com (Jul. 9, 1998) 4 pages.Applicant
- Plaintiffs Original Complaint, Nextcard, LLC v. Liveperson, Inc.; Civil Action No. 2:08-cv- 00184-TJW, In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed Apr. 30, 2008 (7 pages).Applicant
- Amended Complaint and Jury Demand; Liveperson, Inc. v. Nextcard, LLC, et al.; Civil Action No. 08-062 (GMS), in the U.S. District Court for the District of Delaware, filed Mar. 18, 2008 (5 pages).Applicant
- Plaintiffs Second Amended Complaint; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed Apr. 9, 2008 (12 pages).Applicant
- Defendants HSBC North America Holdings Inc.'s and HSBC USA Inc's Answer, Affirmative Defenses and Counterclaims to Plaintiffs Second Amended Complaint; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division filed (Apr. 28, 2008), 13 pages.Applicant
- Answer and Counterclaims of Defendant DFS Services LLC; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed Apr. 28, 2008 (13 pages).Applicant
- Defendant the PNC Financial Services Group, Inc.'s Answer and Affirmative Defenses to Second Amended Complaint; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); in the U.S. District Court for the Eastern District of Texas, Marshall Division, filed Apr. 28, 2008, 10 pages.Applicant
- Plaintiffs Second Amended Reply to Counterclaims of Defendants HSBC North America Holdings Inc. and HSBC USA Inc.; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed May 14, 2008, 5 pages.Applicant
- Plaintiffs Second Amended Reply to Counterclaims of Defendant DFS Services LLC; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed May 14, 2008 (71 pages).Applicant
- Plaintiffs Second Amended Reply to Counterclaims of Defendant American Express Company; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed (May 8, 2008), 8 pages.Applicant
- Justin Hibbard, Gregory Dalton, Mary E Thyfault. (Jun. 1998). “Web-based customer care.” Information Week, (684) 18-20, 3 pages.Applicant
- Kim S. Nash “Call all Customers.” Computerworld, 32 (1), 25-28 (Dec. 1997), 2 pages.Applicant
- PRN: “First American Financial Acquires Tele-Track Inc., ”PR Newswire, (May 11, 1999), Proquest #41275773, 2 pages.Applicant
- Young, Deborah, “The Information Store,” (Sep. 15, 2000), Wireless Review, pp. 42, 44, 46, 48, 50.Applicant
- Whiting et al., “Profitable Customers,” (Mar. 29, 1999), Information Week, Issue 727, pp. 44, 45, 48, 52, 56.Applicant
- Bayer, Judy, “A Framework for Developing and Using Retail Promotion Response Models,” Cares Integrated Solutions, retrieved from www.ceresion.com (2007) 5 pages.Applicant
- Bayer, Judy, “Automated Response Modeling System for Targeted Marketing,” (Mar. 1998), Ceres Integrated Solutions, 5 pages.Applicant
- Sweet et al., “Instant Marketing,” (Aug. 12, 1999), Information Week, pp. 18-20.Applicant
- SmartKids.com “Chooses Quadstone—The Smartest Customer Data Mining Solution,” (Jul. 31, 2000), Business Wire, 2 pages.Applicant
- “NCR's Next Generation Software Makes True Customer Relationship Management a Reality,” (Jul. 26, 1999) PR Newswire, 3 pages.Applicant
- “Quadstone System 3.0 Meets New Market Demand for Fast, Easy-to-Use Predictive Analysis for CRM,” (May 22, 2000) Business Wire, 3 pages.Applicant
- “Net Perceptions Alters Dynamics of Marketing Industry with Introduction of Net Perceptions for Call Centers,” (Oct. 12, 1998) PR Newswire, 3 pages.Applicant
- “Ceres Targeted Marketing Application,” Ceres Integrated Solutions: retrieved from www.ceresios.com/Product/index.htm (2007) 3 pages.Applicant
- Prince, C. J., E:business: A Look at the Future, Chief Executive, vol. 154, (Apr. 2000), pp. 10-11.Applicant
- Oikarinen et al. “Internet Relay Chat Protocol” RFC-1459, pp. 1-65, (May 1993).Applicant
- eDiet.com: Personalized Diets, Fitness, and Counseling, (May 3, 1998), pp. 1-15.Applicant
- Fiszer, Max; “Customizing an inbound call-center with skills-based routing,” Telemarketing & Call Center Solutions, (Jan. 1997), v15i7 p. 24; Proquest #11267840, 5 pages.Applicant
- “ESL Federal Credit Union Inaugurates Internet Target Marketing.” PR Newswire p. 4210 (Oct. 6, 1998), 3 pages.Applicant
- “Welcome to eStara—The Industry Leader in Click to Call and Call Tracking Solutions,” e-Stara, Inc., retrieved from www.estara.com on Mar. 21, 2013, 1 page.Applicant
- “Push to Talk Live Now! From your website” iTalkSystem, Inc., retrieved from www.italksystems.com on Mar. 21, 2013, 1 page.Applicant
- Richardson et al., “Predicting Clicks: Estimating the Click-Through Rate for New Ads,” (May 2007) 9 pages.Applicant
- “Welcome to Keen” retrieved from www.archive.org/web/20010302014355/http://www.keen.com/ on Jan. 25, 2013, 1 page.Applicant
- Christophe Destruel, Herve Luga, Yves Duthen, Rene Caubet. “Classifiers based system for interface evolution.” Expersys Conference, 265-270 (1997), 6 pages.Applicant
- Ulla de Stricker, Annie Joan Olesen. “Is Management Consulting for You?” Searcher, 48-53 (Mar. 2005), 6 pages.Applicant
- Humberto T. Marques Neto, Leonardo C.D. Rocha, Pedro H.C. Guerra, Jussara M. Almeida, Wagner Meira Jr., Virgilio A. F. Almeida. “A Characterization of Broadband User Behavior and Their E-Business Activities.” ACM Sigmetrics Performance Evaluation Review, 3-13 (2004), 11 pages.Applicant
- Greg Bowman, Michael M. Danchak, Mary LaCombe, Don Porter. “Implementing the Rensselaer 80/20 Model in Professional Education.” 30th ASEE/IEEE Frontiers in Education Conference, Session T3G (Oct. 18-21, 2000), 1 page.Applicant
- Elizabeth Sklar Rozier, Richard Alterman. “Participatory Adaptation.” CHI, 97, 261-262 (Mar. 22-27, 1997), 2 pages.Applicant
- Frank White. “The User Interface of Expert Systems: What Recent Research Tells Us.” Library Software Review, vol. 13, No. 2, p. 91-98 (Summer 1994) 8 pages.Applicant
- Frederick W. Rook, Michael L. Donnell. “Human Cognition and the Expert System Interface: Mental Models and Inference Explanations.” IEEE Transactions on Systems, Man, and Cybernetics, vol. 23, No. 6, p. 1649-1661 (Nov./Dec. 1993), 13 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/041147, mailed Jul. 30, 2013, 9 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/037086, mailed Jul. 12, 2013, 11 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/29389, mailed Jul. 24, 2013, 8 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/038212, mailed Jul. 17, 2013, 11 pages.Applicant
- International Search Report for PCT Application No. PCT/US03/41090, mailed on Sep. 1, 2004, 3 pages.Applicant
- International Search Report for PCT Application No. PCT/US05/40012, mailed on Oct. 5, 2007, 2 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2006/039630, dated Apr. 16, 2008, 4 pages.Applicant
- International Search Report for PCT Application No. PCT/US2011/031239, mailed on Jul. 7, 2011, 3 pages.Applicant
- International Search Report for PCT Application No. PCT/US2011/064946, mailed on Jun. 22, 2012, 3 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2011/031239, dated Oct. 9, 2012, 8 pages.Applicant
- Non-Final Office Action of Dec. 11, 2008 for U.S. Appl. No. 11/394,078, 15 pages.Applicant
- Final Office Action of Jul. 9, 2009 for U.S. Appl. No. 11/394,078, 15 pages.Applicant
- Non-Final Office Action of Jan. 28, 2010 for U.S. Appl. No. 11/394,078, 14 pages.Applicant
- Final Office Action of Jul. 9, 2010 for U.S. Appl. No. 11/394,078, 16 pages.Applicant
- Non-Final Office Action of Feb. 1, 2011 for U.S. Appl. No. 11/394,078, 20 pages.Applicant
- Final Office Action of Aug. 2, 2011 for U.S. Appl. No. 11/394,078, 23 pages.Applicant
- Non-Final Office Action of May 16, 2012 for U.S. Appl. No. 11/394,078, 23 pages.Applicant
- Final Office Action of Jan. 25, 2013 for U.S. Appl. No. 11/394,078, 22 pages.Applicant
- Non-Final Office Action of Jun. 22, 2012 for U.S. Appl. No. 13/080,324, 9 pages.Applicant
- Non-Final Office Action of Aug. 15, 2012 for U.S. Appl. No. 12/967,782, 31 pages.Applicant
- Non-Final Office Action of Jul. 29, 2011 for U.S. Appl. No. 12/608,117, 20 pages.Applicant
- Final Office Action of Apr. 4, 2012 for U.S. Appl. No. 12/608,117, 25 pages.Applicant
- Non-Final Office Action of Apr. 24, 2004 for U.S. Appl. No. 09/922,753, 16 pages.Applicant
- Final Office Action of Oct. 14, 2004 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Non-Final Office Action of May 17, 2005 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Non-Final Office Action of Mar. 14, 2006 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Final Office Action of Jul. 26, 2006 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Non-Final Office Action of Aug. 13, 2008 for U.S. Appl. No. 09/922,753, 10 pages.Applicant
- Final Office Action of Apr. 23, 2009 for U.S. Appl. No. 09/922,753, 11 pages.Applicant
- Non-Final Office Action of Jul. 21, 2009 for U.S. Appl. No. 09/922,753, 10 pages.Applicant
- Final Office Action of Feb. 18, 2010 for U.S. Appl. No. 09/922,753, 9 pages.Applicant
- Non-Final Office Action of Apr. 25, 2011 for U.S. Appl. No. 09/922,753, 9 pages.Applicant
- Final Office Action of Nov. 25, 2011 for U.S. Appl. No. 09/922,753, 10 pages.Applicant
- Non-Final Office Action of Aug. 7, 2007 for U.S. Appl. No. 10/980,613, 16 pages.Applicant
- Non-Final Office Action of May 15, 2008 for U.S. Appl. No. 10/980,613, 23 pages.Applicant
- Final Office Action of Feb. 14, 2013 for U.S. Appl. No. 13/080,324, 11 pages.Applicant
- Final Office Action of Apr. 11, 2013 for U.S. Appl. No. 12/967,782, 18 pages.Applicant
- Non-Final Office Action of Jun. 12, 2013 for U.S. Appl. No. 12/608,117, 56 pages.Applicant
- Non-Final Office Action of Jul. 8, 2013 for U.S. Appl. No. 13/413,197, 10 pages.Applicant
- Non-Final Office Action of Jun. 20, 2013 for U.S. Appl. No. 13/157,936, 19 pages.Applicant
- Non-Final Office Action of May 10, 2013 for U.S. Appl. No. 13/563,708, 20 pages.Applicant
- Final Office Action of Jan. 22, 2014 for U.S. Appl. No. 12/608,117, 45 pages.Applicant
- Final Office Action of Jan. 27, 2014 for U.S. Appl. No. 13/563,708, 35 pages.Applicant
- Non-Final Office Action of Jan. 30, 2014 for U.S. Appl. No. 13/413,158, 19 pages.Applicant
- Final Office Action of Feb. 19, 2014 for U.S. Appl. No. 13/961,072, 35 pages.Applicant
- Non-Final Office Action of Feb. 20, 2014 for U.S. Appl. No. 10/980,613, 43 pages.Applicant
- Notice of Allowance of Feb. 28, 2014 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Notice of Allowance of Mar. 31, 2014 for U.S. Appl. No. 12/725,999, 41 pages.Applicant
- Notice of Allowance of Apr. 1, 2014 for U.S. Appl. No. 13/413,197, 32 pages.Applicant