US 8,738,732 B2Grant
System and method for performing follow up based on user interactions
Issue Date:2014-05-27
•25 Claims
•5 Drawing Sheets
Abstract
A system and method for follow up management comprising determining if a user has an unexpired repository record, extracting information from the repository record associated with the user; and acting on instructions stored in the repository record. The method is practiced on a system for managing online interaction comprising a business rules engine a follow up repository, and a follow up engine.
Metadata
Assignee
- Liveperson, Inc.
Inventor
- Ron Karidi
Application Information
Application Number:US 11/360,530
Filing Date:2006-02-24
Priority Date:2005-09-14
Art Unit:2444
Classifications
IPC:
G06F15/16
Patent Drawings (5 sheets)
Description
Cross Reference to Related Applications
[0001] This application claims priority to U.S. Provisional Application No. 60/716,535, filed Sep. 14, 2005, and U.S. Provisional Patent Application No. 60/717,212, filed Sep. 15, 2005, the entirety of both are incorporated herein by reference.
Field of the Invention
[0002] The present invention relates to computer browsing and, more particularly, to providing an appropriate follow up based on the interaction.
Background of the Invention
[0003] Networks, such as the Internet, have become an increasingly important part of our everyday lives. Millions of people now access the Internet on a daily basis to shop for goods and services and obtain information of interest.
[0004] The web is built on a very simple, but powerful premise. Much of the material on the web is formatted in a general, uniform format called HTML (Hypertext Markup Language) or the like, and all information requests and responses conform to a similarly standard protocol. When someone accesses a server on the Web, the user's Web browser will send an information request to a Web server. The Web server will respond to the request by transmitting the desired information to the user's computer. There, the user's browser will display the received information on the user's screen.
[0005] For example, suppose an individual wishes to purchase a printer via the Internet. The individual accesses the Internet and types in a vendor's uniform resource locator (URL). The individual may then access that vendor's home page to determine whether the vendor has the product that this individual wishes to purchase.
[0006] If the individual does not know which vendors sell printers, the individual may access a web site associated with a search engine. The individual enters the generic term “printer” into the search engine to attempt to locate a vendor that sells printers. Using a search engine in this manner to locate individual web sites that offer the desired product or service often results in a list of hundreds or even thousands of “hits,” where each hit may correspond to a web page that relates to the search term.
[0007] Once a user decides which web page to visit, the web page is formulated to interest the user. In particular, many web pages allow a user to customize the web pager so that each time the user visits the web page, the customized web page is presented to the user. One of the challenges of online interactions is providing customers or users with consistent online experience while using different channels such as website navigation, email, chat, bulletin boards, discussion forums, chat, and the like. For this uniform presentation, cookies are used.
[0008] Cookies are pieces of information generated by a web server and stored in the user's computer, for future access. Cookies are embedded in the http information flowing back and forth between the user's computer and the servers. Cookies allow user-side customization of web information. For example, cookies are used to personalize web search engines, to allow users to participate in WWW-wide contests, to store shopping lists of items a user has selected while browsing through a virtual shopping mall, and the like.
[0009] Essentially, cookies make use of user-specific information transmitted by the web server onto the user's computer so that the information might be available for later access by itself or other servers. Typically, the servers are part of the same domain. In most cases, not only does the storage of personal information into a cookie go unnoticed, so does access to it. Web servers automatically gain access to relevant cookies whenever the user establishes a connection to them, usually in the form of web requests.
[0010] For a server to use cookies, first the Web server creates a specific cookie, which is essentially a tagged string of text containing the user's preferences, and it transmits this cookie to the user's computer. The cookie is then stored in the user's computer. The user's web browser receives the cookie and stores it in a special file called a cookie list. This usually happens without any notification or user involvement. Next, the cookie is automatically transferred from the user's machine to a web server. Whenever a user directs the web browser to display a certain web page from the server from which it already has a cookie, the browser will, transmit the cookie containing the user's personal information to the web server.
[0011] There are many reasons a given site would wish to use cookies. These range from the ability to personalize information, help with on-line sales/services, or simply for the purposes of collecting demographic information. Cookies also provide programmers with a quick and convenient means of keeping site content fresh and relevant to the user's interests. The newest servers use cookies to help with back-end interaction as well, which can improve the utility of a site by being able to securely store any personal data that the user has shared with a site to help with quick logins, and the like.
[0012] Usually, a cookie contains more than simply a name and a value. In fact, a cookie can have 6 parameters: the name of the cookie, the value of the cookie, the expiration date of the cookie, the path the cookie is valid for, the domain the cookie is valid for, and the need for a secure connection to exist to use the cookie.
[0013] Two of these parameters are mandatory the cookie's name and its value. The other four can be set manually or automatically. Each parameter is separated by a semicolon when set explicitly. The name of a cookie and its value are set simply by pairing them together. The value of a cookie can also be null, for the purpose of clearing the cookie value.
[0014] The expiration parameter determines the lifetime of the cookie. For example, the cookie can state “expires=Mon, 01-Jan-2001 00:00:00 GMT.” If “expires” is not set explicitly, the default expiration is the end-of-session. The length of a session can vary depending on browsers and servers, but generally a session is the length of time that the browser is open, even if the user is no longer at that site.
[0015] The path parameter sets the URL path within which the cookie is valid. Pages outside of that path cannot read or use the cookie. If Path is not set explicitly, then it defaults to the URL path of the document creating the cookie. The domain parameter takes the flexibility of the path parameter one step further. If a site uses multiple servers within a domain it is important to make the cookie accessible to pages on any of these servers. Generally, the server issuing the cookie is a member of the domain that it sets in the cookie. That is, a server called www.thisserver.com cannot typically set a cookie for the domain www.thatserver.com. If Domain is not set explicitly, then it defaults to the full domain of the document creating the cookie.
[0016] The last parameter is the secure parameter. The secure parameter is a flag indicating that a cookie should be used under secure server condition, such as SSL. Since most sites do not require secure connections, this parameter defaults to FALSE.
[0017] Often a consistent online experience requires the ability to recognize the customer or user across multiple interactions and recall, either in real-time or offline, the history of events and attributes associated with the customer or user. The recognition of customers or users, when applied to hundreds or thousands of online interactions a day, becomes a challenge, both from a business logic perspective and a technology perspective. Previous systems used business rules engines that parsed the activity of each visitor on the site. The activity was matched against a customized set of business rules. Once a selected rule was applied, an action that presents the site visitor with targeted content was triggered. Systems such as the LivePerson Sales Edition provided real time processing of business rules.
[0018] Traditionally, web systems that wanted to access history data about the visitor would access a database for each visitor to the site, only to find out that in most cases there is no meaningful information about the visitor that warrants a special treatment for that user. In the event that this visitor is new to the site, and therefore has no history, the database search wastes time and resources. Some systems can identify that the visitor is a new visitor, not having a site cookie, but would still access the database for all repeat visitors. For the repeat visitors, they would retrieve the history data, analyze it, and most times decide to offer the generic treatment.
[0019] In one prior art system, when the system identifies a user based on a previously stored cookie, the records associated with that user are pulled from memory and analyzed. The analysis is done when the user enters the website. Therefore, there is a delay between the user entering the website and when the appropriate action is taken after the system reviews the records and determines what to do based on those records. Alternatively, standard actions are taken for all users as they enter the site.
Summary of the Invention
[0020] The unique aspects of the disclosed system and method are related to the technological challenges of allowing web-servers real-time access to the CRM system. Using the disclosed system, web servers are more effective and only access the relevant data for the relevant visitors. A system is disclosed to provide a consistent online experience to users or customers visiting a web site.
[0021] There are three major modules in the disclosed system:
[0022] 1. Business Rules Engine
[0023] 2. follow up Repository
[0024] 3. follow up Engine
[0025] The first component is the business rules engine that processes, in real-time, the events associated with each customer and decides what business action is required. Business intelligence in the rules engine identifies whether a current visitor to the site requires follow up in a subsequent interaction. This information is stored together with what needs to be done, i.e., what follow up action has to be taken. In this manner, when a new visitor arrives on the site, a lookup is performed only if it is required. Moreover, the information stored in the previous session already indicates the action to be taken and reduces the need for additional real-time decision to be made.
[0026] There are at least three actions that can be taken, present (real-time) action, future follow up, and follow up on the user or customer's next visit. Preferably, future follow-ups are scheduled for a specific date and the follow-up channel is not the website. In one embodiment, a combination of actions are taken, i.e., present action with future follow up. The real-time action can include, but is not limited to presenting the user with a specific web page, presenting the user with a questionnaire, enabling a live chat, sending an event notification, and the like. The future follow up is by one or more of several communication methods such as outbound email, outbound phone, offline channel (mail), or the like. The phone follow up is an automated follow up, a live operator, or combination of the two and uses plain old telephone service (POTS) or voice over IP (VOIP).
[0027] The second component of the disclosed system is the follow up repository. The follow up repository is a data repository that associates visitor-identifying information with follow up content. In a preferred embodiment, the follow up repository is hosted on a database. The repository provides data management services controlling the size and aging of the stored data. In particular, items can be marked with an expiration date and size limits can be set. In one embodiment, the repository includes user contact information or links to where such information is stored. In another embodiment, follow up instructions are stored in the follow up repository.
[0028] The third component of the disclosed system is the follow up engine that is responsible for online and offline activities. The online activities include determining previous or outstanding follow up actions and establishing new follow up information and the offline activities include retrieving and acting on follow up instructions.
[0029] Specifically, when a visitor arrives at a website, the follow up engine detects whether the visitor has un-expired follow up information in the repository. When there is follow up information, the follow up engine retrieves the information and acts on it. In another embodiment, the follow up engine extracts information from the repository record and acts upon instructions stored in the repository record. When a visitor interacts with the website, the follow up engine determines whether to set or add follow up information to the visitor's follow up record. The follow up engine then determines the expiration date, if any, for that information. Depending on the follow up information, the expiration date can be as little as several hours (or less) or as long as one year (or more). In some situations, there may not be any expiration date. The follow up engine stores the expiration date of the visitor's follow up record on the visitor's cookie, thereby allowing the follow up engine to detect that the visitor has follow up information when the visitor returns to the website for a new visit. Using the follow up engine allows efficient determination of a website visitor's follow up information.
[0030] The follow up engine has offline functions in addition to the online functions when a user is visiting the web site. The follow up engine retrieves instructions and triggers follow up actions. In one embodiment, the follow up records stored in the follow up repository have a trigger date. The trigger date is the date a follow up action takes place. On the trigger date, the follow up engine pulls the follow up records and acts upon the instructions stored in the record. The actions the follow up engine can take include sending outbound email, initiating an outbound phone call (operator, automated, or a combination), initiating an offline channel activity (e.g. DM mailing), sending instructions to agents to take action, or the like.
[0031] The combination of these three components allows for an effective handling of large volumes of interactions required in today's online environment. The disclosed system and method addresses the challenge presented to website managers who are interested in accessing in real time the history of events and attributes associated with their customers.
Brief Description of the Figures
[0032] FIG. 1 System according to the present invention;
[0033] FIG. 2 represents a cookie used in the present system;
[0034] FIG. 3A represents the data stored in the database according to the present invention;
[0035] FIG. 3B represents content data;
[0036] FIG. 4 is a flowchart of the method of user interaction according to the present invention; and
[0037] FIG. 5 is a flowchart of the method to store a record.
Detailed Description
[0038] FIG. 1 depicts an embodiment of a system according to the present invention. As shown, a user 10 is connected to a web server 30 via the internet. The user 10 has additional means of communication such as a telephone 50, fax machine, cell phone, hand held computer, and the like. The web server 30 includes a database 22 which stores a plurality of web pages such as web page 20. Additionally, a module 32 is used for the application of business rules and follow up procedures. In one embodiment, module 32 is part of web server 30. In another embodiment, module 32 is housed in another computer. Module 32 accesses data from database 34. follow up records 36 are preferably stored in database 34. In one embodiment, module 32 also performs follow up functions. It should be noted that the functions of module 32 can be performed using separate modules. In one embodiment, the follow up function such as E-mail, voice-over IP, mail, and the like are routed through web server 30. In another embodiment, the follow up procedures or follow up activities are performed through another server or servers. Additionally, module 32 can cause DM mailings to be performed.
[0039] In operation, a user 10 requests a web page 20 from server 30. In the case in which user 10 has not previously requested web page 20, server 30 causes a cookie 12 (shown in FIG. 2 ) to be stored on the user's computer. Additionally, a follow up record 36 (shown in FIG. 3A ) is created for user 10 and stored in database 34, based on the user's activity.
[0040] In the case that the user has previously accessed web page 20, the server 30 receives a cookie 12 from user 10. The cookie is processed by module 32. Module 32 determines whether the user 10 has previously stored unexpired follow up information 36 stored in database 34. In a preferred embodiment, module 32 includes a business rules engine, a follow up repository, and a follow up engine. In another embodiment, the business rules engine, follow-up repository, and follow-up engine are separate modules.
[0041] When there is follow up information 36, the module 32 retrieves the information and acts on it. In another embodiment, the follow up engine extracts information from the repository record and acts upon instructions stored in the repository record. The follow up information is used to modify the user experience. The user experience is modified by such items as chat, popups, setting system variables, setting display variables, opening a communication channel, opening an engagement channel, and the like.
[0042] The business rule engine processes, in real-time, the events associated with each user and decides what business action that is required. The business rule engine selects from one of at least three actions. If the business rule engine determines an immediate need, action is taken in real-time. If no immediate action has to be taken, follow up is scheduled for either a specific future date or upon the user's next visit. Specific actions to take include mail, both traditional and email, telephone follow up, fax, or the like. In one embodiment, the system can open a chat dialogue if the user is online using a chat agent. It should be noted that in all instances, the follow up is appropriate for the web page such as a follow up questionnaire regarding a technical problem, a replacement part being sent out if a defective component was reported, an E-mail reminder, follow-up based on the users behavior on the site, and the like. In some instances, no action is taken.
[0043] The business rules engine uses rules that are based on conditions and actions taken while a user is visiting a specified website. Certain conditions will result in specific actions being taken. The conditions include both the activities that a user that performs while on a page and the user's behavior while on a page. Rules provide a way to react to customer activity. Visitor rules customize the processing of visitors and/or people communicating via chat or another channel. In a preferred embodiment, rules are created within a specific context that determines the circumstances in which the rule will apply. The rules respond to conditions that exist. Conditions specify which actions will be triggered. It should be noted that multiple conditions can be specified or Boolean logic can be used.
[0044]
| TABLE 1 | ||
|---|---|---|
| Visitor Rules - Conditions | ||
| Condition | Rule Type | Description |
| Browsing | ||
| Current Page | clicks to chat | The URL or title of the current page match the specified pattern. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Current Page | clicks to chat | The referring URL of the current page match the specified pattern. |
| Referring URL | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Number of | clicks to chat | The number of pages visited during this session. |
| Pages | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Referring URL | clicks to chat | Matches the referrer of the visitor's first visit to the site. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Search Engine | clicks to chat | The URL from which the visitor arrived is from a search engine. |
| Found | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Search Engine | clicks to chat | The search engine from which the request came. |
| Identity | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Survey Question | clicks to chat | Response to a question in a particular survey. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Visited Page | clicks to chat | The visitor visited a page whose URL or title matches the specified |
| enters page | pattern. | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Chat | ||
| Available for | clicks to chat | Visitor is available for a chat invitation. |
| Invitation | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Has Chat | clicks to chat | Visitor has chatted during the current session. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Has Chat | clicks to chat | The visitor requested to chat in a previous visit. |
| History | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| In Chat | clicks to chat | The visitor is currently involved in a chat session with an operator. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| In Chat or | clicks to chat | The visitor is currently in a chat, or waiting for a chat to be established. |
| Waiting for Chat | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| In or After Chat | clicks to chat | The visitor is currently in a chat, or has previously been in chat |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Invited to Chat | clicks to chat | The visitor has been invited to chat. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Refused Chat | clicks to chat | An invitation to chat been has sent to the visitor and the visitor refused |
| enters page | to chat. | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Miscellaneous | ||
| Action Fired | clicks to chat | The action with the specified name has already fired during this session. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| At Least One | clicks to chat | The rule with the specified name has already been triggered during this |
| Rule Triggered | enters page | session. |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Predictive | enters page | Triggers a predictive dialer with the specified settings. A Predictive |
| Dialer | enters site | Dialer controls the number of invitations sent to site visitors. |
| Random | clicks to chat | A random integer between 0 and the specified number. |
| Number | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Rule Triggered | clicks to chat | The outcome with the specified rule has already been triggered during |
| enters page | this session. | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Operators | ||
| Available | clicks to chat | At least one operator is online. (i.e., is the operator in the “online” state, |
| Operators | enters site | not “away” or “back in 5”). |
| leaves site | ||
| Number of | clicks to chat | The Number of available operators available. |
| Operators | enters site | |
| Available | leaves site | |
| Online | clicks to chat | Operators are currently in the “online” state. An operator that is “away” |
| Operators | enters site | or “back in 5” is not considered online. |
| leaves site | ||
| Room Operators | clicks to chat | There is at least one operator of the skill specified online in the current |
| Online | enters site | visitor's Room. |
| leaves site | ||
| Skill Operators | clicks to chat | There is at least one operator of the specified skill available. |
| Available | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Skill Operators | clicks to chat | There is at least one operator of the specified skill online. |
| Online | enters site | |
| leaves site | ||
| Time Functions | ||
| Day of the | clicks to chat | The day of the week. |
| Week | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Days Since Last | clicks to chat | The number of days since the last time this visitor has requested to chat. |
| Click-to-Chat | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Days Since Last | clicks to chat | The number of days since the visitor's last visit to the site (fails if this is |
| Visit | enters page | the first visit). |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Invitation | clicks to chat | The number of seconds for the visitor to be invited to chat. This |
| History (cross | enters page | condition also checks the visitor's previous sessions. To check chat |
| session) | enters site | invitations only in the current session use “Invited to Chat” or “Time Since |
| queued for | Last Invite” | |
| chat | ||
| leaves site | ||
| Invitation | clicks to chat | The number of seconds the Invitation to chat timed out. If the last |
| Timeout | enters page | invitation did not timeout, the condition will always be false. |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Seconds in | clicks to chat | The number of seconds the visitor was on the current page. |
| Current Page | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Seconds Since | clicks to chat | The number of seconds since the visitor was declined. |
| Decline | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Seconds Since | clicks to chat | The number of seconds since the visitor last visited a page that matches |
| Last Visit to | enters page | the specified pattern. |
| Page | enters site | |
| queued for | ||
| chat | ||
| leaves site | ||
| Time In Site | clicks to chat | The time in seconds that the visitor spent in the site during this session. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Time of the Day | clicks to chat | The number of minutes elapsed since midnight, Eastern Standard Time, |
| enters page | today. | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Time Since | clicks to chat | The time in seconds since the specified action fired. |
| Action Fired | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Time Since | clicks to chat | The time in seconds since the custom variable was modified. |
| Custom Variable | enters page | |
| Modified | enters site | |
| queued for | ||
| chat | ||
| leaves site | ||
| Time Since Last | clicks to chat | The time in seconds since the visitor's last invite. |
| Invite | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Time Since Rule | clicks to chat | The time in seconds since the rule fired. |
| Fired | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Wait Time | clicks to chat | The time in seconds that the visitor has been in the queue. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Variables | ||
| All Values of | clicks to chat | Apply the comparison to All values of the specified Custom Variable. All |
| Custom Variable | enters page | values must be Numeric and satisfy the comparison condition. |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| At Least One | clicks to chat | The Custom Variable has at least one value that satisfies the comparison |
| Numeric Value | enters page | condition. |
| of Custom | enters site | Enter custom variable name in the first field, and number to match in |
| Variable | queued for | the last field. |
| chat | ||
| leaves site | ||
| At Least One | clicks to chat | The Custom Variable has at least one value that satisfies the comparison |
| Value of Custom | enters page | condition. |
| Variable | enters site | Enter custom variable name in the first field, and string to match in the |
| queued for | last field. | |
| chat | ||
| leaves site | ||
| Variables | ||
| Custom Flag | clicks to chat | The custom flag variable satisfies the comparison condition. |
| Variable | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Custom Variable | clicks to chat | The value of the Custom Variable that corresponds to the specified name |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Custom Variable | clicks to chat | A Custom Variable with the specified name has been set. |
| Has Been Set | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Custom Variable | clicks to chat | There is a Custom Variable on the current page. |
| on Current Page | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Numeric Custom | clicks to chat | Apply the comparison to All values of the specified Custom Variable. All |
| Variable | enters page | values must be Numeric and satisfy the comparison condition. |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Numeric Values | clicks to chat | The numeric value of the Custom Variable with the specified name (fails |
| of Custom | enters page | if Custom Variable has not occurred or the value is not numeric). Enter |
| Variable | enters site | Custom Variable name in the first field, and number to match in the last |
| queued for | field. | |
| chat | ||
| leaves site | ||
| Visitor Properties | ||
| Browser Type | clicks to chat | The visitor's browser matches the specified pattern. |
| (User Agent) | enters page | |
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Hot Lead | clicks to chat | Visitor is specified as a hot lead. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| IP | clicks to chat | The visitor's IP address or host-DNS matches the specified pattern. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Repeat Visit | clicks to chat | This visitor has been to the site before this session. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Skill | clicks to chat | The visitor's skill group. |
| enters page | ||
| enters site | ||
| queued for | ||
| chat | ||
| leaves site | ||
| Visitor Group | clicks to chat | The group number for this visitor, if all visitors are grouped into groups. |
| enters page | The site visitors are randomly segmented into the number of groups you | |
| enters site | set in the 3rd parameter. You can then check to which specific group the | |
| queued for | visitor has been assigned. | |
| chat | ||
| leaves site | ||
[0045] Conditions may include the type of page, section of a page or a specific URL, can trigger a specific condition. Additionally, if the user reaches a page via a hyperlink or by typing a URL, that condition may be monitored. The time a user spends on a specific page may also be a condition. For example, the system can monitor whether a user spends more or less than a specified time on a page or group of pages. Matching pages can also be in a condition as are negative conditions such as whether a user has been on a page, added items to a cart but taken no further action, or not gone to a checkout.
[0046] The rules also include variables which can be a value or an occurrence. For example, the value or occurrence may be a shopping cart total greater than a specified dollar amount or contain more or less than a specified amount/quantity. Further, other variables can include was there a transaction error (a yes or no variable). The system can also monitor at least such items as an occurrence of a specified event, entering a communication channel such as chat before or after a selection, days since chat, and the like. Further, other variables can be a new visitor, old visitor, user's IP address, and the like.
[0047] The user's IP address can be important for business reasons such as identifying a competitor and limiting access to that user. For example, if the website is a telecommunication company and a user logs on from a competitor company, access can be limited until that user signs in with a user name and password, thereby designating that that person is a customer. Likewise, this may happen in the banking community where a first bank will limit access to employees of a second bank unless they are customers of the first bank.
[0048] In a preferred embodiment, the follow up engine is responsible for both online and offline activities. When visitor arrives at the website, the follow up engine determines whether the visitor 10 has unexpired follow up information 36 in the repository 34. In those cases when there is information, the information 36 is retrieved and acted upon. Once the record 36 is retrieved, data is extracted from the repository record 36. The extracted data includes visitor ID, account ID, session ID, Ticket ID, follow up date, expiration date, recovery mode, and content.
[0049] When a visitor interacts with the website, the follow up engine determines whether to set or add follow up information to the user's follow up record 36 and determines the expiration date for that information. When the visitor interacts with the website, the follow up engine will store the expiration date of the visitor's follow up record 36 on the visitor's cookie 12. In this manner, when the user returns, the engine can efficiently detect that the visitor has follow up information 36.
[0050] Follow up records 36 in the database 34 may have a trigger date. On the trigger date, the record is retrieved and acted upon by the follow up engine. At that time the engine sending outbound email, initiates outbound phone calls, initiating an offline channel activity (e.g. DM mailing), sending instructions to agents to take action, or the like.
[0051] The follow up repository is a data repository. Preferably hosted on a database, that associates visitor-identifying information with follow up content. The repository provides data management services to control the size and aging of the stored items. In particular, items can be marked with expiration date and can have size limits.
[0052] FIG. 2 is representative of a cookie 12 created by server 30 and stored on user's 10 computer. The cookie preferably includes a visitor ID, a date the record was set, and a database record expiration date. Thus, when user 10 visits website 20, the cookie identifies the user as well as the date the cookie was created. Further, the cookie includes the date the record in database 34 expires. Thus, if user 10 returns to website 20 after the record 36 expires, there is no need to retrieve the follow up record. In this manner, resources are conserved. Due to the high volume of traffic hosted by a typical web server, if the web server had to retrieve a record for every user or, in the alternative, search its database every time a user enters the website, the resources available to the web server would be taxed.
[0053] FIG. 3 represents the data string stored in database 34 created by module 32. The record 36 is formed based from the actions of user 10 on web page 20. The record 36, as discussed above, includes the visitor ID which is the same ID stored in cookie 12. In addition to the visitor ID, the record 36 includes the user's account ID, if one exists for web page 20. If user 20 does not have an account on web page 20, in one embodiment, a provisional account number is assigned to user 10 that correlates with the visitor ID.
[0054] The session ID is an ID for the user's current login session. This session ID is a log that records the user's time on the site. For example, the session ID may represent a log entry signifying the time and date the user utilizes the website. Alternatively, the session ID may be no more than a counter indicating the number visitor the user is. The ticket ID is, in a preferred embodiment, a service ticket ID number. The service ticket number represents a service to be performed. For example, if a user requires a service call, the ticket ID would include the service ticket number for the repair man to visit the user's home, office, or the like.
[0055] Record 36 also includes a follow up date and an expiration date. These two dates work hand-in-hand to provide follow up to user 10. Based on the user's activity, a specific follow up activity or set of follow up activities are determined. However, these follow up activities are preferably only good until the expiration date in record 36. Once the expiration date is met, the follow up prescribed by the record is no longer valid. In one embodiment, the follow up engine uses the previously determined follow up activity as a starting point for any future follow ups.
[0056] The recovery mode is used to determine what action to take given certain error circumstances. For example, the recovery mode relates to how a system deals with internal inconsistencies. For example, if the cookie contains a record indicating that there should be follow-up if there is nothing in the database or, if the record states that there should be one record but in the database there are two records, the system must know how to deal with the internal inconsistency. A first way to deal with any inconsistency is not to fix anything or, to ignore the record. Alternatively, the system can try to fix the record on read or on write. Additionally, the system can self correct. For example, if there is more than one record, the most recent record will be used.
[0057] The content in the extracted data, shown in FIG. 3B , includes the follow-up activity. In other words, the content is what action will be taken upon follow-up. In a preferred embodiment, the content is an XML instruction. Potential content includes pop-up messages, slide shows, variables to be set relating to the users last visit, and the like. In one embodiment, the system monitors the follow up date in the record. When the follow up date is reached, the follow up action, if not through the web site, is taken such as a follow up call, email, letter, or the like.
[0058] As discussed above, when certain conditions occur, an action is triggered. Actions may contain subactions. In one embodiment, the actions are executed in a specific order. However, in another embodiment, the actions occur in random or non-specified order. A sample of actions based on rules and alerts are shown below in Table 2.
[0059]
| TABLE 2 | ||||
|---|---|---|---|---|
| Visitor Rules - Actions | ||||
| Type | Rule Type | Action | Parameters | Description |
| Operator Alerts | clicks to chat | Operator Alert | Send an alert to operators concerning this | |
| enters page | visitor. For a list of macros available in | |||
| enters site | Operator Alerts, refer to the LivePerson | |||
| queued for | Customer Center. | |||
| chat | Description | Enter a brief description of the operator | ||
| leaves site | alert, if you so wish. | |||
| browsing site | HTML | Use the HTML box to design your alert. | ||
| Plain text can be used in this area, but | ||||
| HTML tagging will serve to make the alert | ||||
| more | ||||
| eye-catching. | ||||
| Chat Audit | clicks to chat | Email this | Email a copy of the chat transcript to the | |
| enters site | transcript | Sender Name | specified address. The email will arrive | |
| leaves site | Sender Email | from the specified sender. Set the subject | ||
| Subject | to help you identify the email. | |||
| Forward | Email a copy of the chat transcript to the | |||
| transcript from | Subject | specified address. The email will arrive | ||
| visitor email | Email Custom | from the email associated with the visitor. | ||
| Variable | You can optionally set the custom variable | |||
| to be used to extract the visitor's email | ||||
| address (Email Custom Variable). | ||||
| Visitor | clicks to chat | Engage Visitor | NA | Send a proactive chat request to a visitor. |
| Experience | enters page | Custom Engage | <custom | Engage visitor using custom image |
| enters site | Visitor | directory> | directory. The directory should not end | |
| leaves site | with a “/”. | |||
| browsing site | Set Visitor | <name of visitor | Assign the session to a selected Visitor | |
| Profile | profile> | Profile. | ||
| Enable/Disable | Pre-Chat Survey | Enable/Disable Pre-Chat survey status for | ||
| Pre-Chat Survey | the visitor during current session. | |||
| Enable/Disable | Exit Survey | Enable/Disable the Exit survey status for | ||
| Exit Survey | the visitor during current session. | |||
| Enable/Disable | Operator Survey | Enable/Disable the Operator survey status | ||
| Operator Survey | for the visitor during current session. | |||
| Set Pre-Chat | <name of | Set specific Pre-Chat survey for the visitor | ||
| survey | prechat survey> | during current session. | ||
| Set Exit survey | <name of exit | Set specific Exit survey for visitor during | ||
| survey> | current session. | |||
| Set Operator | <name of | Set specific Operator survey for visitor | ||
| survey | operator | during current session. | ||
| survey> | ||||
| Set Offline | <name of | Set specific Offline survey for the visitor | ||
| survey | offline survey> | during current session. | ||
| Set Chat | <name of chat | Set a specific Chat Window profile for the | ||
| Window | window> | visitor during current session. | ||
| Set System | <name of | Set specific System Messages set for the | ||
| Messages | system message | visitor during the current session. | ||
| set> | ||||
| enters page | Show Popup | <popup> | Display a pop-up. New pop-ups are created | |
| in the Content Library. | ||||
| enters page | Engage Visitor | NA | Send a proactive chat request to a visitor. | |
| enters page | Custom Engage | <custom | Engage visitor using custom image | |
| Visitor | directory> | directory. The directory should not end | ||
| with a “/”. | ||||
| enters page | Show Warmup | <popup> | Use the Content Library tab to define new | |
| warmups. | ||||
| Variables | clicks to chat | Set Custom | Variable Name | Add a custom variable to the session. |
| enters page | Variable | Variable Value | ||
| enters site | Set Custom Flag | Flag Name | Add an on/off custom variable to the | |
| queued for | Variable | State On | session. | |
| chat | <HelvBold>|Off | |||
| leaves site | Set Custom | Variable name | Add a custom variable to the session. This | |
| browsing site | Variable —One | Variable Vale | action will only fire once per session. | |
| Time Only | ||||
| Routing | queued for | Assign to | <Service | Change the visitor's service queue. |
| chat | Service Queue | Queue> | ||
| Assign | <Service | Assign a percentage of visitors to a queue. | ||
| Percentage to | Queue> | Use several of these outcomes together to | ||
| Service Queue | create a distribution plan for a group of | |||
| visitors. Note that visitors will only be | ||||
| assigned if the queue is online for the Skill | ||||
| Group. | ||||
| Sales Edition | click to chat | Set Visitor as | NA | Visitor is defined as a hot lead. |
| enters site | Hot Lead | |||
| queued for | Increment | <file location> | Include specified words that can be viewed | |
| chat | Reporting | in the Conversion reports. Counters are | ||
| browsing site | Counter | defined in Rules > Words > Report | ||
| Counters. | ||||
| Set Visitor | <segment | Set the visitor Segment | ||
| Segment | name> | |||
[0060] FIG. 4 depicts a flow chart according to the present invention. According to one embodiment of the present invention, in step 100, when a user visits a website, the web site server retrieves a cookie specific for that website, if any. In step 120, the system determines whether or not the user has follow up data stored in the system. If the user has follow up data on the system based on the cookie retrieved from the user. Such follow up data is retrieved from database 190 in step 130. The system then acts on the follow up data in step 140. The user's interaction on the site are evaluated in step 145 and, based on subsequent actions by the user on the given website, the follow up data is revised in step 150. The revised follow up data is then saved in database 190. Subsequent to the storage of any required follow up, at the appropriate time, the required future follow up action is taken in step 210. This follow up action can include a telephone call, an email, a facsimile, a mailing, or the like.
[0061] In those cases when the user does not have any active follow up actions or the follow up record is expired, the users actions are evaluated, and if required, a new follow up record is created in step 170. Subsequently, the new record is stored in database 190 in step 180. Then, based on the user's activity on the give web page, any additional follow up activity is revised and stored. Subsequently, any future follow up activity is performed in step 210.
[0062] It should be noted that, in the present system, database access is performed for only those visitors that warrant special treatment. In this manner, valuable resources are conserved because multiple database queries are not performed. Thus, multiple database look-ups are performed only for those users requiring special attention or specified interaction. The interaction is based on previous sessions already stored in the server's database. Thus, no real-time decisions are required for present user interactions.
[0063] In addition to the three modules discussed above, several other features can be used to improve system performance including caching, read buffering, and write buffering.
[0064] To efficiently utilize system resources, records are preferably not immediately written into the database. As shown in FIG. 5 , after a user's session ends, the system waits one hour. In other embodiments, other amounts of time are used. After the one hour time limit, the system uses heuristics to predict whether the user will return within 24 hours. This prediction is based on the user's activities on the website and the like. If the system predicts that the user will not return within the next 24 hours, the record is immediately written to the database. If the system determines that it is likely that the user will return within the next 24 hours, the record is kept in memory. In a preferred embodiment, the record is kept in memory for 24 hours. After 24 hours, or another predetermined time period, the record is written to the database and the memory is cleared.
[0065] By maintaining the record in memory, valuable system resources are conserved because the system does not have to send the record to the database and write those records to the database. Thus, communication bandwidth as well as database record space is preserved. Additionally, if the user returns within the prescribed time period while the record is still in memory, the time to access the record is greatly reduced. As shown in FIG. 5 , once a user session ends, the record is cached and a first time period begins where the system waits to see if the user returns. Typically, this first time period is approximately 1 hour. If the user returns during this time period, the system monitors the user's activity until the user's session ends again. If the user does not return, the system predicts if the user will return during a second time period, typically 24 hours. If the user will not likely return during the prescribed time period, the record is written to the database. If the user will likely return, the record is stored in memory. During this time period, the user's return is monitored. If the user returns, the session continues until of the new session or, after the prescribed time period, the record is written to the database and the memory is cleared.
[0066] In the preferred embodiment, to conserve data storage requirements, records are saved to a partition. In this manner, when a set of records are to be deleted, the partition corresponding to the set of records to be deleted is cleared. Preferably, the partitions are sorted by date and are erased every 30 days.
[0067] Heuristics are employed to estimate which follow up records will be accessed more frequently, and estimate the likelihood that a visitor will return to the site within the next 24 hours. In this way, records are readily accessible to the system. If a record will not be accessed within 24 hours, it is written to the database. For efficient database updating, write requests are buffered so that multiple follow up records are stored to the database in one operation. Once record expires, it is preferably removed from the database. Finally, read requests are buffered such that the server performs read operations only at a certain rate, for example not more frequently than 5 times per second.
[0068] The present invention may be described herein in terms of functional block components, code listings, optional selections and various processing steps. It should be appreciated that such functional blocks may be realized by any number of hardware and/or software components configured to perform the specified functions. For example, the present invention may employ various integrated circuit components, e.g., memory elements, processing elements, logic elements, look-up tables, and the like, which may carry out a variety of functions under the control of one or more microprocessors or other control devices.
[0069] Similarly, the software elements of the present invention may be implemented with any programming or scripting language such as C, C++, C#, Java, COBOL, assembler, PERL, or the like, with the various algorithms being implemented with any combination of data structures, objects, processes, routines or other programming elements.
[0070] Further, it should be noted that the present invention may employ any number of conventional techniques for data transmission, signaling, data processing, network control, and the like.
[0071] It should be appreciated that the particular implementations shown and described herein are illustrative of the invention and its best mode and are not intended to otherwise limit the scope of the present invention in any way. Indeed, for the sake of brevity, conventional data networking, application development and other functional aspects of the systems (and components of the individual operating components of the systems) may not be described in detail herein. Furthermore, the connecting lines shown in the various figures contained herein are intended to represent exemplary functional relationships and/or physical or virtual couplings between the various elements. It should be noted that many alternative or additional functional relationships or physical or virtual connections may be present in a practical electronic data communications system.
[0072] As will be appreciated by one of ordinary skill in the art, the present invention may be embodied as a method, a data processing system, a device for data processing, and/or a computer program product. Accordingly, the present invention may take the form of an entirely software embodiment, an entirely hardware embodiment, or an embodiment combining aspects of both software and hardware. Furthermore, the present invention may take the form of a computer program product on a computer-readable storage medium having computer-readable program code means embodied in the storage medium. Any suitable computer-readable storage medium may be utilized, including hard disks, CD-ROM, optical storage devices, magnetic storage devices, and/or the like.
[0073] The present invention is described below with reference to block diagrams and flowchart illustrations of methods, apparatus (e.g., systems), and computer program products according to various aspects of the invention. It will be understood that each functional block of the block diagrams and the flowchart illustrations, and combinations of functional blocks in the block diagrams and flowchart illustrations, respectively, can be implemented by computer program instructions. These computer program instructions may be loaded onto a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions that execute on the computer or other programmable data processing apparatus create means for implementing the functions specified in the flowchart block or blocks.
[0074] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means that implement the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions that execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.
[0075] Accordingly, functional blocks of the block diagrams and flowchart illustrations support combinations of means for performing the specified functions, combinations of steps for performing the specified functions, and program instruction means for performing the specified functions. It will also be understood that each functional block of the block diagrams and flowchart illustrations, and combinations of functional blocks in the block diagrams and flowchart illustrations, can be implemented by either special purpose hardware-based computer systems that perform the specified functions or steps, or suitable combinations of special purpose hardware and computer instructions.
[0076] One skilled in the art will also appreciate that, for security reasons, any databases, systems, or components of the present invention may consist of any combination of databases or components at a single location or at multiple locations, wherein each database or system includes any of various suitable security features, such as firewalls, access codes, encryption, de-encryption, compression, decompression, and/or the like.
[0077] The scope of the invention should be determined by the appended claims and their legal equivalents, rather than by the examples given herein. For example, the steps recited in any method claims may be executed in any order and are not limited to the order presented in the claims. Moreover, no element is essential to the practice of the invention unless specifically described herein as “critical” or “essential.”
[0078] In the specification, the term “media” means any medium that can record data therein. The term “media” includes, for instance, a disk shaped media for such as CD-ROM (compact disc-read only memory), magneto optical disc or MO, digital video disc-read only memory or DVD-ROM, digital video disc-random access memory or DVD-RAM, a floppy disc, a memory chip such as random access memory or RAM, read only memory or ROM, erasable programmable read only memory or E-PROM, electrical erasable programmable read only memory or EE-PROM, a rewriteable card-type read only memory such as a smart card, a magnetic tape, a hard disc, and any other suitable means for storing a program therein.
[0079] A recording media storing a program for accomplishing the above mentioned apparatus maybe accomplished by programming functions of the above mentioned apparatuses with a programming language readable by a computer or processor, and recording the program on a media such as mentioned above.
[0080] A server equipped with a hard disk drive may be employed as a recording media. It is also possible to accomplish the present invention by storing the above mentioned computer program on such a hard disk in a server and reading the computer program by other computers through a network.
[0081] As a computer processing device, any suitable device for performing computations in accordance with a computer program may be used. Examples of such devices include a personal computer, a laptop computer, a microprocessor, a programmable logic device, or an application specific integrated circuit.
[0082] While this invention has been described by reference to a preferred embodiment, it should be understood that numerous changes could be made within the spirit and scope of the inventive concepts described. Accordingly, it is intended that the invention not be limited to the disclosed embodiment, but that it have the full scope permitted by the language of the following claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A computer-implemented method, comprising:
receiving a cookie relating to a visitor of a website, wherein the cookie includes information indicating whether one or more repository records exist;
determining, on a computing device, if a repository record exists based on the information stored in the cookie, the repository record including follow-up information describing a follow-up action to take based on an activity of the visitor during a prior visit to the website, wherein information stored in the repository record is different from the information stored in the cookie;
retrieving, on the computing device, the repository record from a database;
extracting, on the computing device, the follow-up information from the repository record;
performing the follow-up action described by the extracted follow-up information in the repository record; and
generating a revised repository record when one or more activities of the visitor are detected on the website, wherein the revised repository record includes new follow-up information, and wherein the revised repository record is stored in the database.
3. The method of claim 2, further comprising:
extracting an expiration date from the cookie;
determining whether the expiration date is met; and
retrieving the repository record when the expiration date has not been met.
4. The method of claim 2, further comprising:
extracting an expiration date from the cookie;
determining that the expiration date has not been met;
determining that an expired repository record exists based on the expiration data not being met; and
erasing the expired repository record.
5. The method of claim 1, wherein the repository record is created during the prior visit to the website.
6. The method of claim 1, wherein the repository record is created a period of time after the prior visit to the website.
7. The method of claim 1, wherein the follow-up action includes setting a system variable, setting a display variable, opening a communication channel, or opening an engagement channel.
8. The method of claim 1, wherein the follow-up action includes providing a chat to the visitor or providing a popup to the visitor.
9. The method of claim 1, wherein the repository record is stored in the database subject to a deletion characteristic.
10. The method of claim 9, further comprising:
erasing the repository record based on the deletion characteristic.
11. The method of claim 9, wherein the deletion characteristic includes a time-based database partition.
12. 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 cookie relating to a visitor of a website, wherein the cookie includes information indicating whether one or more repository records exist;
determining if a repository record exists based on the information stored in the cookie, the repository record including follow-up information describing a follow-up action to take based on an activity of the visitor during a prior visit to the website, wherein information stored in the repository record is different from the information stored in the cookie;
retrieving the repository record from a database;
extracting the follow-up information from the repository record;
performing the follow-up action described by the extracted follow-up information in the repository record; and
generating a revised repository record when one or more activities of the visitor are detected on the website, wherein the revised repository record includes new follow-up information, and wherein the revised repository record is stored in the database.
13. The system of claim 12, wherein the non-transitory computer-readable storage medium contains further instructions configured to cause the processor to perform operations including:
determining whether the repository record is expired.
14. The system of claim 13, wherein the non-transitory computer-readable storage medium contains further instructions configured to cause the processor to perform operations including:
extracting an expiration date from the cookie;
determining whether the expiration date is met; and
retrieving the repository record when the expiration date has not been met.
15. The system of claim 13, wherein the non-transitory computer-readable storage medium contains further instructions configured to cause the processor to perform operations including:
extracting an expiration date from the cookie;
determining that the expiration date has not been met;
determining that an expired repository record exists based on the expiration data not being met; and
erasing the expired repository record.
16. The system of claim 12, wherein the follow-up action includes setting a system variable, setting a display variable, opening a communication channel, or opening an engagement channel.
17. The system of claim 12, wherein the follow-up action includes providing a chat to the visitor or providing a popup to the visitor.
18. The system of claim 12, wherein the repository record is stored in the database subject to a deletion characteristic.
19. 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 cookie relating to a visitor of a website, wherein the cookie includes information indicating whether one or more repository records exist;
determine if a repository record exists based on the information stored in the cookie, the repository record including follow-up information describing a follow-up action to take based on an activity of the visitor during a prior visit to the website, wherein information stored in the repository record is different from the information stored in the cookie;
retrieve the repository record from a database;
extract the follow-up information from the repository record;
perform the follow-up action described by the extracted follow-up information in the repository record; and
generate a revised repository record when one or more activities of the visitor are detected on the website, wherein the revised repository record includes new follow-up information, and wherein the revised repository record is stored in the database.
20. The computer-program product of claim 19, further including instructions configured to cause the data processing apparatus to:
determine whether the repository record is expired.
21. The computer-program product of claim 20, further including instructions configured to cause the data processing apparatus to:
extract an expiration date from the cookie;
determine whether the expiration date is met; and
retrieve the repository record when the expiration date has not been met.
22. The computer-program product of claim 20, further including instructions configured to cause the data processing apparatus to:
extract an expiration date from the cookie;
determine that the expiration date has not been met;
determine that an expired repository record exists based on the expiration data not being met; and
erase the expired repository record.
23. The computer-program product of claim 19, wherein the follow-up action includes setting a system variable, setting a display variable, opening a communication channel, or opening an engagement channel.
24. The computer-program product of claim 19, wherein the follow-up action includes providing a chat to the visitor or providing a popup to the visitor.
25. The computer-program product of claim 19, wherein the repository record is stored in the database subject to a deletion characteristic.
Patent Citations (498)
| 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 et al. | 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 | Sonnenrich 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 | Examiner |
| 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. | Examiner |
| 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 | Examiner |
| 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 | Hirsh | Applicant |
| US6839680(B1) | 2005-01-01 | Liu | Applicant |
| US6850896(B1) | 2005-02-01 | Kelman et al. | Applicant |
| US6865267(B2) | 2005-03-01 | Dezono | 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 | Examiner |
| 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. | Examiner |
| 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. | Examiner |
| US2001/0014877(A1) | 2001-08-01 | Defrancesco 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. | Examiner |
| 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 | Applicant |
| US2002/0046096(A1) | 2002-04-01 | Srinivasan | 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/0082923(A1) | 2002-06-01 | Merriman et al. | Applicant |
| US2002/0083095(A1) | 2002-06-01 | Wu et al. | Examiner |
| 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 | 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/0028415(A1) | 2003-02-01 | Herschap et al. | Examiner |
| 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. | Examiner |
| 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. | Examiner |
| 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. | Examiner |
| 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. | Examiner |
| US2005/0262065(A1) | 2005-11-01 | Barth et al. | 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 S | Examiner |
| 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. | Applicant |
| 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. | Examiner |
| 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/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. | Applicant |
| 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/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/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/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/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/0023475(A1) | 2010-01-01 | Lahav | 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/0110933(A1) | 2010-05-01 | Wilcock | 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/0268468(A1) | 2013-10-01 | Vijayaraghavan et al. | Applicant |
| US2013/0275862(A1) | 2013-10-01 | Adra | 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 | |
| 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 |
Non-Patent Literature (171)
- 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 Administrator's 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 Customer's 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—Examiner's 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
- Non-Final Office Action of Apr. 30, 2012 for U.S. Appl. No. 12/504,265, 16 pages.Applicant
- Final Office Action of Aug. 28, 2012 for U.S. Appl. No. 12/504,265, 28 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. 27, 2013 for U.S. Appl. No. 12/504,265, 11 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 Oct. 21, 2013 for U.S. Appl. No. 12/504,265 14 pages.Applicant
- 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
- 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
- Notice of Allowance of Feb. 12, 2014 for U.S. Appl. No. 13/157,936, 33 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. 25, 2014 for U.S. Appl. No. 12/504,265, 31 pages.Applicant
- Notice of Allowance of Mar. 31, 2014 for U.S. Appl. No. 12/725,999, 41 pages.Applicant