System and method for determining a propensity of entity to take a specified action

Information

  • Patent Grant
  • 11521096
  • Patent Number
    11,521,096
  • Date Filed
    Tuesday, August 29, 2017
    7 years ago
  • Date Issued
    Tuesday, December 6, 2022
    2 years ago
Abstract
Systems and methods are disclosed for determining a propensity of an entity to take a specified action. In accordance with one implementation, a method is provided for determining the propensity. The method includes, for example, accessing one or more data sources, the one or more data sources including information associated with the entity, forming a record associated with the entity by integrating the information from the one or more data sources, generating, based on the record, one or more features associated with the entity, processing the one or more features to determine the propensity of the entity to take the specified action, and outputting the propensity.
Description
BACKGROUND

The amount of information being processed and stored is rapidly increasing as technology advances present an ever-increasing ability to generate and store data. On the one hand, this vast amount of data allows entities to perform more detailed analyses than ever. But on the other hand, the vast amount of data makes it more difficult for entities to quickly sort through and determine the most relevant features of the data. Collecting, classifying, and analyzing large sets of data in an appropriate manner allows these entities to more quickly and efficiently identify patterns, thereby allowing them to predict future actions.





BRIEF DESCRIPTION OF THE DRAWINGS

Reference will now be made to the accompanying drawings, which illustrate exemplary embodiments of the present disclosure. In the drawings:



FIG. 1 is a block diagram of an exemplary computer system, consistent with embodiments of the present disclosure;



FIG. 2 is a flowchart of an exemplary method for determining a propensity of an entity to take a specified action, consistent with embodiments of the present disclosure;



FIG. 3 is a flowchart of an exemplary method for creating a model to determine the propensity of an entity to take a specified action, consistent with embodiments of the present disclosure;



FIG. 4 provides an exemplary use case scenario for determining a propensity of an entity to take a specified action applied to an exemplary data structure, consistent with embodiments of the present disclosure.



FIG. 5 illustrates an exemplary user interface, consistent with embodiments of the present disclosure; and



FIG. 6 illustrates another exemplary user interface, consistent with embodiments of the present disclosure.





DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Reference will now be made in detail to several exemplary embodiments, including those illustrated in the accompanying drawings. Whenever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.


Embodiments disclosed herein are directed to, among other things, to systems and methods that can determine the propensity of an entity (e.g., a person, a household, or a company) to take a specified action. For example, a specific action can involve determining the propensity that a customer will leave a supplier during a given time period (e.g., churn). Such factors that can affect the churn rate include customer dissatisfaction, cheaper and/or better offers from the competition, more successful sales and/or marketing by the competition, or reasons having to do with the customer life cycle. If a supplier can receive an indication that a customer is likely to churn, the supplier can take one or more actions in order to keep the customer. The embodiments disclosed herein can assist with providing that indication.


For example, the systems and methods can access one or more data sources, the one or more data sources including information associated with the entity, form a record associated with the entity by integrating the information from the one or more data sources, generate, based on the record, one or more features associated with the entity, process the one or more features to determine the propensity of the entity to take the specified action, and output the propensity.


The operations, techniques, and/or components described herein are implemented by a computer system, which can include one or more special-purpose computing devices. The special-purpose computing devices can be hard-wired to perform the operations, techniques, and/or components described herein. The special-purpose computing devices can include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the operations, techniques, and/or components described herein. The special-purpose computing devices can include one or more hardware processors programmed to perform such features of the present disclosure pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices can combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques and other features of the present disclosure. The special-purpose computing devices can be desktop computer systems, portable computer systems, handheld devices, networking devices, or any other device that incorporates hard-wired and/or program logic to implement the techniques and other features of the present disclosure.


The one or more special-purpose computing devices can be generally controlled and coordinated by operating system software, such as iOS, Android, Blackberry, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, VxWorks, or other compatible operating systems. In other embodiments, the computing device can be controlled by a proprietary operating system. Operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.


By way of example, FIG. 1 is a block diagram that illustrates an implementation of a computer system 100, which, as described above, can comprise one or more electronic devices. Computer system 100 includes a bus 102 or other communication mechanism for communicating information, and one or more hardware processors 104 (denoted as processor 104 for purposes of simplicity), coupled with bus 102 for processing information. One or more hardware processors 104 can be, for example, one or more microprocessors.


Computer system 100 also includes a main memory 106, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 102 for storing information and instructions to be executed by one or more processors 104. Main memory 106 also can be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 104. Such instructions, when stored in non-transitory storage media accessible to one or more processors 104, render computer system 100 into a special-purpose machine that is customized to perform the operations specified in the instructions.


Computer system 100 further includes a read only memory (ROM) 108 or other static storage device coupled to bus 102 for storing static information and instructions for processor 104. A storage device 110, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 102 for storing information and instructions.


Computer system 100 can be coupled via bus 102 to a display 112, such as a cathode ray tube (CRT), an LCD display, or a touchscreen, for displaying information to a computer user. An input device 114, including alphanumeric and other keys, is coupled to bus 102 for communicating information and command selections to one or more processors 104. Another type of user input device is cursor control 116, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to one or more processors 104 and for controlling cursor movement on display 112. The input device typically has two degrees of freedom in two axes, a first axis (for example, x) and a second axis (for example, y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.


Computer system 100 can include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the one or more computing devices. This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C, and C++. A software module can be compiled and linked into an executable program, installed in a dynamic link library, or written in an interpreted programming language such as, for example, BASIC, Perl, Python, or Pig. It will be appreciated that software modules can be callable from other modules or from themselves, and/or can be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices can be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and can be originally stored in a compressed or installable format that requires installation, decompression, or decryption prior to execution). Such software code can be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions can be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules can be comprised of connected logic units, such as gates and flip-flops, and/or can be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but can be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


Computer system 100 can implement the techniques and other features described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the electronic device causes or programs computer system 100 to be a special-purpose machine. According to some embodiments, the techniques and other features described herein are performed by computer system 100 in response to one or more processors 104 executing one or more sequences of one or more instructions contained in main memory 106. Such instructions can be read into main memory 106 from another storage medium, such as storage device 110. Execution of the sequences of instructions contained in main memory 106 causes one or more processors 104 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry can be used in place of or in combination with software instructions.


The term “non-transitory media” as used herein refers to any media storing data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media can comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 150. Volatile media includes dynamic memory, such as main memory 106. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, a register memory, a processor cache, and networked versions of the same.


Non-transitory media is distinct from, but can be used in conjunction with, transmission media. Transmission media participates in transferring information between storage media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 102. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.


Various forms of media can be involved in carrying one or more sequences of one or more instructions to one or more processors 104 for execution. For example, the instructions can initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 100 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 102. Bus 102 carries the data to main memory 106, from which processor 104 retrieves and executes the instructions. The instructions received by main memory 106 can optionally be stored on storage device 110 either before or after execution by one or more processors 104.


Computer system 100 can also include a communication interface 118 coupled to bus 102. Communication interface 118 can provide a two-way data communication coupling to a network link 120 that is connected to a local network 122. For example, communication interface 118 can be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 118 can be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links can also be implemented. In any such implementation, communication interface 118 can send and receive electrical, electromagnetic, or optical signals that carry digital data streams representing various types of information.


Network link 120 can typically provide data communication through one or more networks to other data devices. For example, network link 120 can provide a connection through local network 122 to a host computer 124 or to data equipment operated by an Internet Service Provider (ISP) 126. ISP 126 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 128. Local network 122 and Internet 128 both use electrical, electromagnetic, or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 120 and through communication interface 118, which carry the digital data to and from electronic device 110, are example forms of transmission media.


Computer system 100 can send messages and receive data, including program code, through the network(s), network link 120 and communication interface 118. In the Internet example, a server 130 might transmit a requested code for an application program through Internet 128, ISP 126, local network 122 and communication interface 118. The received code can be executed by one or more processors 104 as it is received, and/or stored in storage device 110, or other non-volatile storage for later execution.



FIG. 2 is a flowchart representing an exemplary method 200 for determining the propensity of an entity to take a specified action. While the flowchart discloses the following steps in a particular order, it is appreciated that at least some of the steps can be moved, modified, or deleted where appropriate, consistent with embodiments of the present disclosure. In some embodiments, method 200 can be performed in full or in part by a computer system (e.g., computer system 100). It is appreciated that some of these steps can be performed in full or in part by other systems.


Referring to FIG. 2, at step 210, the computer system can access one or more data sources that include information associated with the entity. The one or more data sources can be stored locally at the computer system and/or at one or more remote servers (e.g., such as a remote database), or at one or more other remote devices. In some embodiments, the information in the data sources can be stored in one or more multidimensional tables. By way of example, information of a first type (e.g., bill payment amount) associated with the entity, (e.g., a household), can be stored in a first multidimensional table and information of a second type (e.g., automobile type) associated with the entity can be stored in a second multidimensional table. In some embodiments a table can contain information associated with a single entity. In other embodiments, a table can store information associated with a plurality of entities. For example, each row in the table can correspond to a different entity (e.g., Household #1, Household #2, etc.) and each column in the table can correspond to a payment amount. In some embodiments, the information stored in the table can include entries associated with a temporal period. For example, a table can store a bill payment date for each bill payment amount. The information can be stored as a continuous value (e.g., $800 as a bill payment amount), as a categorical value (e.g., “Sedan” or “Coupe” as an automobile type), as textual value, or as any other type of value. In some embodiments, a table can be stored in either a row-oriented database or a column-oriented database. For example, a row in a row-oriented table can contain information associated with an entity (e.g., Household #1) and data in the row can be stored serially such that information associated with the entity can be accessed in one operation.


In some embodiments the computer system can access the one or more data sources periodically (e.g., once a week, once a month, etc.). The computer system can access the one or more data sources based on the one or more data sources being updated (e.g., a new entry, such as payment bill amount, is added to a table). In some embodiments, the computer system can access the one or more data sources responsive to an input received from the user. The user input can identify the entity (e.g. Household #5) for which information is requested. In some embodiments, the user input can identify a category or class of entities. For example, the user input can identify a class of entities that are all consumers of a specified provisioning entity (e.g., insurance company), the user input can identify entities that are located within a specified geographic region (e.g., all households within the state of Illinois), or the user input can identify any other category of entities (e.g., all households with an income over $100,000). In response to the user input, the computer system can access the one or more data sources including information associated with the entities. In some embodiments, method 200 can be performed periodically (e.g., once a week, once a month, etc.). In some embodiments, method 200 can be performed whenever the one or more data sources are accessed.


At step 220, the computer system can form a record including all information from the one or more data sources associated with the entity. In some embodiments, the record can be formed by integrating the information that is associated with the entity from the one or more data sources. The record can contain a multitude of information related to the entity. For example, the record can contain all information from the one or more data sources associated with a household (e.g., number of members in household, age of each member of the household, number of automobiles, income, monthly bill mounts for each automobile, types of automobiles, etc.). In some embodiments, the record can be stored as a cogroup (e.g., the cogroup shown in FIG. 4). In some embodiments, the record can be stored in either a row-oriented database or a column-oriented database. For example, a row in a row-oriented record can be associated with a data source (e.g., bill payment amount) and data in the row can be stored serially such that data associated with that data source can be accessed in one operation.


At step 230, the computer system can filter the record for information associated with the specified action. For example, the specified action can be churn (e.g., cancellation of a subscription) and the computer system can filter the record for information related to churn. In some embodiments, the computer system can provide context for the specified action. In some embodiments, the computer system can determine whether the specified action will likely occur within a specified temporal period (e.g., one month). The computer system can filter out all information associated with a time that is outside (e.g., before or after) the specified temporal period. In some embodiments, the computer system can determine the propensity for the specified action based on only recent events. For example, the computer system can filter out information associated with a time before the specified time period (e.g., stale or less relevant information). In some embodiments, each record can be filtered in a slightly different way. The record can be filtered according to a user input specifying an activity or temporal period. In some embodiments, the record can be filtered automatically based on a presetting (e.g., the computer can be configured to filter out all information that is more than one year old).


At step 240, the computer system can generate, based on the record, one or more features associated with the entity. A feature can be any discernable way of sorting or classifying the record (e.g., average value, most recent value, most common value, etc.). In some embodiments, the computer system can generate key value pairs, wherein each key value pair contains a feature and a value. For example, the computer system can generate features such as “average bill payment amount”, “average income”, “average number of automobiles”, etc. and corresponding values such as “$670”, “$73K”, “2.3 cars”, etc. In some embodiments, features can be associated with a time value. For example, computer system can generate features for a specified temporal period (e.g., features can be based only on the most recent values). Feature values can be represented as a continuous value (e.g., $670), as a categorical value (e.g., “Sedan” or “Coupe”), as a textual value, or as any other type of value. In some embodiments, feature values can be classified as weighted values. For example, a household income of $73,000 can be represented as weighted value of {0.27 0}, {0.73 100000}.


At step 250, the computer system can process the one or more features to determine the propensity of the entity to take the specified action. In some embodiments, the propensity can be determined by applying a trained model, such as the model described in greater detail in FIG. 3. The input to the model can be key value pairs of the one or more features associated with the entity and the specified actions and the output of the model can be the propensity of the entity to take the specified action. In some embodiments, processing the one or more features associated with the entity can result in a multitude of useful insights regarding the features that influence the propensity of the entity to take the specified action. Such insights, can include, for example, the features that are most influential on the propensity of the entity to take the specified action (e.g., change in income, etc.).


At step 260, the computer system can output the propensity. In some embodiments the computer system can output the propensity as a continuous value, such as a number or percentage (e.g., 80 or 80%) or as a categorical value (e.g., “low”, “medium”, or “high”). In some embodiments, the computer system can generate a user interface, such as the user interfaces described in greater detail in FIGS. 5 and 6 for displaying the propensity. In some embodiments, the computer system can output a plurality of propensities for a plurality of entities. The computer system can output the plurality of propensities as an a separate file (e.g., a text file or an Excel file) or as a table.



FIG. 3 shows a flowchart representing an exemplary method 300 for creating a model to determine the propensity of an entity to take a specified action, consistent with embodiments of the present disclosure. While the flowchart discloses the following steps in a particular order, it is appreciated that at least some of the steps can be moved, modified, or deleted where appropriate, consistent with embodiments of the present disclosure. In some embodiments, method 300 can be performed in full or in part by a computer system (e.g., computer system 100). It is appreciated that some of these steps can be performed in full or in part by other systems.


Referring to FIG. 3, at step 310, the computer system can access one or more data sources that include information associated with the plurality of entities. The one or more data sources can be stored locally at the computer system and/or at one or more remote servers (e.g., such as a remote database), or at one or more other remote devices. In some embodiments, the information in the data sources can be stored in one or more multidimensional tables. By way of example, information of a first type (e.g., bill payment amount) associated with the plurality of entities, (e.g., households), can be stored in a first multidimensional table and information of a second type (e.g., automobile type) associated with the entities can be stored in a second multidimensional table. In some embodiments a plurality of table can contain information associated with the plurality of entities, wherein each table contains information associated with each entity. In other embodiments, a table can store information associated with a plurality of entities. For example, each row in the table can correspond to a different entity (e.g., Household #1, Household #2, etc.) and each column in the table can correspond to a payment amount. In some embodiments, the information stored in a table can include entries associated with a temporal period. For example, a table can store a bill payment date for each bill payment amount. The information can be stored as a continuous value (e.g., $800 as a bill payment amount), as a categorical value, (e.g., “Sedan” or “Coupe” as an automobile type), as textual value, or as any other type of value. In some embodiments, a table can be stored in either a row-oriented database or a column-oriented database. For example, a row in a row-oriented table can contain information associated with an entity (e.g., Household #1) and data in the row can be stored serially such that information associated with the entity can be accessed in one operation.


In some embodiments the computer system can access the one or more data sources periodically (e.g., once a week, once a month, etc.). In other embodiments, the computer system can access the one or more data sources based on the one or more data sources being updated (e.g., a new entry, such as payment bill amount, is added to a table). In some embodiments, the computer system can access the one or more data sources responsive to an input received from the user. In some embodiments, the user input can specifically identify the plurality of entities (e.g., Household #1-#10,000) for use in generating the model. In some embodiments, the user input can identify a category or class of entities. For example, the user input can identify a class of entities that are all consumers of a specified provisioning entity (e.g., insurance company), the user input can identify entities that are located within a specified geographic region (e.g., all households within the state of Illinois), or the user input can identify any other category of entities (e.g., all households with an income over $100,000). In response to a user input, the computer system can access the one or more data sources including information associated with the plurality of entities.


At step 320, the computer system can form a plurality of records including information from the one or more data sources associated with the plurality of entities, each record being associated with an entity. In some embodiments, a record of the plurality of records can be formed by integrating information from the one or more data sources information that is associated with an entity of the plurality of entities. The record can contain a multitude of information related to the entity. For example, the record can contain all information from the one or more data sources associated with a household (e.g., number of members in household, number of automobiles, income, monthly bill amounts for each automobile, etc.). In some embodiments, the record can be stored as a cogroup (e.g., the cogroup shown in FIG. 4). In some embodiments, the record can be stored in either a row-oriented database or a column-oriented database. For example, a row in a record can be associated with a data source (e.g., bill payment amount) and data in the row can be stored serially such that data associated with that data source can be accessed in one operation.


At step 330, the computer system can filter the plurality of records for information associated with the specified action. For example, the specified action can be churn (e.g., cancellation or non-renewal of a subscription) and the computer system can filter the record for information related to churn. In some embodiments, the computer system can provide context for (e.g., frame) the specified action. In some embodiments, the computer system can determine whether the specified action will occur within a specified temporal period (e.g., one month). The computer system can filter out all information associated with a time that is outside (e.g., before or after) the specified temporal period. In some embodiments, the computer system can determine the propensity for the specified action based on only recent information. For example, the computer system can filter out information associated with a time before the specified temporal period (e.g., stale or less relevant information). In some embodiments, each record can be filtered in a slightly different way. A record can be filtered according to a user input specifying an activity or temporal period. In some embodiments, the record can be filtered automatically based on a presetting (e.g., the computer can be configured to filter out all information that is more than one year old).


The computer system can frame the record by associating a label with the record. In some embodiments, the label can represent whether the entity took the specified action within the specified temporal period. For example, the computer system can associate a label of “1” or “true” if the entity took the specified action within the specified temporal period. By way of example, in the context of the cancellation of a subscription, the computer system can keep data from time period A to B (e.g., the specified temporal period) and determine whether the entity cancelled the subscription within a second time period, T. In this example, if the entity cancelled the subscription in time period T, the computer system can associate a label with the record indicating that the entity took the specified action.


At step 340, the computer system can create, for each record, a labelled example by generating one or more features associated with an entity of the plurality of entities. A feature can be any discernable way of sorting or classifying the record (e.g., average value, most recent value, most common value, etc.). In some embodiments, the computer system 340 can generate key value pairs, wherein each key value pair contains a feature and a value. For example, the computer system can generate features such as “average bill payment amount”, “average income”, “average number of automobiles”, etc. and corresponding values such as “$670”, “$73K”, “2.3 cars”, etc. In some embodiments, features can be associated with a time value. For example, computer system can generate features for a specified temporal period (e.g., features can be based only on the most recent values). Feature values can be represented as a continuous value (e.g., $670), as a categorical value (e.g., “Sedan” or “Coupe”), as a textual value, or as any other type of value. In some embodiments, feature values can be classified as weighted values. For example, a household income of $73,000 can be represented as weighted value of {0.27 0}, {0.73 100000}. In some embodiments, the labelled example can include the key value feature pairs and the record label (e.g., whether the entity took the specified action).


At step 350, the computer system can select a subset of the plurality of labelled examples to train a model. In some embodiments, the subset can be created by randomly sampling the plurality of labelled examples. A random sample can allow for broader generalization of the model created at step 360. In some embodiments, the user can select the subset of labelled examples. For example, the user can select all entities with a particular feature (e.g., all households with at least 2 cars). In some embodiments, the subset can be created by sampling labelled examples with a wide range of values for features that are known to be more important (e.g., change in income).


At step 360, the computer system can train a model using the subset of labelled examples. For example, the model can be trained by generalizing a function that maps inputs (e.g., the one or more features) to outputs (e.g., the label, such as whether the specified action occurred). In some embodiments, the model can perform regressions for each feature simultaneously. In some embodiments, the model can be trained by a hyperparameter optimization algorithm. In some embodiments, the hyperparameter optimization algorithm can perform a grid search through a hyperparameter space for the optimal hyperparameters. In some embodiments, the hyperparameter algorithm can perform a random search through the hyperparameter space. The computer system can evaluate the hyperparameters against a holdout set of labelled examples. For example, the computer system can apply the model trained by hyperparameter optimization to the holdout set. In some embodiments, the computer system can retrain the model with different hyperparameters if a particular attribute (e.g., accuracy, area under the curve, log-likelihood, F1-score, Top N, etc.) of the model does not exceed a predetermined threshold. In some embodiments, the computer system can continue to retrain the model until it obtains hyperparameters that exceed the threshold value. In some embodiments, the computer system can train the model a predetermined number of times (e.g., 10). The computer system can evaluate the trained models against a holdout set and select the model with the most favorable attributes (e.g., accuracy, area under the curve, log-likelihood, F1-score, Top N, etc.).


At step 370, the computer system can output the model. In some embodiments, the model can be outputted to a user for future use. For example, a user can use the model to determine the propensity of an entity to take a specified action. In other embodiments, the computer system can output the model to be stored locally or to be transmitted to an external database. In some embodiments, the computer system can output the model for use in another method, such as the method described in FIG. 2, to determine the propensity of an entity to take a specified action. In some embodiments, the computer system can output confidence levels for the model. For example, the computer system can output the particular attribute (e.g., accuracy, area under the curve, log-likelihood, F1-score, Top N, etc.) of the model with respect to the examples in the holdout set.



FIG. 4 provides an exemplary use case scenario for determining a propensity of an entity to take a specified action applied to an exemplary data structure. While the flowchart discloses the following steps in a particular order, it is appreciated that at least some of the steps can be moved, modified, or deleted where appropriate, consistent with embodiments of the present disclosure. In some embodiments, the use case scenario shown in FIG. 4 can be performed by a computer system (e.g., computer system 100). It is appreciated that some of these steps can be performed in full or in part by other systems.


Referring to FIG. 4, one or more data tables 410 acquired from one or more data sources can include information associated with the entity. The one or more data tables 410 can be stored locally at the computer system and/or at one or more remote servers (e.g., such as a remote database), or at one or more other remote devices. In some embodiments, the information in the data tables can be stored in one or more multidimensional tables. By way of example, as shown in FIG. 4, information of a first type (e.g., bill payment amount) associated with the entity, (e.g., a household), can be stored in a first multidimensional table 410 and information of a second type (e.g., income or number of cars) associated with the entity can be stored in a second multidimensional table 410. In some embodiments a table can contain information associated with a single entity. For example, Bill Amount table 410 shows the most recent bill payment amounts associated with the entity in this exemplary scenario. In other embodiments (not shown), a table can store information associated with a plurality of entities. For example, each row in the table can correspond to a different entity (e.g., Household #1, Household #2, etc.) and each column in the table can correspond to a payment amount. In some embodiments, the information stored in the table can include entries associated with a temporal period. For example, a table can store a bill payment date for each bill payment amount. As shown in FIG. 4, Bill Payment Table 410 can store dates in the first column (e.g., Jan. 1, 2014, Feb. 1, 2014, and Mar. 1, 2014). Each bill payment date can be associated with the bill payment amount. For example, Bill Payment Table 410 shows that an amount of $800 was billed to the household on Jan. 1, 2014. The information can be stored as a continuous value (e.g., $800 as a bill payment amount), as a categorical value, (e.g., “Sedan” or “Coupe” as an automobile type), as textual value, or as any other type of value. In some embodiments, a table can be stored in either a row-oriented database or a column-oriented database. For example, a row in a row-oriented table can contain information associated with an entity (e.g., Household #1) and data in the row can be stored serially such that information associated with the entity can be accessed in one operation.


The computer system can form (420) a record 430 including some or all information from the one or more data sources associated with the entity. In some embodiments, record 430 can be formed (420) by integrating the information from the one or more data sources that is associated with the entity. Record 430 can contain a multitude of information related to the entity. For example, record 430 can contain all information from the one or more data sources associated with a household (e.g., number of members in household, number of automobiles, income, monthly bill mounts for each automobile, etc.). In some embodiments, record 430 can be stored as a cogroup with each row of the cogroup associated with a different category of information. In some embodiments, record 430 can be stored in either a row-oriented database or a column-oriented database. For example, a row in a row-oriented record can be associated with a data source (e.g., bill payment amount) and data in the row can be stored serially such that data associated with that data source can be accessed in one operation. As shown in FIG. 4, the “Bill Amount” is stored as row in record 430. Bill amounts $800, $600, and $600 can be stored serially such that all of the payment amounts can be accessed in one operation. Similarly, “Income” and “Number of Cars” are stored in separate rows in record 430, and information from these sources (e.g. {$80K, $70K, $70K} and {3, 2, 2}) can also be accessed in one operation.


In some embodiments, the computer system can filter record 430 for information associated with the specified action (not shown). For example, the specified action can be churn (e.g., cancellation of a subscription) and the computer system can filter record 430 for information related to churn. In some embodiments, the computer system can provide context for the specified action. In some embodiments, the computer system can determine whether the specified action will occur within a specified temporal period (e.g., one month). The computer system can filter out all information associated with a time that is outside (e.g., before or after) the specified temporal period. In some embodiments, the computer system can determine the propensity for the specified action based on only recent events. For example, the computer system can filter out information associated with a time before the specified time period (e.g., stale or less relevant information). In some embodiments, each record can be filtered in a slightly different way. Record 430 can be filtered according to a user input specifying an activity or temporal period. In some embodiments, record 430 can be filtered automatically based on a presetting (e.g., the computer can be configured to filter out all information that is more than one year old). For example, the computer system can determine the propensity of the entity to take the specified action based on only data from the previous month. In the example shown in FIG. 4, the computer system can filter out the older entries of Bill Amount table 410 (e.g., Bill Amounts of $800 and $600 corresponding to bill dates in January and February). The computer system can also filter out similar entries in Income and Number of Cars tables 410 (e.g., incomes of $80K and $70K and 3 and 2 number of cars). Thus, the computer system can use only the most recent entries to determine the propensity of the household to take the specified action (e.g., $600 in Bill Amount table 410, $70K in Income table 410, and 2 in Number of Cars table 410).


The computer system can generate (440), based on record 430, one or more features 450 associated with the entity. A feature can be any discernable way of sorting or classifying the record (e.g., average value, most recent value, most common value, etc.). In some embodiments, the computer system can generate key value pairs, wherein each key value pair contains a feature and a value. For example, the computer system can generate one or more features 450 such as “average bill payment amount”, “average income”, “average number of automobiles”, etc. and corresponding values such as “$670”, “$73K”, “2.3 cars”, etc. In some embodiments, the one or more features 450 can be associated with a time value. For example, computer system can generate features for a specified temporal period (e.g., features can be based only on the most recent values). Feature values can be represented as a continuous value (e.g., $670), as a categorical value (e.g., “Sedan” or “Coupe”), as a textual value, or as any other type of value. In some embodiments, the one or more feature 450 can be stored as classified as weighted values. For example, a household income of $73,000 can be represented as weighted value of {0.27 0}, {0.73 100000}.


In some embodiments, the one or more features can be extrapolated from the information contained in the record. For example, a feature can be that the entity deactivated online payments (e.g. customer deactivated ETF payment on 2/20). In some embodiments, the one or more features can be related to communications between the providing entity (e.g., insurance provider) and consuming entity (e.g., household). For example, computer system 100 can analyze (e.g., tokenize) the transcript of a call between an agent and a household and assign a topical value to that call (e.g., “topic 5” corresponding to anger). Computer system 100 can store this information as a feature pair (not shown), such as the pair {“Service Call Topic” “5”}. In some embodiments, the one or more features can be related to whether the household took a specified action (e.g., filed a claim or called to change policy).


In some embodiments, the computer system can process (460) the one or more features 450 to determine the propensity 470 of the entity to take the specified action. In some embodiments, the propensity 470 can be determined by applying a trained model, such as the model described in greater detail in FIG. 3. The input to the model can be key value pairs of the one or more features 450 associated with the entity and the specified actions and the output of the model can be the propensity 470 of the entity to take the specified action. In some embodiments, processing the one or more features associated with the entity can result in a multitude of useful insights regarding the features that influence the propensity of the entity to take the specified action. Such insights, can include, for example, the features that are most influential on the propensity of the entity to take the specified action (e.g., change in income, etc.).


In some embodiments, the computer system can output the propensity 470. In some embodiments, the computer system can output the propensity 470 as a continuous value, such as a number or percentage (e.g., 80 or 80%) or as a categorical value (e.g., “low”, “medium”, or “high”). In some embodiments, the computer system can generate a user interface, such as the user interfaces described in greater detail in FIGS. 5 and 6 for displaying the propensity 470.



FIG. 5 illustrates an exemplary user interface 500 provided by a computer system (e.g., computer system 100) for display (e.g., display 122), in accordance with some embodiments. User interface 500 can include a plurality of tiles (e.g., tile 510), each tile representing an entity (e.g., a household). In some embodiments, tiles can be arranged according to the propensity of the entity to take the specified action. For example, entities that are more likely to take the specified action can be located near the top of the display, whereas entities that are less likely to take the specified action can be lower on the display. As shown in FIG. 5, in some embodiments, the tiles can be arranged by date (e.g., date 520). For example, entities with the most recent activities can be located near the top of the display. By way of example, tile 510 with the most recent date 520 of Feb. 21, 2014 is located in the top left corner of the display. The tile to the right of tile 510 has the next most recent date (e.g., Feb. 20, 2014). Subsequent tiles have dates that are less recent. In other embodiments, entities with the longest pending outstanding action can be located near the top of the screen.


In some embodiments, user interface 500 can be updated periodically (e.g., once a day, once a week, once a month, etc.). In other embodiments, user interface 500 can be updated when information associated with any of the entities stored in the one or more data sources is updated (e.g., a new entry, such as payment bill amount, is added to a table). In some embodiments, user interface 500 can update in response to an input received from the user.


User interface 500 can automatically determine the entities for which to generate the display. In some embodiments, user interface 500 can display entities associated with a particular user (e.g., John Smith, Triage Agent) once the user accesses user interface 500. In some embodiments, the user can specifically identify the entities for which to generate the display. In some embodiments, the user can identity a category or class of entities for which to generate the display. For example, the user can identify a class of entities that are all consumers of a specified provisioning entity (e.g., insurance company), the user input can identify entities that are located within a specified geographic region (e.g., all households within the state of Illinois), or the user input can identify any other category of entities (e.g., all households with an income over $100,000).


In some embodiments, user interface 500 can portray a date 520 (e.g., Feb. 21, 2014) associated with the entity in tile 510. Date 520 can correspond to the current date, the date that method 200 was last performed for that entity, the date that information in the one or more data sources associated with that entity was last updated, or the date that the user last viewed the tile associated with the entity. In some embodiments, user interface 500 can portray a propensity 540 of the entity to take the specified action (e.g., “Med”) in tile 510. For example, as shown in FIG. 5, user interface 500 can portray the propensity as a categorical value, such as “Med” in tile 510. In some embodiments, user interface 500 can portray tile 510 in a color (e.g., green for “low”, red for “high”, etc.) representing the propensity. In some embodiments, user interface 500 can portray the propensity in tile 510 as numerical value or as a percentage.


User interface 500 can portray recent activity 530 in tile 510. In some embodiments, the recent activity 530 can be entered by a user. By way of example, a recent activity could be that an “Agent called customer on 2/21 regarding discounts” as shown in tile 510. In some embodiments, user interface 500 can generate the recent activity based on the one or more features associated with the entity. For example, user interface 500 can display, “Customer registered an additional luxury vehicle on 2/18” in tile 510 responsive to this information being updated in the record associated with the entity. In some embodiments, tile 510 can portray important features 540 associated with the entity. For example, as shown in tile 510 of FIG. 5, these features can be “vehicle”, “discounts”, etc. In some embodiments, user interface 500 can recommend an action for the user to take (e.g., service call). In some embodiments, this recommendation can relate to the recent activity 530. A user can use this information to take preemptive action to prevent the entity from taking the specified action. By way of example, if the propensity of a household subscribing to an automobile insurance policy was high, the user could take remedial action (e.g., lower rate, contact customer to address customer concerns, etc.). In some embodiments user interface 500 can display a number uniquely identifying the entity (e.g., a policy number).


In some embodiments, user interface 500 can allow a user to click on tile 510 to access additional information associated with the entity. For example, a user can access user interface 600 shown in FIG. 6 below by clicking on one of the tiles shown in user interface 500 of FIG. 5. In some embodiments, user interface 600 can be inlaid over user interface 500. In some embodiments, user interface 600 can be a distinct user interface.


User interface 500 can also allow access to additional user interfaces (not shown) through the “INBOX,” “FLAGGED,” and “STATS” links shown at the top of user interface 500. The “INBOX” user interface can display messages between the user and other agents to track the remedial actions that were taken. The INBOX user interface can also be used to notify users of households with a higher likelihood of cancelling the subscription. The “FLAGGED” user interface can show customers (e.g., households) that the user believed were at risk for taking the specified action. For example, the FLAGGED user interface can contain a list of the households most likely to cancel their insurance policy. In some embodiments, these households can be selected manually by the user. In some embodiments, these households can be automatically populated if the propensity exceeds a predetermined threshold (e.g., the FLAGGED interface can be populated with all households with a “High” propensity). The FLAGGED user interface can allow the user to track remediation steps (e.g., contacting the household, changing policy, etc.). Households can remain in the FLAGGED user interface until their risk of taking the specified action has declined, the user has decided that the household is no longer at risk, or the specification action occurred (e.g., the household cancelled its subscription). The “STATS” interface can display metrics such as, for example, the rate at which the user was able to prevent the specified action from occurring categorized by action taken and the most common and/or trending issues.



FIG. 6 illustrates another exemplary user interface 600 provided by the computer system (e.g., computer system 100) for display (e.g., display 112) in accordance with some embodiments. In some embodiments, user interface 600 can be accessed by clicking on a tile (e.g., entity) in user interface 500. User interface 600 can portray a date 610 (e.g., Feb. 18, 2014) associated with the entity. Date 610 can correspond to the current date, the date that method 200 was last performed for that entity, the date that information in the one or more data sources associated with that entity was last updated, or the date that the user last viewed the tile associated with the entity. In some embodiments, user interface 600 can portray a propensity 620 of the entity to take the specified action. For example, as shown in FIG. 6, user interface 600 can portray propensity 620 as a categorical value, such as “Med.”. In some embodiments, user interface 600 can convey propensity 620 by shading the top bar in a different color (e.g., green for “low”, red for “high”, etc.) representing propensity 620. In some embodiments, user interface 600 can portray propensity 620 as numerical value or as a percentage. In some embodiments user interface 600 can display the entity status 630 (e.g., “Active” if the household is currently subscribing to a policy).


In some embodiments, user interface 600 can display recent activities 640 associated with the entity. For example, as shown in FIG. 6, user interface 600 can display that the “customer registered an additional luxury vehicle on 2/18”. User interface 600 can recommend an action 650 for the user to take (e.g., service call). In some embodiments, this recommendation 650 can relate to the recent activity.


User interface 600 can provide the user with additional information associated with the entity. As shown in the bottom left panel of FIG. 6, user interface 600 can display basic biographic information 660 for the entity. In the automobile insurance context, for example, user interface 600 can display the policy number, (e.g., 34726182), the entity name (e.g., household/owner of the policy, David Stark), the policy coverage start date (e.g., Dec. 12, 2004), any secondary owners associated with the policy (e.g., James Watson), information associated with the insured automobile (e.g., 2013 Cadillac Escalade), and the type of insurance policy (e.g., Standard).


In some embodiments, user interface 600 can also display information for an agent 670 associated with the entity. For example, the user interface 600 can display the name (e.g., Bruce Atherton) and contact information (e.g., 583 234-9172) of the agent. A user can use this information to take preemptive action to prevent the entity from taking the specified action. By way of example, if the propensity of churning for a household subscribing to an automobile insurance policy was high, the user could contact the agent to take remedial action (e.g., lower rate, address customer concerns, etc.).


In some embodiments, the right panel of FIG. 6, can display recent events 680 associated with the entity. For example, user interface 600 can display whether the entity status is active (e.g., whether the entity is currently subscribing to a policy) or whether the agent has taken any actions (e.g., called the household or subscriber). In some embodiments, user interface 600 can also allow the user and agent to converse in the right panel. For example, the user can click on the “ADD AN UPDATE” button 690 to remind the agent to contact the entity. The user interface can display responsive comments 680 from the agent and the agent can add any actions taken 680 (e.g., calling the household).


Embodiments of the present disclosure have been described herein with reference to numerous specific details that can vary from implementation to implementation. Certain adaptations and modifications of the described embodiments can be made. Other embodiments can be apparent to those skilled in the art from consideration of the specification and practice of the embodiments disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the present disclosure being indicated by the following claims. It is also intended that the sequence of steps shown in figures are only for illustrative purposes and are not intended to be limited to any particular sequence of steps. As such, it is appreciated that these steps can be performed in a different order while implementing the exemplary methods or processes disclosed herein.

Claims
  • 1. A system comprising: one or more processors; andmemory storing instructions that, when executed by the one or more processors, cause the system to: obtain information associated with a plurality of entities from one or more data sources;form a plurality of records associated with the plurality of entities by integrating the information from the one or more data sources, each of the plurality of records associated with a corresponding entity of the plurality of entities and comprising a plurality of data entries from a specific data source of the one or more data sources, wherein each of the plurality of records stores the plurality of data entries serially;filter the plurality of records for a subset of the information associated with a specified action and a specified temporal period;generate, based on the filtering, a record label for each of the plurality of records;generate a key value pair for each of the plurality of records, wherein the key value pair comprises a feature and a corresponding value, the feature indicating the corresponding value is an average value, and the corresponding value comprising an average value of the plurality of serially stored data entries from the specific data source;create a set of training data items, each training data item of the set of training data items comprising a corresponding key value pair of the generated key value pairs and a corresponding record label of the generated record labels;select a subset of the training data items;obtain a model using the subset of training data items, wherein the obtaining comprises constructing multiple models using the subset of training data items, each of the multiple models having a plurality of performance metrics, and selecting one of the multiple models based on one or more of the plurality of performance metrics;determine, using the model, a propensity of a particular entity of the plurality of entities to perform a specified action; andgenerate a graphical user interface indicating the propensity of the particular entity of the plurality of entities to perform a specified action.
  • 2. The system of claim 1, wherein each of the record labels indicate whether the corresponding entity performed the specified action within the specified temporal period.
  • 3. The system of claim 1, wherein the instructions further cause the system to determine, based on the trained model and a corresponding record of the plurality of records, a relative importance of the features.
  • 4. The system of claim 1, wherein the graphical user interface comprises a plurality of tiles, each of the plurality of tiles being associated with a corresponding entity of a subset of the plurality of entities.
  • 5. The system of claim 4, wherein a particular tile of the plurality of tiles is associated with the particular entity, and a placement of the particular tile of the plurality of tiles within the graphical user interface is based on the determined propensity of the particular entity to perform the specified action.
  • 6. The system of claim 5, wherein the instructions further cause the system to update the placement of the particular tile of the plurality of tiles within the graphical user interfaces in response to an update of the information.
  • 7. A method for determining a propensity of an entity to take a specified action, the method being performed by one or more processors and comprising: obtaining information associated with a plurality of entities from one or more data sources;forming a plurality of records associated with the plurality of entities by integrating the information from the one or more data sources, each of the plurality of records associated with a corresponding entity of the plurality of entities and comprising a plurality of data entries from a specific data source of the one or more data sources, wherein each of the plurality of records stores the plurality of data entries serially;filtering the plurality of records for a subset of the information associated with a specified action and a specified temporal period;generating, based on the filtering, a record label for each of the plurality of records;generating a key value pair for each of the plurality of records, wherein the key value pair comprises a feature and a corresponding value, the feature indicating the corresponding value is an average value, and the corresponding value comprising an average value of the plurality of serially stored data entries from the specific data source;creating a set of training data items, each training data item of the set of training data items comprising a corresponding key value pair of the generated key value pairs and a corresponding record label of the generated record labels;selecting a subset of the training data items;obtaining a model using the subset of training data items, wherein the obtaining comprises constructing multiple models using the subset of training data items, each of the multiple models having a plurality of performance metrics, and selecting one of the multiple models based on one or more of the plurality of performance metrics;determining, using the model, a propensity of a particular entity of the plurality of entities to perform a specified action; andgenerating a graphical user interface indicating the propensity of the particular entity of the plurality of entities to perform a specified action.
  • 8. The method of claim 7, wherein each of the record labels indicate whether the corresponding entity performed the specified action within the specified temporal period.
  • 9. The method of claim 7, further comprising determining, based on the trained model and a corresponding record of the plurality of records, a relative importance of the features.
  • 10. The method of claim 7, wherein the graphical user interface comprises a plurality of tiles, each of the plurality of tiles being associated with a corresponding entity of a subset of the plurality of entities.
  • 11. The method of claim 10, wherein a particular tile of the plurality of tiles is associated with the particular entity, and a placement of the particular tile of the plurality of tiles within the graphical user interface is based on the determined propensity of the particular entity to perform the specified action.
  • 12. The method of claim 11, further comprising updating the placement of the particular tile of the plurality of tiles within the graphical user interfaces in response to an update of the information.
  • 13. A non-transitory computer-readable medium storing a set of instructions that are executable by one or more processors to cause the one or more processors to perform a method, the method comprising: obtaining information associated with a plurality of entities from one or more data sources;forming a plurality of records associated with the plurality of entities by integrating the information from the one or more data sources, each of the plurality of records associated with a corresponding entity of the plurality of entities and comprising a plurality of data entries from a specific data source of the one or more data sources, wherein each of the plurality of records stores the plurality of data entries serially;filtering the plurality of records for a subset of the information associated with a specified action and a specified temporal period;generating, based on the filtering, a record label for each of the plurality of records;generating a key value pair for each of the plurality of records, wherein the key value pair comprises a feature and a corresponding value, the feature indicating the corresponding value is an average value, and the corresponding value comprising an average value of the plurality of serially stored data entries from the specific data source;creating a set of training data items, each training data item of the set of training data items comprising a corresponding key value pair of the generated key value pairs and a corresponding record label of the generated record labels;selecting a subset of the training data items;obtaining a model using the subset of training data items, wherein the obtaining comprises constructing multiple models using the subset of training data items, each of the multiple models having a plurality of performance metrics, and selecting one of the multiple models based on one or more of the plurality of performance metrics;determining, using the model, a propensity of a particular entity of the plurality of entities to perform a specified action; andgenerating a graphical user interface indicating the propensity of the particular entity of the plurality of entities to perform a specified action.
  • 14. The non-transitory computer-readable medium of claim 13, wherein each of the record labels indicate whether the corresponding entity performed the specified action within the specified temporal period.
  • 15. The non-transitory computer-readable medium of claim 13, wherein the graphical user interface comprises a plurality of tiles, each of the plurality of tiles being associated with a corresponding entity of a subset of the plurality of entities.
  • 16. The non-transitory computer-readable medium of claim 15, wherein a particular tile of the plurality of tiles is associated with the particular entity, and a placement of the particular tile of the plurality of tiles within the graphical user interface is based on the determined propensity of the particular entity to perform the specified action.
  • 17. The non-transitory computer-readable medium of claim 16, further comprising instructions executable by the one or more processors to cause the one or more processors to perform: updating the placement of the particular tile of the plurality of tiles within the graphical user interfaces in response to an update of the information.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of U.S. patent application Ser. No. 14/562,524, filed on Dec. 5, 2014, which claims priority to U.S. Provisional Patent Application No. 62/027,761, filed on Jul. 22, 2014, and U.S. Provisional Patent Application No. 62/039,305, filed on Aug. 19, 2014, the disclosures of which are expressly incorporated herein by reference in their entirety.

US Referenced Citations (341)
Number Name Date Kind
5418950 Li et al. May 1995 A
5428737 Li et al. Jun 1995 A
5428776 Rothfield Jun 1995 A
5542089 Lindsay et al. Jul 1996 A
5608899 Li et al. Mar 1997 A
5613105 Xbikowski et al. Mar 1997 A
5701456 Jacopi et al. Dec 1997 A
5724575 Hoover et al. Mar 1998 A
5794228 French et al. Aug 1998 A
5794229 French et al. Aug 1998 A
5857329 Bingham Jan 1999 A
5911138 Li et al. Jun 1999 A
5918225 White et al. Jun 1999 A
6208985 Krehel Mar 2001 B1
6236994 Swartz et al. May 2001 B1
6289334 Reiner et al. Sep 2001 B1
6311181 Lee et al. Oct 2001 B1
6321274 Shakib et al. Nov 2001 B1
6430305 Decker Aug 2002 B1
6643613 McGee et al. Nov 2003 B2
6745382 Zothner Jun 2004 B1
6820135 Dingman Nov 2004 B1
6851108 Syme et al. Feb 2005 B1
6857120 Arnold et al. Feb 2005 B1
6877137 Rivette et al. Apr 2005 B1
6976024 Chavez et al. Dec 2005 B1
6978419 Kantrowitz Dec 2005 B1
6980984 Huffman et al. Dec 2005 B1
7028223 Kolawa et al. Apr 2006 B1
7085890 Kashyap Aug 2006 B2
7155728 Prabhu et al. Dec 2006 B1
7168039 Bertram Jan 2007 B2
7216133 Wu et al. May 2007 B2
7406592 Polyudov Jul 2008 B1
7519589 Charnock et al. Apr 2009 B2
7546353 Hesselink et al. Jun 2009 B2
7610290 Kruy et al. Oct 2009 B2
7617232 Gabbert et al. Nov 2009 B2
7627489 Schaeffer et al. Dec 2009 B2
7756843 Palmer Jul 2010 B1
7783679 Bley Aug 2010 B2
7853573 Warner et al. Dec 2010 B2
7877421 Berger et al. Jan 2011 B2
7899796 Borthwick et al. Mar 2011 B1
7908521 Sridharan et al. Mar 2011 B2
7917376 Bellin et al. Mar 2011 B2
7941321 Greenstein et al. May 2011 B2
7979424 Dettinger et al. Jul 2011 B2
8036971 Aymeloglu et al. Oct 2011 B2
8046283 Burns Oct 2011 B2
8054756 Chand et al. Nov 2011 B2
8073857 Sreekanth Dec 2011 B2
8103962 Embley et al. Jan 2012 B2
8214490 Vos et al. Jul 2012 B1
8229902 Vishniac et al. Jul 2012 B2
8290838 Thakur et al. Oct 2012 B1
8302855 Ma et al. Nov 2012 B2
8417715 Bruckhaus et al. Apr 2013 B1
8429194 Aymeloglu et al. Apr 2013 B2
8433702 Carrino et al. Apr 2013 B1
8473454 Evanitsky et al. Jun 2013 B2
8484115 Aymeloglu et al. Jul 2013 B2
8499287 Shafi et al. Jul 2013 B2
8560494 Downing Oct 2013 B1
8589273 Creeden et al. Nov 2013 B2
8639552 Chen et al. Jan 2014 B1
8688573 Ruknoic et al. Apr 2014 B1
8744890 Bernier Jun 2014 B1
8799867 Peri-Glass et al. Aug 2014 B1
8812960 Sun et al. Aug 2014 B1
8909597 Aymeloglu et al. Dec 2014 B2
8924388 Elliot et al. Dec 2014 B2
8924389 Elliot et al. Dec 2014 B2
8924429 Fisher et al. Dec 2014 B1
8935201 Fisher et al. Jan 2015 B1
8938686 Erenrich et al. Jan 2015 B1
8949164 Mohler Feb 2015 B1
9031981 Potter et al. May 2015 B1
9100428 Visbal Aug 2015 B1
9105000 White et al. Aug 2015 B1
9129219 Robertson et al. Sep 2015 B1
9292388 Fisher et al. Mar 2016 B2
20020065708 Senay et al. May 2002 A1
20020095360 Joao Jul 2002 A1
20020095658 Shulman Jul 2002 A1
20020103705 Brady Aug 2002 A1
20020147805 Leshem et al. Oct 2002 A1
20020184111 Swanson Dec 2002 A1
20030004770 Miller et al. Jan 2003 A1
20030023620 Trotta Jan 2003 A1
20030036848 Sheha et al. Feb 2003 A1
20030105833 Daniels Jun 2003 A1
20030126102 Borthwick Jul 2003 A1
20030212670 Yalamanchi et al. Nov 2003 A1
20040034570 Davis Feb 2004 A1
20040088177 Travis et al. May 2004 A1
20040098731 Demsey et al. May 2004 A1
20040103088 Cragun et al. May 2004 A1
20040111480 Yue Jun 2004 A1
20040126840 Cheng et al. Jul 2004 A1
20040139212 Mukherjee et al. Jul 2004 A1
20040153418 Hanweck Aug 2004 A1
20040153837 Preston et al. Aug 2004 A1
20040193608 Gollapudi et al. Sep 2004 A1
20040236688 Bozeman Nov 2004 A1
20040254658 Sherriff et al. Dec 2004 A1
20040260702 Cragun et al. Dec 2004 A1
20050004911 Goldberg et al. Jan 2005 A1
20050010472 Quatse et al. Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050086207 Heuer et al. Apr 2005 A1
20050120080 Weinreb et al. Jun 2005 A1
20050154628 Eckart et al. Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050183005 Denoue et al. Aug 2005 A1
20050226473 Ramesh Oct 2005 A1
20050278286 Djugash et al. Dec 2005 A1
20060004740 Dettinger et al. Jan 2006 A1
20060026120 Carolan et al. Feb 2006 A1
20060070046 Balakrishnan et al. Mar 2006 A1
20060074967 Shaburov Apr 2006 A1
20060080616 Vogel et al. Apr 2006 A1
20060116991 Calderwood Jun 2006 A1
20060129992 Oberholtzer et al. Jun 2006 A1
20060142949 Helt Jun 2006 A1
20060143034 Rothermel Jun 2006 A1
20060143075 Carr et al. Jun 2006 A1
20060143079 Basak et al. Jun 2006 A1
20060209085 Wong et al. Sep 2006 A1
20060271884 Hurst Nov 2006 A1
20060288046 Gupta et al. Dec 2006 A1
20070000999 Kubo et al. Jan 2007 A1
20070005582 Navratil et al. Jan 2007 A1
20070011304 Error Jan 2007 A1
20070027851 Kruy et al. Feb 2007 A1
20070038646 Thota Feb 2007 A1
20070094248 McVeigh et al. Apr 2007 A1
20070113164 Hansen et al. May 2007 A1
20070150801 Chidlovskii et al. Jun 2007 A1
20070150805 Misovski Jun 2007 A1
20070156673 Maga Jul 2007 A1
20070168336 Ransil et al. Jul 2007 A1
20070178501 Rabinowitz et al. Aug 2007 A1
20070185867 Maga Aug 2007 A1
20070192281 Cradick et al. Aug 2007 A1
20070260582 Liang Nov 2007 A1
20070284433 Domenica et al. Dec 2007 A1
20080040275 Paulsen et al. Feb 2008 A1
20080069081 Chand et al. Mar 2008 A1
20080103996 Forman et al. May 2008 A1
20080126344 Hoffman et al. May 2008 A1
20080126951 Sood et al. May 2008 A1
20080155440 Trevor et al. Jun 2008 A1
20080196016 Todd Aug 2008 A1
20080201313 Dettinger et al. Aug 2008 A1
20080215543 Huang et al. Sep 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080243711 Aymeloglu et al. Oct 2008 A1
20080249983 Meisels et al. Oct 2008 A1
20080255973 El Wade et al. Oct 2008 A1
20080267386 Cooper Oct 2008 A1
20080313132 Hao et al. Dec 2008 A1
20090006150 Prigge et al. Jan 2009 A1
20090007056 Prigge et al. Jan 2009 A1
20090043762 Shiverick et al. Feb 2009 A1
20090055487 Moraes et al. Feb 2009 A1
20090076845 Bellin et al. Mar 2009 A1
20090083275 Jacob et al. Mar 2009 A1
20090094166 Aymeloglu et al. Apr 2009 A1
20090094217 Dettinger et al. Apr 2009 A1
20090106178 Chu Apr 2009 A1
20090112745 Stefanescu Apr 2009 A1
20090125359 Knapic May 2009 A1
20090125459 Norton et al. May 2009 A1
20090144747 Baker Jun 2009 A1
20090161147 Klave Jun 2009 A1
20090172674 Bobak et al. Jul 2009 A1
20090187546 Whyte et al. Jul 2009 A1
20090187548 Ji et al. Jul 2009 A1
20090187556 Ross et al. Jul 2009 A1
20090193012 Williams Jul 2009 A1
20090199047 Vaitheeswaran et al. Aug 2009 A1
20090248721 Burton et al. Oct 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090271343 Vaiciulis et al. Oct 2009 A1
20090282068 Shockro et al. Nov 2009 A1
20090299830 West et al. Dec 2009 A1
20090307049 Elliott et al. Dec 2009 A1
20090313463 Pang et al. Dec 2009 A1
20090319418 Herz Dec 2009 A1
20090319891 MacKinlay Dec 2009 A1
20100011282 Dollard et al. Jan 2010 A1
20100030722 Goodson et al. Feb 2010 A1
20100031141 Summers et al. Feb 2010 A1
20100042922 Bradateanu et al. Feb 2010 A1
20100057622 Faith et al. Mar 2010 A1
20100070464 Aymeloglu et al. Mar 2010 A1
20100070842 Aymeloglu et al. Mar 2010 A1
20100073315 Lee et al. Mar 2010 A1
20100082671 Li et al. Apr 2010 A1
20100098318 Anderson Apr 2010 A1
20100114887 Conway et al. May 2010 A1
20100131502 Fordham May 2010 A1
20100145902 Boyan et al. Jun 2010 A1
20100161646 Ceballos et al. Jun 2010 A1
20100161735 Sharma Jun 2010 A1
20100169376 Chu Jul 2010 A1
20100169405 Zhang Jul 2010 A1
20100191563 Schlaifer et al. Jul 2010 A1
20100199167 Uematsu et al. Aug 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100262688 Hussain et al. Oct 2010 A1
20100312837 Bodapati et al. Dec 2010 A1
20100313119 Baldwin et al. Dec 2010 A1
20110004498 Readshaw Jan 2011 A1
20110035396 Merz et al. Feb 2011 A1
20110041084 Karam Feb 2011 A1
20110061013 Bilicki et al. Mar 2011 A1
20110066497 Gopinath et al. Mar 2011 A1
20110074811 Hanson et al. Mar 2011 A1
20110078173 Seligmann et al. Mar 2011 A1
20110093327 Fordyce, III et al. Apr 2011 A1
20110093490 Schindlauer et al. Apr 2011 A1
20110099133 Chang et al. Apr 2011 A1
20110131547 Elaasar Jun 2011 A1
20110145401 Westlake Jun 2011 A1
20110153384 Horne et al. Jun 2011 A1
20110173093 Psota et al. Jul 2011 A1
20110208565 Ross et al. Aug 2011 A1
20110208822 Rathod Aug 2011 A1
20110213655 Henkin Sep 2011 A1
20110218955 Tang Sep 2011 A1
20110252282 Meek et al. Oct 2011 A1
20110258216 Supakkul et al. Oct 2011 A1
20110270604 Qi et al. Nov 2011 A1
20110270834 Sokolan et al. Nov 2011 A1
20110270871 He et al. Nov 2011 A1
20110289397 Eastmond et al. Nov 2011 A1
20110295649 Fine Dec 2011 A1
20110314007 Dassa et al. Dec 2011 A1
20110314024 Chang et al. Dec 2011 A1
20110321008 Jhoney et al. Dec 2011 A1
20120011238 Rathod Jan 2012 A1
20120011245 Gillette et al. Jan 2012 A1
20120022945 Falkenborg et al. Jan 2012 A1
20120053990 Pereg Mar 2012 A1
20120054284 Rakshit Mar 2012 A1
20120059853 Jagota Mar 2012 A1
20120066166 Curbera et al. Mar 2012 A1
20120078595 Balandin et al. Mar 2012 A1
20120079363 Folting et al. Mar 2012 A1
20120084117 Tavares et al. Apr 2012 A1
20120084287 Lakshminarayan et al. Apr 2012 A1
20120102022 Miranker et al. Apr 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120159362 Brown et al. Jun 2012 A1
20120159449 Arnold et al. Jun 2012 A1
20120173381 Smith Jul 2012 A1
20120174057 Narendra et al. Jul 2012 A1
20120188252 Law Jul 2012 A1
20120215784 King et al. Aug 2012 A1
20120221553 Wittmer et al. Aug 2012 A1
20120226523 Weiss Sep 2012 A1
20120245976 Kumar et al. Sep 2012 A1
20120284719 Phan et al. Nov 2012 A1
20120323888 Osann, Jr. Dec 2012 A1
20130014040 Jagannathan Jan 2013 A1
20130016106 Yip et al. Jan 2013 A1
20130024268 Manickavelu Jan 2013 A1
20130024731 Shochat et al. Jan 2013 A1
20130054306 Bhalla Feb 2013 A1
20130054551 Lange Feb 2013 A1
20130057551 Ebert et al. Mar 2013 A1
20130086482 Parsons Apr 2013 A1
20130096968 Van Pelt et al. Apr 2013 A1
20130096988 Grossman et al. Apr 2013 A1
20130110746 Ahn May 2013 A1
20130151453 Bhanot et al. Jun 2013 A1
20130166348 Scotto Jun 2013 A1
20130166480 Popescu et al. Jun 2013 A1
20130185245 Anderson Jul 2013 A1
20130185307 El-Yaniv et al. Jul 2013 A1
20130198624 Aymeloglu et al. Aug 2013 A1
20130225212 Khan Aug 2013 A1
20130226318 Procyk Aug 2013 A1
20130226944 Baid et al. Aug 2013 A1
20130232220 Sampson Sep 2013 A1
20130238616 Rose et al. Sep 2013 A1
20130246170 Gross et al. Sep 2013 A1
20130246537 Gaddala Sep 2013 A1
20130246597 Iizawa et al. Sep 2013 A1
20130208565 Castellanos et al. Oct 2013 A1
20130263019 Castellanos et al. Oct 2013 A1
20130282696 John et al. Oct 2013 A1
20130290825 Arndt et al. Oct 2013 A1
20130297619 Chandrasekaran et al. Nov 2013 A1
20130304770 Boero et al. Nov 2013 A1
20140012796 Petersen et al. Jan 2014 A1
20140012886 Downing et al. Jan 2014 A1
20140040371 Gurevich et al. Feb 2014 A1
20140058914 Song et al. Feb 2014 A1
20140068487 Steiger et al. Mar 2014 A1
20140074888 Potter et al. Mar 2014 A1
20140095509 Patton Apr 2014 A1
20140108074 Miller et al. Apr 2014 A1
20140108380 Gotz et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140115589 Marinelli, III et al. Apr 2014 A1
20140115610 Marinelli, III et al. Apr 2014 A1
20140123279 Bishop et al. May 2014 A1
20140136285 Carvalho May 2014 A1
20140143009 Brice et al. May 2014 A1
20140156527 Grigg et al. Jun 2014 A1
20140157172 Peery et al. Jun 2014 A1
20140164502 Khodorenko et al. Jun 2014 A1
20140189536 Lange et al. Jul 2014 A1
20140195515 Baker et al. Jul 2014 A1
20140214579 Shen et al. Jul 2014 A1
20140222521 Chait Aug 2014 A1
20140222793 Sadkin et al. Aug 2014 A1
20140229554 Grunin et al. Aug 2014 A1
20140244388 Manouchehri et al. Aug 2014 A1
20140258246 Lo Faro et al. Sep 2014 A1
20140344230 Krause et al. Nov 2014 A1
20140351070 Christner et al. Nov 2014 A1
20140358829 Hurwitz Dec 2014 A1
20140366132 Stiansen et al. Dec 2014 A1
20150073929 Psota et al. Mar 2015 A1
20150073954 Braff Mar 2015 A1
20150095773 Gonsalves et al. Apr 2015 A1
20150100897 Sun et al. Apr 2015 A1
20150106379 Elliot et al. Apr 2015 A1
20150112641 Faraj Apr 2015 A1
20150135256 Hoy et al. May 2015 A1
20150188872 White Jul 2015 A1
20150269030 Fisher et al. Sep 2015 A1
20150338233 Cervelli et al. Nov 2015 A1
20150379413 Robertson et al. Dec 2015 A1
20160004764 Chakerian et al. Jan 2016 A1
20160026923 Erenrich et al. Jan 2016 A1
20160055501 Mukherjee et al. Feb 2016 A1
Foreign Referenced Citations (30)
Number Date Country
102546446 Jul 2012 CN
103167093 Jun 2013 CN
102054015 May 2014 CN
102014103482 Sep 2014 DE
102014204827 Sep 2014 DE
102014204830 Sep 2014 DE
102014204834 Sep 2014 DE
1647908 Apr 2006 EP
2487610 Aug 2012 EP
2 634 745 Sep 2013 EP
2743839 Jun 2014 EP
2778986 Sep 2014 EP
2858018 Apr 2015 EP
2869211 May 2015 EP
2889814 Jul 2015 EP
2892197 Jul 2015 EP
2921975 Sep 2015 EP
2963595 Jan 2016 EP
2988258 Feb 2016 EP
2366498 Mar 2002 GB
2508503 Jan 2015 GB
2508293 Apr 2015 GB
1194178 Sep 2015 HK
622485 Mar 2015 NZ
616212 May 2015 NZ
616299 Jul 2015 NZ
WO 2000034895 Jun 2000 WO
WO 2005116851 Dec 2005 WO
WO 2010030917 Mar 2010 WO
WO 2013030595 Mar 2013 WO
Non-Patent Literature Citations (213)
Entry
Hatwar, Windows 8—style UI overtakes GUI, pp. 1-3 (Year: 2012).
“A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.
“A Tour of Pinboard,” <http://pinboard.in/tour> as printed May 15, 2014 in 6 pages.
“HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages.
“Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015.
“The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29.
Alur et al., “Chapter 2: IBM InfoSphere DataStage Stages,” IBM InfoSphere DataStage Data Flow and Job Design, Jul. 1, 2008, pp. 35-137.
Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.
Anonymous, “Frequently Asked Questions about Office Binder 97,” http://web.archive.org/web/20100210112922/http://support.microsoft.com/kb/843147 printed Dec. 18, 2006 in 5 pages.
Appacts, “Smart Thinking for Super Apps,” <http://www.appacts.com> Printed Jul. 18, 2013 in 4 pages.
Apsalar, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots <http://apsalar.com> Printed Jul. 18, 2013 in 8 pages.
Bae et al., “Partitioning Algorithms for the Computation of Average Iceberg Queries,” DaWaK 2000, LNCS 1874, pp. 276_286.
Ballesteros et al., “Batching: A Design Pattern for Efficient and Flexible Client/Server Interaction,” Transactions on Pattern Languages of Programming, Springer Berlin Heildeberg, 2009, pp. 48-66.
Bogle et al., “Reducing Cross-Domain Call Overhead Using Batched Futures,” SIGPLAN No. 29, (Oct. 10, 1994) pp. 341-354.
Bogle, Phillip Lee, “Reducing Cross-Domain Call Overhead Using Batched Futures,” May 1994, Massachusetts Institute of Technology, pp. 96.
Bouajjani et al., “Analysis of Recursively Parallel Programs,” PLDI09: Proceedings of the 2009 ACM Sigplan Conference on Programming Language Design and Implementation, Jun. 15-20, 2009, Dublin, Ireland, pp. 203-214.
Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10.
Capptain—Pilot Your Apps, <http://www.capptain.com> Printed Jul. 18, 2013 in 6 pages.
Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-css3-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015.
Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8.
Chazelle et al., “The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables,” SODA '04 Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 30-39.
Cohn, et al., “Semi-supervised clustering with user feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1 (2003): 17-32.
Countly Mobile Analytics, <http://count.ly/> Printed Jul. 18, 2013 in 9 pages.
Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679.
Delicious, <http://delicious.com/> as printed May 15, 2014 in 1 page.
DISTIMO—App Analytics, <http://www.distimo.com/app-analytics> Printed Jul. 18, 2013 in 5 pages.
Donjerkovic et al., “Probabilistic Optimization of Top N Queries,” Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp. 411-422.
Fang et al., “Computing Iceberg Queries Efficiently,” Proceedings of the 24th VLDB Conference New York, 1998, pp. 299-310.
Flurry Analytics, <http://www.flurry.com/> Printed Jul. 18, 2013 in 14 pages.
Goldstein et al., “Stacks Lazy Threads: Implementing a Fast Parallel Call,” Journal of Parallel and Distributed Computing, Jan. 1, 1996, pp. 5-20.
Google Analytics Official Website—Web Analytics & Reporting, <http://www.google.com/analytics.index.html> Printed Jul. 18, 2013 in 22 pages.
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages.
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32.
Han et al., “Efficient Computation of Iceberg Cubes with Complex Measures,” ACM Sigmod, May 21-24, 2001, pp. 1-12.
Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services”, HiPC 2006, LNCS 4297, pp. 277-288, 2006.
Ivanova et al., “An Architecture for Recycling Intermediates in a Column-Store,” Proceedings of the 35th Sigmod International Conference on Management of Data, Sigmod '09, Jun. 29, 2009, pp. 309.
Jacques, M., “An extensible math expression parser with plug-ins,” Code Project, Mar. 13, 2008. Retrieved on Jan. 30, 2015 from the internet: <http://www.codeproject.com/Articles/7335/An-extensible-math-expression-parser-with-plug-ins>.
Jenks et al., “Nomadic Threads: A Migrating Multithreaded Approach to Remote Memory Accesses in Multiprocessors,” Parallel Architectures and Compilation Techniques, 1996, Oct. 20, 1996, pp. 2-11.
Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608.
Karp et al., “A Simple Algorithm for Finding Frequent Elements in Streams and Bags,” ACM Transactions on Database Systems, vol. 28, No. 1, Mar. 2003, pp. 51Ð55.
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages.
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages.
Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21.
Kontagent Mobile Analytics, <http://www.kontagent.com/> Printed Jul. 18, 2013 in 9 pages.
Leela et al., “On Incorporating Iceberg Queries in Query Processors,” Technical Report, TR-2002-01, Database Systems for Advanced Applications Lecture Notes in Computer Science, 2004, vol. 2973.
Liu et al., “Methods for Mining Frequent Items in Data Streams: An Overview,” Knowledge and Information Systems, vol. 26, No. 1, Jan. 2011, pp. 1-30.
Localytics—Mobile App Marketing & Analytics, <http://www.localytics.com/> Printed Jul. 18, 2013 in 12 pages.
Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15.
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.
Mendes et al., “TcruziKB: Enabling Complex Queries for Genomic Data Exploration,” IEEE International Conference on Semantic Computing, Aug. 2008, pp. 432-439.
Mixpanel—Mobile Analytics, <https://mixpanel.com/> Printed Jul. 18, 2013 in 13 pages.
Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14.
Notice of Acceptance for New Zealand Patent Application No. 616212 dated Jan. 23, 2015.
Notice of Acceptance for New Zealand Patent Application No. 616299 dated Apr. 7, 2015.
Notice of Acceptance for New Zealand Patent Application No. 622485 dated Nov. 24, 2014.
Notice of Allowance for U.S. Appl. No. 13/411,291 dated Apr. 22, 2016.
Notice of Allowance for U.S. Appl. No. 13/657,635 dated Jan. 29, 2016.
Notice of Allowance for U.S. Appl. No. 13/657,656 dated May 10, 2016.
Notice of Allowance for U.S. Appl. No. 13/767,779 dated Mar. 17, 2015.
Notice of Allowance for U.S. Appl. No. 13/827,627 dated Apr. 11, 2016.
Notice of Allowance for U.S. Appl. No. 14/019,534 dated Feb. 4, 2016.
Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/254,757 dated Sep. 10, 2014.
Notice of Allowance for U.S. Appl. No. 14/254,773 dated Aug. 20, 2014.
Notice of Allowance for U.S. Appl. No. 14/304,741 dated Apr. 7, 2015.
Notice of Allowance for U.S. Appl. No. 14/319,161 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/323,935 dated Oct. 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/479,863 dated Mar. 31, 2015.
Notice of Allowance for U.S. Appl. No. 14/552,336 dated Nov. 3, 2015.
Notice of Allowance for U.S. Appl. No. 14/581,902 dated Nov. 13, 2015.
Notice of Allowance for U.S. Appl. No. 14/746,671 dated Jan. 21, 2016.
Official Communication for Australian Patent Application No. 2013237658 dated Feb. 2, 2015.
Official Communication for Australian Patent Application No. 2013237710 dated Jan. 16, 2015.
Official Communication for Australian Patent Application No. 2014201580 dated Feb. 27, 2015.
Official Communication for Canadian Patent Application No. 2807899 dated Jul. 20, 2015.
Official Communication for Canadian Patent Application No. 2807899 dated Oct. 24, 2014.
Official Communication for Canadian Patent Application No. 2828264 dated Apr. 11, 2016.
Official Communication for Canadian Patent Application No. 2828264 dated Apr. 28, 2015.
Official Communication for Canadian Patent Application No. 2829266 dated Apr. 1, 2016.
Official Communication for Canadian Patent Application No. 2829266 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 13157474.1 dated Oct. 30, 2015.
Official Communication for European Patent Application No. 14159175.0 dated Jul. 17, 2014.
Official Communication for European Patent Application No. 14159175.0 dated Feb. 4, 2016.
Official Communication for European Patent Application No. 14159464.8 dated Feb. 18, 2016.
Official Communication for European Patent Application No. 14159629.6 dated Sep. 22, 2014.
Official Communication for European Patent Application No. 14159629.6 dated Jul. 31, 2014.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.
Official Communication for European Patent Application No. 14200246.8 dated May 29, 2015.
Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015.
Official Communication for European Patent Application No. 15159520.4 dated Jul. 15, 2015.
Official Communication for European Patent Application No. 15181419.1 dated Sep. 29, 2015.
Official Communication for European Patent Application No. 15184764.7 dated Dec. 14, 2015.
Official Communication for German Patent Application No. 10 2013 221 052.3 dated Mar. 24, 2015.
Official Communication for German Patent Application No. 10 2013 221 057.4 dated Mar. 23, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Oct. 6, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Sep. 29, 2014.
Official Communication for Great Britain Patent Application No. 1404574.4 dated Dec. 18, 2014.
Official Communication for Netherlands Patent Application No. 2011613 dated Aug. 13, 2015.
Official Communication for Netherlands Patent Application No. 2011627 dated Aug. 14, 2015.
Official Communication for Netherlands Patent Application No. 2012417 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012421 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012437 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012438 dated Sep. 21, 2015.
Official Communication for New Zealand Patent Application No. 616299 dated Jan. 26, 2015.
Official Communication for New Zealand Patent Application No. 622414 dated Mar. 24, 2014.
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014.
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014.
Official Communication for New Zealand Patent Application No. 622484 dated Apr. 2, 2014.
Official Communication for New Zealand Patent Application No. 622485 dated Nov. 21, 2014.
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.
Official Communication for U.S. Appl. No. 13/411,291 dated Oct. 1, 2015.
Official Communication for U.S. Appl. No. 13/411,291 dated Jul. 15, 2015.
Official Communication for U.S. Appl. No. 13/608,864 dated Mar. 17, 2015.
Official Communication for U.S. Appl. No. 13/608,864 dated Jun. 8, 2015.
Official Communication for U.S. Appl. No. 13/657,635 dated Mar. 30, 2015.
Official Communication for U.S. Appl. No. 13/657,635 dated Oct. 7, 2015.
Official Communication for U.S. Appl. No. 13/657,656 dated May 6, 2015.
Official Communication for U.S. Appl. No. 13/657,656 dated Oct. 7, 2014.
Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014.
Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Oct. 9, 2015.
Official Communication for U.S. Appl. No. 13/827,627 dated Mar. 2, 2015.
Official Communication for U.S. Appl. No. 13/827,627 dated Oct. 20, 2015.
Official Communication for U.S. Appl. No. 13/827,627 dated Dec. 22, 2015.
Official Communication for U.S. Appl. No. 13/827,627 dated Aug. 26, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Mar. 4, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Aug. 6, 2015.
Official Communication for U.S. Appl. No. 14/019,534 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/019,534 dated Sep. 4, 2015.
Official Communication for U.S. Appl. No. 14/025,653 dated Mar. 3, 2016.
Official Communication for U.S. Appl. No. 14/025,653 dated Oct. 6, 2015.
Official Communication for U.S. Appl. No. 14/134,558 dated Oct. 7, 2015.
Official Communication for U.S. Appl. No. 14/141,252 dated Oct. 8, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Dec. 21, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Jan. 4, 2016.
Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.
Official Communication for U.S. Appl. No. 14/304,741 dated Mar. 3, 2015.
Official Communication for U.S. Appl. No. 14/304,741 dated Aug. 6, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Mar. 17, 2016.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 3, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Mar. 4, 2016.
Official Communication for U.S. Appl. No. 14/306,154 dated Feb. 1, 2016.
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 17, 2016.
Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015.
Official Communication for U.S. Appl. No. 14/451,221 dated Oct. 21, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Nov. 13, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated Mar. 21, 2016.
Official Communication for U.S. Appl. No. 14/463,615 dated May 21, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Dec. 9, 2015.
Official Communication for U.S. Appl. No. 14/479,863 dated Dec. 26, 2014.
Official Communication for U.S. Appl. No. 14/483,527 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Oct. 28, 2015.
Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Feb. 18, 2016.
Official Communication for U.S. Appl. No. 14/562,524 dated Sep. 20, 2016.
Official Communication for U.S. Appl. No. 14/562,524 dated Mar. 29, 2017.
Official Communication for U.S. Appl. No. 14/571,098 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 24, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015.
Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Oct. 29, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Jul. 30, 2015.
Official Communication for U.S. Appl. No. 14/746,671 dated Nov. 12, 2015.
Official Communication for U.S. Appl. No. 14/800,447 dated Dec. 10, 2015.
Official Communication for U.S. Appl. No. 14/800,447 dated Mar. 3, 2016.
Official Communication for U.S. Appl. No. 14/813,749 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/842,734 dated Nov. 19, 2015.
Official Communication for U.S. Appl. No. 14/877,229 dated Mar. 22, 2016.
Open Web Analytics (OWA), <http://www.openwebanalytics.com/> Printed Jul. 19, 2013 in 5 pages.
Piwik—Free Web Analytics Software, <http://piwik.org/> Printed Jul. 19, 2013 in18 pages.
Russell et al., “NITELIGHT: A Graphical Tool for Semantic Query Construction,” 2008, pp. 10.
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.
Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11.
Smart et al., “A Visual Approach to Semantic Query Design Using a Web-Based Graphical Query Designer,” 16th International Conference on Knowledge Engineering and Knowledge Management (EKAW 2008),ÊAcitrezza, Catania, Italy, Sep . Ê29-Oct. 3, 2008, pp. 16.
Stamos et al., “Remote Evaluation,” Journal ACM Transactions on Programming Languages and Systems (TOPLAS) vol. 12, Issue 4, Oct. 1990, pp. 537-564.
StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, <http://statcounter.com/> Printed Jul. 19, 2013 in 17 pages.
TestFlight—Beta Testing on the Fly, <http://testflightapp.com/> Printed Jul. 18, 2013 in 3 pages.
trak.io, <http://trak.io/> printed Jul. 18, 2013 in 3 pages.
Usermetrix, <http://usermetrix.com/android-analytics> printed Jul. 18, 2013 in 3 pages.
Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20.
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].
Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages.
Wikipedia, “Machine Code”, p. 1-5, printed Aug. 11, 2014.
Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748.
Wollrath et al., “A Distributed Object Model for the Java System,” Proceedings of the 2nd Conference on USENEX, Conference on Object-Oriented Technologies (COOTS), Jun. 17, 1996, pp. 219-231.
Related Publications (1)
Number Date Country
20180082305 A1 Mar 2018 US
Provisional Applications (2)
Number Date Country
62039305 Aug 2014 US
62027761 Jul 2014 US
Continuations (1)
Number Date Country
Parent 14562524 Dec 2014 US
Child 15689757 US