Micro-geographic aggregation system

Information

  • Patent Grant
  • 10580025
  • Patent Number
    10,580,025
  • Date Filed
    Thursday, September 27, 2018
    6 years ago
  • Date Issued
    Tuesday, March 3, 2020
    4 years ago
Abstract
The present disclosure describes systems and methods for automatically rolling-up data associated with one or more geographic units, such as ZIP+4 codes, such that the rollup comprises a minimum number of households to protect anonymity and ensure compliance with privacy regulations, while preserving variance of the underlying data associated with the geographic regions. Data attributes may include demographic data, socio-economic data, lifestyle segmentation, psychographic data, behavioral data, credit data, and other data. The rollup process may involve identifying one or more geographic units with a number of households below a minimum or threshold amount, applying filters to find candidate geographic units for rollup, scoring candidate geographic units to select best pairings for rollup, and repeating until the rollup group has at least the minimum number of households. The process may make trades off between granularity (e.g., number of households), proximity, and similarity of data attributes associated with each geographic unit.
Description
BACKGROUND

Geographic aggregation is a common approach to creating anonymous data from individual consumer or household data that may otherwise be too private to disclose. Units of geographic aggregation can be based on a variety of classification schemes with different levels of granularity, for example state, county, city or neighborhood.


SUMMARY

Postal codes are a popular choice for geographic aggregations, both for granularity and ease of use for marketing applications. In the United States, the US Postal Service assigns each deliverable address both a 5-digit “ZIP Code™” as well as a 9-digit, ZIP+4 code (or “ZIP9”), the latter generally defined in terms of a street address range. Many of these ZIP9 codes encompass only a small number of unique households. However, to protect privacy, a number of policies, rules and regulations have been enacted which may limit or restrict the use of data for ZIP9 codes which include too few households. The high degree of segmentation contributes to more variance in demographic, socio-economic, behavioral, and other data associated with ZIP and ZIP9 codes. Such variance in the data set may be desirable to some entities, such as marketers and certain consumers, who value targeted offers and advertising.


The present disclosure describes systems and methods for automatically combining or “rolling-up” data associated with one or more geographic region codes, in particular ZIP9 codes, such that the combination or “rollup” satisfies a minimum threshold of granularity (e.g., a minimum number of households) to protect anonymity and ensure compliance with privacy regulations or policies, while preserving variance of the underlying data associated with the geographic regions.


Some approaches to protect anonymity and ensure compliance with privacy regulations may involve suppressing or removing certain data which do not comply with privacy rules (e.g., by removing a “non-compliant” ZIP9 from a data set, wherein the non-compliant ZIP9 has a number of households less than a required minimum). Other approaches may involve applying default values to non-compliant ZIP9s, or analyzing data at a different ZIP-level which more frequently satisfies minimum number of household requirements, such as the 5-digit ZIP code or the first 7 digits of the ZIP+4 code.


However, such approaches may have drawbacks which can include less accurate overall data, loss of granularity, and/or loss of variance which may be of interest in certain cases where specificity of data carries high value, such as in direct-mail marketing campaigns and similar targeted advertising efforts. This may be particularly true when certain data attributes associated with a particular ZIP9 are skewed, such as the case may be with respect to household wealth which is correlated to ZIP9s having smaller number of households. Thus, in some cases more granular data (e.g., at the ZIP9 level or as close to the ZIP9 level as permissible to maintain privacy and anonymity) is not only more valuable, but may even be essential in order to provide an indication of useful information that data at the ZIP5 or ZIP7 level do not provide.


The methods and processes described in the present disclosure provide an algorithm for rolling-up ZIP9 codes that trades off between granularity (e.g., to keep the number of households in a rolled-up ZIP9 group as small as possible), proximity (e.g., to group ZIP9s which are within a certain geographic distance of each other as much as possible given other constraints and criteria), and/or similarity of data attributes associated with each ZIP9. Data attributes may include, but are not limited to, demographic data, socio-economic data, psychographic data, behavioral data, credit data including aggregated and/or anonymized credit statistics, wealth data, and/or other similar types of data. One example of socio-economic data or lifestyle segmentation which will be referred to in examples throughout this disclosure is Experian's MOSAIC® service; however, any other segmentation data may be used as data attributes for identifying similar ZIP9s or households.


At a high level, the rollup process executed by the micro-geographic aggregation system 100 operates by identifying one or more geographic units (e.g., ZIP codes, ZIP5s, ZIP7s, ZIP9s, census tract data, street address ranges, grid-based geographic regions corresponding to a map, and any other finite geographic area) having a number of households below a minimum or threshold amount. Then, data filters may be applied in order to find or determine which geographic units are candidates for rollup. For example, data filtering may be applied to filter out or remove ZIP9s which are dissimilar based on one or more attributes (e.g., average assets, MOSAIC® code, and so on). Once the geographic unit candidates are identified, the rollup process scores the candidates and selects one or more with the best scores for rollup or pairing. For example, the candidate ZIP9s may be scored relative to a target ZIP, ZIP7, ZIP9 or relative to each other (e.g., pairwise) in order to identify strong potential for rollup (e.g., combination or grouping of two or more ZIP9s). Once a rollup group has been created, identified, or updated, the rollup process combines the number of households for each constituent geographic unit to determine a number of households in the rollup group. If the number of households in the rollup group is less than the minimum or threshold amount, the rollup process may repeat recursively or indefinitely until the identified geographic units have been rolled up into respective rollup groups with at least the minimum number of households.


The rollup algorithm or processes described herein can be applied to any set of one or more target variables and one or more explanatory variables relating to ZIP data attributes, such that as ZIP9s are evaluated for possible combination in a rollup, the similarity and/or trade-offs between associated target variables and associated explanatory variables are weighted. The examples herein will use average assets as an example target variable, and MOSAIC® codes as an example explanatory variable. However, in general any type of target variable and/or explanatory variable may be used, depending on the embodiment, the particular context, and/or a particular request from a requesting entity. A target variable is generally understood to be a continuous variable such as a specific number or amount, while an explanatory variable may generally be a category or classification variable which may represent, for example, general characteristics or attributes of members of the category or classification which may not correspond directly to a numeric value.


The micro-geographic aggregation system may apply the rollup process to data of different granularities, for different geographic regions, across a wide variety of data attributes. The micro-geographic aggregation system may provide a requesting entity with the ability to dynamically query consumer data on the fly in a customized manner, simultaneously obscuring private data to protect anonymity while providing high-value and insightful data for use in intelligent and customized marketing. While ZIP9s are discussed herein, the systems and methods discussed herein are equally applicable to other geographic unit comprising groupings of households or individuals.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a map illustrating one example of challenges posed by ZIP9 fragmentation for a small geographic region which the geographic unit rollup processes described herein are designed to address.



FIG. 2 is a flowchart of a process for rolling up one or more geographic units, such as ZIP9 codes, together into a rollup group, using the micro-geographic aggregation system of FIG. 8.



FIG. 3 is a flowchart of a process for combining one or more geographic units, such as ZIP9 codes, together into one or more rollup groups, using the micro-geographic aggregation system of FIG. 8.



FIG. 4 is a flowchart of a process for identifying, scoring and selecting one or more geographic units, such as ZIP9 codes, for inclusion in a rollup group, using the micro-geographic aggregation system of FIG. 8.



FIG. 5A illustrates an example user interface which enables an end user, such as a third party requesting entity, to submit customized rollup filters and data requests, as generated using the micro-geographic aggregation system of FIG. 8.



FIG. 5B illustrates an example user interface which enables an end user, such as a third party requesting entity, to view rollup maps and/or output lists generated in response to a rollup request, as using the micro-geographic aggregation system of FIG. 8.



FIG. 6 illustrates an example geographic unit rollup output which may be provided by the rollup processes described herein, using the micro-geographic aggregation system of FIG. 8.



FIG. 7 illustrates an example of how different map data sources may have different and/or conflicting map latitude/longitude (“lat/long”) coordinates for geographic units, such as ZIP codes, which may need to be reconciled to improve accuracy of a geographic unit rollup process.



FIG. 8 is a block diagram of an implementation of an illustrative micro-geographic aggregation system.





DETAILED DESCRIPTION

Embodiments of a micro-geographic aggregation system will now be described with reference to accompanying figures, wherein like numerals refer to like elements throughout. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of certain specific embodiments of the disclosure. Furthermore, embodiments of the disclosure may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the embodiments of the disclosure herein described.


Overview


Generally described, a micro-geographic aggregation system is a computer system that automatically and optimally determines combinations, aggregations, or “rollups” of geographic units, such as ZIP9 codes, in order to satisfy a minimum or threshold number of households which may be required, for example, to preserve anonymity of the constituent households associated with each ZIP code.


One example embodiment of a micro-geographic aggregation system is the micro-geographic aggregation system 100 shown in FIG. 8. The micro-geographic aggregation system 100 may include one or more sub-systems, engines, or modules such as a geographic unit mapping engine 121, a geographic unit rollup engine 122, and/or a user interface module 123, configured to perform the methods and processes described herein. The micro-geographic aggregation system 100 may also access or be in communication with one or more data sources, including geographic unit/mapping data sources 166A and/or consumer data sources 166B. Each of these systems and components is described in more detail with reference to FIG. 8 herein.



FIG. 1 is an example map that illustrates certain challenges posed by geographic units (e.g., ZIP9s) of disparate size and other characteristics for a small geographic region which the geographic unit rollup processes described herein are designed to address. The map shows several ZIP9 area codes for a particular region, each of which has been outlined to show the varying number of households within each ZIP9. Corresponding to each ZIP9 is an average quantity of assets for that ZIP9 (which may be known, for example, based on consumer level data accessed from the consumer data source 166B). Such granular data may be of particular interest to an investment company, for example, which may want to target particular ZIP codes or households within a certain asset range or above a certain asset threshold. However, as the map of FIG. 1 shows, many of these ZIP9 codes include less than four households, and in some cases only one or two households. To protect the privacy of these households, while preserving the value in the data variance across ZIP9 codes in this region, the micro-geographic aggregation system 100 can analyze attributes of the ZIP9 codes in the area, identify potential ZIP9 codes for combination based on similarity, and rollup these ZIP9 codes into a rollup group which meets a minimum number of households threshold and with similar average assets and/or other attributes. Thus, for example in FIG. 1, ZIP9 codes 1231 (one household, $100K assets), 1232 (two households, $110K average assets), and 1233 (three households, $90K average assets) may be rolled up to create a rollup group with a combined household total of six and an average asset attribute of $98K. ZIP9 codes 1237 (three households, $60K average assets) and 1238 (three households, $85K assets) also might be eligible for rollup if the minimum number of households is four; however, these ZIP9s may not be rolled up together in some instances if, for example, the difference in average assets (e.g., $85k vs $60k) is relatively too high to be considered similar enough for rollup grouping. This determination will depend on the particular embodiment or implementation of the rollup algorithm and various criteria for filtering and rollup that are applied. Or, in alternate example, ZIP9s 1233 and 1238 might be considered for possible rollup together since they have similar average assets values ($90k and $85k respectively). FIG. 1 also illustrates a couple of ZIP9s (e.g., 1236 and 1239) with at least five households, and thus these ZIP9s may not need to be rolled-up or aggregated in cases where the minimum number of households is five. Instead, each of these ZIP9s may not be rolled up or, in one embodiment, may be assigned to a rollup “group” which comprises only the respective ZIP9 (e.g., a “singleton”).


Examples of Methods Performed by a Micro-Geographic Aggregation System



FIGS. 2, 3, and 4 are flowcharts for various embodiments of micro-geographic aggregation system processes. In some implementations, the processes are performed by embodiments of the micro-geographic aggregation system 100 described with reference to FIG. 8 or by one or more of its components, such as the geographic unit mapping engine 121, geographic unit rollup engine 122, and/or user interface module 123. The example scenarios are intended to illustrate, but not to limit, various aspects of these systems and/or services. In one embodiment, the processes can be dynamic, with some procedures omitted and others added. In one example, multiple instances of the processes may occur concurrently, for different micro-geographic aggregation systems. Depending on the embodiment, the methods may include fewer or additional blocks and/or the blocks may be performed in an order different than illustrated.



FIG. 2 is a flowchart illustrating one embodiment of a high-level process 200 for combining one or more geographic units, such as ZIP codes, together into a rollup group. The process 200 may be executed, for example, by the geographic unit rollup engine 122 of the micro-geographic aggregation system 100 of FIG. 8.


At block 205, the micro-geographic aggregation system 100 identifies, from a set of geographic data, one or more geographic units with a number of households below a minimum threshold, such as within a geographic area of interest (e.g., a city or state that is the target of a marketing campaign) to a company that is requesting geographically aggregated data. For example, the minimum threshold may be a value provided by a requesting entity or client using the micro-geographic aggregation system 100. The minimum threshold may also be a minimum required by government (e.g., Federal, state, municipality, etc.) rules and regulations, including consumer privacy regulations. The one or more geographic units may also be identified based on proximity to each other or to a geographic unit that has been selected for potential rollup, or based on other attributes as will be discussed in more detail herein. As a specific example, at block 205 the micro-geographic aggregation system may find 5 ZIP9 codes with 5 or fewer households per ZIP9.


At block 210, the micro-geographic aggregation system 100 applies filters to the set of geographic data and the geographic units in order to find candidates for potential rollup or aggregation. Filters may be applied, for example, in order to remove those candidate ZIP codes which are not close enough in proximity (e.g., geographic distance), not similar enough based one or more attributes of interest (e.g., average assets per household, lifestyle characteristics or attributes as reflected in, for example, a MOSAIC® code, etc.), or on other criteria. In some embodiments, the filters may be accessed from the data sources 166A or 166B, or otherwise be preconfigured by the micro-geographic aggregation system 100. In another embodiment, such as the example process 300 illustrated and described with reference to FIG. 3 herein, the filters may be accessed from or provided by a requesting entity system 164 as part of a rollup request.


At block 215, the micro-geographic aggregation system 100 scores each of the candidate geographic units in order to select the best candidate for a rollup group. Scoring of the candidate geographic units may be performed a number of different ways depending on the embodiment or implementation. The scoring may be performed relative to a target or base reference geographic unit (or a rollup group), such that each candidate may be compared on the same basis. One example of how the scoring may be performed is discussed in further detail herein with respect to block 435 of FIG. 4. In one embodiment, more than one candidate may be selected. For example, to improve speed or efficiency of processing, the two best scoring candidates may be selected for inclusion in a rollup group. Once the best scoring candidate(s) have been selected, the candidate(s) are combined with the base reference geographic unit to form a new rollup group, or added to a base reference rollup group if one exists.


At block 220, the micro-geographic aggregation system 100 determines whether the rollup group has a combined number of households below the minimum threshold. In response to a determination that the number of households in the rollup group is still below the minimum threshold, the process 200 returns to block 205 to repeat block 205 to block 220. In response to a determination that the number of households in the rollup group is above or equal to the minimum threshold, the process 200 can proceed to block 225.


At block 225, the micro-geographic aggregation system 100 provides the rollup group as output, for example to another process of the micro-geographic aggregation system 100 or to a requesting entity system 164. For example, after the rollup process is finished, a rollup ID (or “roll ID”) of “0” may be assigned to each ZIP9 that did not need grouping (e.g., a singleton) to indicate that the singleton is not associated with any rollup group. Then, the output may be provided in a number of different formats. For example, in one embodiment, the list may be provided as a list of ZIP9's and associated roll IDs, along with one or more attributes or metrics of interest for the ZIP9 (e.g., average assets per household, number of households, MOSAIC® code, etc.). In another embodiment, the list may be provided as a list of roll IDs with a list of one or more associated ZIPs in the rollup group, along with one or more attributes or metrics of interest or related to the rollup (e.g., average assets for the group, total number of households for the group, MOSAIC® code(s) for the group, etc.). One example of a rollup output is illustrated and described with reference to FIG. 6 herein.



FIG. 3 is a flowchart illustrating one embodiment of a high-level process 300 for combining one or more geographic units (e.g., ZIP9 codes) together into a rollup group. The process 300 may be executed, for example, by the geographic unit rollup engine 122 of the micro-geographic aggregation system 100 of FIG. 8.


The process 300 involves similar routines as those described with reference to process 200 of FIG. 2, but presents alternatives which may be implemented in some embodiments of the micro-geographic aggregation system 100. For example, process 300 involves receiving one or more filter parameters or criteria, such as from a requesting entity system 164, related to ZIP code attributes (e.g., at block 310). The filters may be applied in a similar process as described at block 210 of FIG. 2, but the example process 300 illustrates how these filters may be custom filters provided by a third party requesting entity, such as a company that wishes to obtain aggregated or rolled-up ZIP9 data based on filter criteria or business rules which are tailored to, for example, its particular type of business or its particular business requirements. For example, an investment or financial services firm might be interested in filtering ZIP9 data based on certain financial metrics like average assets per household, average debt/liabilities per household, and the like. Or, in another example, a credit account servicing firm (e.g. a credit card company) might be interested in filtering ZIP9 data based on certain metrics like average credit score per household, average number of pre-college or post-college children per household, and the like. The micro-geographic aggregation system 100 may be configured to enable all such examples of custom filtering via the process 300.


In some embodiments, filters and/or filter criteria may not be used at all, for example depending on the number of candidate ZIP codes identified for potential rollup. For example, if a small number of candidate geographic units are identified, it may be unnecessary or undesirable to filter the list and instead score each candidate in an unfiltered list. If a large number of candidate geographic units are identified, it may be necessary or desirable to filter the list and score only a subset of the candidates. For example, in some embodiments, the number of candidate geographic units may number in the hundreds, thousands, or more, and therefore filtering the list may be of particular benefit to improve speed and efficiency due to the overall complex and computationally intense rollup aggregation process. To further illustrate these alternative embodiments, the process 300 of FIG. 3 omits the optional filtering routine (e.g., applying filters as described in other embodiments, such as at block 210 of FIG. 2 or at block 430 of FIG. 4).


At block 305, the micro-geographic aggregation system 100 accesses a list of target geographic units and related attribute data for potential rollup aggregation. In one embodiment, the list of target geographic units may be accessed from geographic unit/mapping data source 166A. Related ZIP code attribute data may be accessed from the consumer data source 166B, which may store for example consumer and/or socio-economic data associated with the geographic units. In another embodiment, the list of target geographic units may be provided by a requesting entity, for example as part of request to perform a rollup operation. The list of target geographic units may be, for example, one or more ZIP9 codes, each of which has a number of households below a threshold.


At block 310, the micro-geographic aggregation system 100 receives one or more filter parameters related to the geographic units' attribute data. For example, the filters may be accessed from or provided by a requesting entity system 164 as part of a rollup request.


At block 315, the micro-geographic aggregation system 100 selects a target geographic unit from the list for rollup aggregation. In one embodiment, before the target geographic unit is selected from the list, the list may be sorted by one or more sorting criteria to facilitate processing of the list. For example, the list of targets may be sorted by the number of households in each target geographic unit with the smallest number at the top of the list. This would then ensure that the rollup algorithm would first attempt to rollup those geographic units with the smallest number of households.


At block 320, the micro-geographic aggregation system 100 determines a rollup group comprising one or more geographic units for rollup aggregation with the target geographic units. This rollup process may be performed, for example, by the process 400 illustrated and described in more detail with reference to FIG. 4 herein.


At block 325, the micro-geographic aggregation system 100 determines whether there are additional target geographic units in the list to rollup. In response to a determination that there are additional target geographic units in the list to rollup, the process 300 returns to block 315 and the micro-geographic aggregation system 100 selects the next target from the list for rollup. If there are not additional targets in the list to rollup, the process 300 may proceed to block 330.


At block 330, the micro-geographic aggregation system 100 provides the rollup group or groups as output, for example to another process of the micro-geographic aggregation system 100 or to a requesting entity system 164. This process is similar to the process described at block 225 of process 200 shown in FIG. 2 herein.



FIG. 4 is a flowchart illustrating one embodiment of a process 400 for combining one or more geographic units, such as ZIP9 codes, together into a rollup group. The process 400 may be executed, for example, by the geographic unit rollup engine 122 of the micro-geographic aggregation system 100 of FIG. 8. The process 400 may be for example a sub-routine which is invoked as part of the process 300 of FIG. 3, for example at block 320, to execute a particular embodiment of the rollup process. In particular, the process 400 includes several decision blocks and alternative approaches to perform the rollup depending on the underlying ZIP code data, the number of ZIP codes found matching various rollup conditions (e.g., proximity, granularity, filter criteria or conditions for attribute data associated with the geographic units, and so on). Depending on the particular embodiment, the process 400 may be performed independently from the process 300, separately or in parallel to process multiple geographic unit rollups for a plurality of candidate geographic units.


At block 405, the micro-geographic aggregation system 100 determines or identified one or more candidate geographic units (e.g., ZIP9 codes) within a geographic distance of a selected target ZIP code. In one implementation, the geographic distance may be set or preconfigured to a certain radius that may be optimal based on the geographic region of the selected target geographic unit. For example, the geographic distance may be larger if the target is in a remote or rural geographic location that is likely to have a small number of candidates within a large area. Or, the geographic distance may be smaller if the target is in a densely populated geographic location that is likely to have a large number of candidates within a small area. The geographic distance may also be based on other conditions such as the average number of geographic units within different radius values. In one example embodiment, the geographic distance may initially be set to 0.75 miles. The micro-geographic aggregation system 100 may access data from geographic unit/mapping data source 166A in order to identify all ZIP9 codes within the geographic distance of the selected target ZIP9 code, and use the identified ZIP9 codes as candidates for rollup or aggregation with the selected target ZIP9 code.


Finding all geographic units within a geographic distance of a selected target geographic unit may be done in various ways. In one embodiment, a two-step block search approach may be used to efficiently find all ZIP9s for a given radius. First, given the latitude/longitude coordinates for the lower left (A) and upper right corner (B) of the United States, create a grid with 1° latitude×1° longitude blocks. Then, for each 1×1 block, find all the ZIP9's that belong to or fall within the block to create a mapping or index of ZIP9s-to-blocks. For ZIP9s which overlap more than one block, the ZIP9 may be assigned to the block with the greatest degree of overlap. This information may be saved for use in subsequent block searches and need not be repeated every time. Second, to find all ZIP9's within a certain distance of a given ZIP code, from the given ZIP code's latitude/longitude coordinates and radius R, calculate the latitude/longitude coordinates for the lower left (C) and upper right (D) corner of a bounding box on the grid. Then, the index of the blocks to which points C&D belong may be used to determine which ZIP9s are within the given radius, based on the mapping of ZIP9s-to-blocks created before. The initial search range could then be confined to the only the blocks within the C&D index instead of the whole universe of ZIP9's across the United States.


In one embodiment, at block 405 the micro-geographic aggregation system 100 may also, or instead, determine one or more candidate ZIP9 rollups within the geographic distance of the selected target ZIP9 code. This may be the case, for example, if and when the process 400 iteratively repeats block 405 through block 445 to generate rollups dynamically using a “local optimum” or “greedy” algorithm approach. For example, on a first iteration of the process 400, a candidate ZIP9 code list might include three ZIP9 codes with a number of households equal to 1, 2, and 3. At the end of a first iteration, the first candidate ZIP9 code may be selected for inclusion in a rollup with the selected target ZIP9 code, and the rollup may be added back to the candidate list for further potential rollup (e.g., if the combined number of households in the rollup is still less than the minimum threshold). Then, on a subsequent iteration of the process 400, the rollup may be included on the candidate list and potentially be selected for inclusion with another candidate ZIP9 code or selected target ZIP9 code. In some embodiments, rollups may have been previously determined and stored along with other ZIP code/mapping data at data source 166A, and retrieved or accessed in subsequent executions of the rollup process 400.


Next at block 410, the micro-geographic aggregation system 100 determines whether there is at least one candidate geographic unit identified or found within the geographic distance at block 405. In response to determining that there are no candidate ZIP codes identified, the process 400 may proceed to block 415. In response to determining that there is at least one candidate ZIP code identified, the process 400 may proceed to block 420.


At block 415, the micro-geographic aggregation system 100 enlarges the geographic distance in order to locate at least one candidate geographic unit within a range of the selected target geographic unit. For example, in one embodiment the geographic distance may be increased to an amount equal to the original distance multiplied by the square root of 2 (or any other distance which may be optimal or otherwise desired). As with the routine performed at block 405, the amount by which the geographic distance is to be increased may depend on the geographic region associated with the selected target geographic unit. For example, for a rural geographic region, the geographic distance may be increased by a larger amount in order to increase the likelihood of finding at least one candidate. Once the geographic distance has been enlarged, the process 400 may return to block 405 and begin the rollup process again. The process 400 may repeat blocks 405, 410, and 415 iteratively an indeterminate amount of times until at least one candidate geographic unit is identified.


At block 420, the micro-geographic aggregation system determines whether two or more candidate geographic units identified or found within the geographic distance at block 405. In response to determining that only one candidate ZIP code has been identified, the process 400 may proceed to block 425. If two or more one candidate ZIP codes have been identified, the process 400 may proceed to block 430.


At block 425, the micro-geographic aggregation system 100 selects the identified candidate geographic unit for inclusion in a geographic unit rollup with the selected target ZIP code. The process 400 may then proceed to block 445.


At block 430, the micro-geographic aggregation system 100 applies one or more filter criteria to the candidate geographic units in order to remove candidates which do not satisfy the filters, based at least in part on data associated with the candidate geographic units. In an embodiment the desired output of block 430 is a list of candidate ZIP9 codes with a relatively high degree of similarity to the selected target ZIP9 code (e.g., filter out ZIP9s with low similarity based on certain attributes). Data associated with the candidate geographic units may be accessed by the micro-geographic aggregation system 100 for example from geographic unit/mapping data sources 166A. In one embodiment, filter criteria may be preconfigured or optimized, for example based on criteria which may be known or learned over time (e.g., over multiple rollup processes/iterations) via a learning algorithm. In another embodiment, filter criteria may be selectable or configurable by an end user, such as a requesting entity 164, and received by the micro-geographic aggregation system 100, for example via a user interface, such as the user interface shown in FIG. 5A, which may be provided as part of a web service.


A particular example of how filter criteria or rules may be applied to remove candidate geographic units from the list for potential inclusion in the rollup is provided as follows. Consider a scenario in which an average assets per household is the target variable, and a MOSAIC® code is the explanatory variable. For the average assets variable, a filter or rule may be applied to remove any candidate ZIP9 codes which are not within a certain percent (e.g., 20%) or range (e.g., plus or minus $5,000) of the average assets associated with the target ZIP code. In some instances the rollup algorithm may be configured to automatically treat asset values below a minimum amount as the minimum amount (e.g., treat any asset value below $5,000 as $5,000 for purposes of rollup aggregation). For the MOSAIC® code variable, a filter may be applied to remove any candidate ZIP9 codes which do not have the same category or sub-category (e.g., the same letter group) of the MOSAIC® code associated with the target ZIP9 code. In some instances the rollup algorithm may be configured to automatically remove any candidate ZIP9 code which does not have an associated MOSAIC® code. The geographic distance may also be considered another type of filter criteria or rule that is based on proximity (e.g., initially only candidate ZIP9 codes within a certain radius of the target ZIP9 code may be considered for potential rollup).


Other types of filter criteria or rules may be applied to any other attribute of consumer and or socio-economic data associated with geographic units, depending on the embodiment, or on the requirements of the requesting entity 164. Other filter criteria may be based on, for example, average credit scores per household, average number of children per household, average income per household, average liabilities per household, average number of identity theft or fraud incidents, and any other attribute described herein including socio-economic demographics, lifestyle segments, and the like. For example, a requesting entity may wish to customize an offer to enroll in a credit identity monitoring service, but only target those households in ZIP9 codes corresponding to relatively higher incidents of identity theft or fraud. Thus in this example filter criteria may be applied to remove candidate ZIP9 codes from potential rollup which have a lower average of identity theft or fraud incidents, since the corresponding households fall outside the range of the desired target demographic.


Once the initial candidate list has been filtered according to the process at block 430 (or a similar filtering process), then at block 435, the micro-geographic aggregation system 100 scores the remaining candidates, based at least in part on data associated with the candidate geographic units. Depending on the embodiment, the scoring may be performed using any type of scoring algorithm which may be preferred. In some embodiments the scoring algorithm may be selected or provided by a requesting entity 164, which may have one or more business rules or preferences for how geographic unit similarity or dissimilarity is to be evaluated, assessed, and/or scored. In general, any scoring routine which analyzes and/or evaluates the attributes associated with the candidate geographic units, optionally performs some tradeoff calculations and weighting to determine an output score for each candidate geographic unit in a consistent manner to support reliable decision making and “best score” selection may be used. Scores may be calculated in any format including a numeric score, a letter score or grade (e.g., A-F), a percentage, a range, and the like. In one embodiment, a scoring algorithm may employ a weighted sum of exponential functions that penalize (i) the distance between two candidate geographic units, (ii) a difference (or a degree of difference) in the values of the respective target variables, (iii) a difference (or a degree of difference) in the values for other descriptive variables, and (iv) a difference between the total number of households and the target or minimum number of households threshold to maintain privacy.


Continuing the example with respect to assets and MOSAIC® codes, a scoring algorithm may be executed by the micro-geographic aggregation system 100 which calculates a score for a candidate geographic unit based on desired attributes (e.g., assets and MOSAIC® code similarity, proximity, granularity, etc.) and/or tradeoffs. For example, in one embodiment, the score calculation may place more importance on factors other than distance as the distance increases (e.g., the greater the distance between geographic units, the more desirable it becomes to have a higher degree of similarity based on other attributes). In one example, a tradeoff may be implemented to sacrifice 5% of asset difference in exchange for being a certain distance (e.g., 100 meters) closer in proximity. Other examples may include: having the exact same MOSAIC® code or segment may get more weight; being in the same apartment complex may get more weight; tradeoff a certain distance in proximity in exchange for having the number of households in the candidate geographic unit reduced or increase by a certain amount in order to exactly meet a minimum household threshold; and balancing the number of candidate geographic units grouped into a single rollup in order to try and exactly meet a minimum household threshold. Exact tradeoffs implemented may vary depending on the attributes being analyzed and the end desired goal.


At block 440, the micro-geographic aggregation system 100 selects the best scoring candidate geographic unit for inclusion in a geographic unit rollup with the selected target geographic unit. Depending on the embodiment, the best scoring candidate may be a low scoring candidate (e.g., if the score is a penalty score where low scores are preferred over high scores), or a high scoring candidate, or any other variation or rule for determining which score is a “best” score. When the candidate is selected for inclusion in the rollup, the underlying attribute data associated with the geographic units in the rollup may be aggregated, combined, or averaged such that the underlying statistical variance in the data set is preserved to the greatest extent possible with respect to non-rolled up geographic units. The process 400 may then proceed to block 445.


At block 445, the micro-geographic aggregation system 100 determines whether the number of households in the rollup group is below the minimum threshold. In response to determining that the number of households in the rollup group is below the minimum threshold, the process 400 may return to block 405 and repeat block 405 to block 445 in order to continue the rollup process until the rollup group includes enough households to satisfy the minimum threshold. In response to determining that the number of households in the rollup group is greater than or equal to the minimum threshold, the process 400 may proceed to block 450.


At block 450, the micro-geographic aggregation system 100 provides the rollup group as output, for example to another process of the micro-geographic aggregation system 100 or to a requesting entity system 164. This process is similar to the process described at block 225 of process 200 shown in FIG. 2 herein.


In one embodiment, the process 400 may be executed by the micro-geographic aggregation system 100 an indeterminate number of times for a set of selected target geographic units, with each iteration of the process 400 generating a rollup group for each selected target geographic unit in the list. In one embodiment the process 400 may be executed or performed in parallel for each selected target geographic unit in the list. This may be possible in instances where the selected targets each comprise a separate, non-overlapping set of candidate geographic units which may be rolled up or aggregated with respect to each selected target.


In some embodiments, it may be possible that the set of selected target geographic units may contain zero or only one candidate geographic unit for rollup aggregation, or that a generated rollup group for a selected target geographic unit has a combined number of households less than the minimum even if all candidate geographic units associated with a selected target are included in the rollup group. Thus, the micro-geographic aggregation system 100 may be configured to account for these possible scenarios by combining or rolling up one or more selected target geographic units with each other. This combination of selected target geographic units may be performed before or after the process 400 is executed. The combination of selected target geographic units in this way may be performed using a process similar to the process 400, or by a separate process, or may even be configured manually, depending on the embodiment.


The process 400 may also be performed for a plurality of target ZIP codes for potential rollup (e.g., as received in a batch request) substantially in parallel and substantially in real time.


Sample User Interfaces



FIGS. 5A and 5B illustrate example user interfaces (“UIs”) as used in one or more embodiments of a micro-geographic aggregation system. The sample user interfaces may be displayed, for example, via a web browser or standalone application, and may be provided, for example, as a web service by the micro-geographic aggregation system 100. However, in some embodiments, the sample user interfaces shown in FIGS. 5A and 5B may also be displayed on a suitable computer device, such as a personal computer, desktop, laptop, cell/smart phone, tablet, or portable computing device, and are not limited to the samples as described herein. The user interfaces are examples of only certain features that a micro-geographic aggregation system may provide. In other embodiments, additional features may be provided and they may be provided using various different user interfaces and software code. Depending on the embodiment, the user interfaces and functionality described with reference to FIGS. 5A and 5B may be provided by software executing on a computing device, by a micro-geographic aggregation system located remotely that is in communication with the computing device via one or more networks, and/or some combination of software executing on the computing device and the micro-geographic aggregation system.



FIG. 5A illustrates an example user interface 500A which enables an end user, such as a third party requesting entity, to submit customized rollup filters and data requests, as generated in one embodiment of the micro-geographic aggregation system 100. These filters may be applied by the micro-geographic aggregation system 100 “on-the-fly” to underlying consumer-level and/or ZIP attribute data to dynamically perform custom rollups in response to the data request from the end user. As shown in FIG. 5A, the user is presented with options to specify a number of thresholds 501, a ZIP code/geographic region 502, and an average assets 503 on which to filter candidate ZIPs. The user interface 500A may additionally support candidate filtering and/or scoring criteria based on any other data attribute described herein which are not illustrated in FIG. 5A, such as socio-economic attributes, demographics, lifestyle segments, behavioral/attitudinal, credit data-related attributes, and so on. When the user is ready to request a rollup, he/she selects the rollup option 504, or the user may choose to clear 505 and start over.


In some embodiments the user may be able to enter more than one target ZIP code to be rolled up at one time (e.g. the micro-geographic aggregation system 100 may receive multiple ZIP codes for rollup aggregation in batches).



FIG. 5B illustrates an example user interface 500B which enables an end user, such as a third party requesting entity, to view rollup maps and/or output lists generated in response to a rollup request, as generated in one embodiment of the micro-geographic aggregation system 100. User interface 500B shows an output rollup grid 506 and a rollup map 509. An example of the output rollup grid 506 is illustrated and described in more detail with reference to FIG. 6 herein. The rollup map 509 may provide a visual representation of the rolled-up ZIP groups for the selected geographic region or ZIP code. The rollup groupings may be indicated for example by different colored lines, lines of different styles or thickness (e.g., dashed, dotted, bold), or any other visual representation which may be used to convey which rollup group to which each ZIP9 in the area has been assigned. The visualization can provide extra value in that the end user can quickly see how the ZIP9 codes have been grouped together, which need not always end up on adjacent ZIP9s being grouped together in the same rollup.


The user interface 500B may also provide an option for the user to export the rollup results 507, or the user may choose to start over 508 and return to the user interface 500A.


Sample Rollup Output



FIG. 6 illustrates an example geographic unit rollup output which may be provided by the rollup processes described herein. The example geographic unit rollup output may be provided, for example, to a requesting entity system 164, in different output formats including but not limited to a batch file format (e.g., a text file or a table) and/or a user interface which displays the rollup output such as the user interface 500B shown in FIG. 5B.


The example geographic unit rollup output of FIG. 6 illustrates a sample output with respect to the asset and MOSAIC® code example discussed throughout this disclosure. In particular, the table 600 includes information indicating which ZIP9 codes 601 have been grouped together, an address range (from 602 and to 603) corresponding to each ZIP9 code, a number of households 604 for each ZIP9, a MOSAIC® code 605 for each ZIP9, a roll ID 606 for the rollup group, a total number of households 607 for each rollup group, and an average assets 608 for the rollup group.


In one embodiment where the table 600 is included as part of a visual output display such as the one illustrated in FIG. 5B, rows of the table 600 may be color-coded or otherwise formatted to match the rollup groupings displayed on a map. In one example user interface, in response to the user moving a pointer or mouse (or touching a portion of the user interface for touch-screen enabled devices) over a row in the table 600, the rollup groupings displayed on the map may be highlighted to further illustrate to the end user where the ZIP codes in the rollup group are geographically on the map. Similarly rows in the table 600 may be highlighted in response to the user moving a pointer (or touching the screen) relative to ZIP code segments on the map.


Mapping Geographic Unit Data



FIG. 7 illustrates an example of how different map data sources, may have different and/or conflicting map latitude/longitude (“lat/long”) coordinates for geographic units, such as ZIP codes, which may need to be reconciled for a geographic unit rollup process. For example, as shown in the map 700 of FIG. 7, for an example ZIP9 defined by a street address range with endpoints at points “B” and “E”, one data source may indicate that the latitude and longitude of the center point of the line segment connecting the endpoints is at point “A”, a second data source may indicate that center point corresponds to point “C”, and a third data source may indicate that center point corresponds to point “D”. In some embodiments, it may be beneficial to improve the accuracy of the location of the ZIP9 codes, in particular for ZIP9 codes which cover a small area or only a few households where minor differences in lat/long coordinates can make the difference as to which other ZIP9 codes would be most suitable for combination. For example, with reference to the process 400 illustrated and described in FIG. 4, finding all ZIP codes within a geographic distance or radius of a target ZIP code may require using an accurate or verified center point and/or endpoints for the target ZIP code.


One embodiment of the micro-geographic aggregation system 100 provides a process or mechanism for accessing map data from different map data sources, combining the map data and reconciling differences or discrepancies in order to generate a single, consolidated mapping of ZIP9 codes to latitude/longitude coordinates. The latitude/longitude mapping process may be performed, for example, by geographic unit mapping engine 121 of the micro-geographic aggregation system 100. The consolidated mapping of ZIP9 codes to lat/long coordinates may be stored in one of the data sources 166 and accessed by the micro-geographic aggregation system 100 for use in the rollup processes described herein, such as the processes described with reference to FIGS. 2, 3, and 4.


Latitude/longitude selection for ZIP9 map data reconciliation may be implemented a number of ways. In some embodiments, a confidence code or level may be assigned to a set of selected latitude/longitude coordinates to provide an indication of how accurate the selected latitude/longitude coordinates may be, based on the underlying source data. For example, a confidence level of 1 may be assigned if the lat/long coordinates are confirmed for a base reliable source (e.g., US Census/TIGER) relative to a secondary source. The lat/long coordinates may be confirmed if, for example, the distance between the two sources is less than a certain distance such as 0.1 mile. A confidence level of 2 may be assigned if only a base reliable source is available, but the lat/long coordinates do not agree with a secondary source. A confidence level of 3 may be assigned if more than two sources are available or have lat/long coordinates for the ZIP, but none of them are pairwise close. A confidence level of 4 may be assigned if only a base reliable source is available but no secondary source data is available to confirm the base source. A confidence level of 5 may be assigned if only secondary sources are available and/or used to approximate the lat/long coordinates for the ZIP. Additional or fewer confidence levels may be implemented depending on the different types of source data, level or confidence of accuracy, and so on. Other types of confidence scores may also be used, including letter scores, ranges, percentages, and so on.


Returning to the example illustrated in FIG. 7, according to one embodiment of the latitude/longitude mapping process implemented by the micro-geographic aggregation system 100, point C may be selected as the center point of the ZIP9 as follows. Suppose the most reliable source indicates that the center point of the ZIP9 is at point C; a secondary source indicates that the center point of the ZIP9 is point A; and an additional reliable source indicates that the center point of the ZIP9 is point D. Point A may be eliminated from consideration on the basis of being a secondary source and too far from points C and D. Point C may be selected because its source is considered more reliable, though Point D is too far away from Point C to confirm its accuracy. Thus Point C may be selected as the most accurate center point for this ZIP9 based on the available source data. Further in this example, a confidence level of 3 may be applied since all three data sources are available but none of them are within the specified threshold distance of each other.


Example System Implementation and Architecture



FIG. 8 is a block diagram of an example implementation of a micro-geographic aggregation system 100 in communication with a network 160 and various systems, such as requesting entity system(s) 164 and geographic unit/mapping data source(s) 166A consumer data source(s) 166B. The micro-geographic aggregation system 100 may be used to implement systems and methods described herein.


The micro-geographic aggregation system 100 includes, for example, a personal computer that is IBM, Macintosh, or Linux/Unix compatible or a server or workstation. In one embodiment, the micro-geographic aggregation system 100 comprises a server, a laptop computer, a smart phone, a personal digital assistant, a kiosk, or an media player, for example. In one embodiment, the exemplary micro-geographic aggregation system 100 includes one or more central processing unit (“CPU”) 105, which may each include a conventional or proprietary microprocessor. The micro-geographic aggregation system 100 further includes one or more memory 130, such as random access memory (“RAM”) for temporary storage of information, one or more read only memory (“ROM”) for permanent storage of information, and one or more mass storage device 120, such as a hard drive, diskette, solid state drive, or optical media storage device. Typically, the modules of the micro-geographic aggregation system 100 are connected to the computer using a standard based bus system 180. In different embodiments, the standard based bus system could be implemented in Peripheral Component Interconnect (“PCI”), Microchannel, Small Computer System Interface (“SCSI”), Industrial Standard Architecture (“ISA”) and Extended ISA (“EISA”) architectures, for example. In addition, the functionality provided for in the components and modules of micro-geographic aggregation system 100 may be combined into fewer components and modules or further separated into additional components and modules.


The micro-geographic aggregation system 100 is generally controlled and coordinated by operating system software, such as Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, or other compatible operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In other embodiments, the micro-geographic aggregation system 100 may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface, such as a graphical user interface (“GUI”), among other things.


The exemplary micro-geographic aggregation system 100 may include one or more commonly available input/output (I/O) devices and interfaces 110, such as a keyboard, mouse, touchpad, and printer. In one embodiment, the I/O devices and interfaces 110 include one or more display devices, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, and multimedia presentations, for example. The micro-geographic aggregation system 100 may also include one or more multimedia devices 140, such as speakers, video cards, graphics accelerators, and microphones, for example.


In the embodiment of FIG. 8, the I/O devices and interfaces 110 provide a communication interface to various external devices. In the embodiment of FIG. 5, the micro-geographic aggregation system 100 is electronically coupled to a network 160, which comprises one or more of a LAN, WAN, and/or the Internet, for example, via a wired, wireless, or combination of wired and wireless, communication link 115. The network 160 communicates with various computing devices and/or other electronic devices via wired or wireless communication links.


According to FIG. 8, in some embodiments information may be provided to the micro-geographic aggregation system 100 over the network 160 from one or more geographic unit/mapping data sources 166A and/or consumer data source 166B. The geographic unit/mapping data source(s) 166A and consumer data sources 166B may include one or more internal and/or external data sources. The geographic unit/mapping data source(s) 166A may store, for example, geographic data including but not limited to census tract data, ZIP codes, ZIP5s, ZIP7s, ZIP9s, street address ranges, grid-based geographic regions corresponding to a map, and data otherwise describing or defining any other finite geographic area or location. In some embodiments, grid-based geographic regions may comprise or correspond to areas of certain population density, which may then be grouped or aggregated in a variable resolution grid. The consumer data sources 166B may store, for example, credit bureau data (for example, credit bureau data from File Ones℠) and/or other consumer data. Consumer data sources 166B may also store geographic level demographics that include one or more models, such as models that identify lifestyle and/or socio-economic attributes associated with a geographic location (e.g., MOSAIC® segmentation and/or codes) and/or behavioral/attitudinal/psychographic attributes associated with a geographic location (e.g., TrueTouch℠ Touch Points segmentation). In some embodiments, one or more of the databases or data sources may be implemented using a relational database, such as Sybase, Oracle, CodeBase and Microsoft® SQL Server as well as other types of databases such as, for example, a flat file database, an entity-relationship database, and object-oriented database, and/or a record-based database.


In the embodiment of FIG. 8, the micro-geographic aggregation system 100 includes a geographic unit mapping engine 121, a geographic unit rollup engine 122, and a user interface module 123 that may be stored in the mass storage device 120 as executable software codes that are executed by the CPU 105. This and other modules in the micro-geographic aggregation system 100 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 the embodiment shown in FIG. 8, the micro-geographic aggregation system 100 is configured to execute the geographic unit mapping engine 121, the geographic unit rollup engine 122, and/or the user interface module 123 to perform the various methods and/or processes for geographic unit rollup, combination, and/or aggregations as described herein (such as the processes described with respect to FIGS. 2, 3, and 4 herein).


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 or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, or any other tangible medium. Such software code may be stored, partially or fully, on a memory device of the executing computing device, such as the micro-geographic aggregation system 100, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may 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.


Other Embodiments

Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The code modules may be stored on any type of non-transitory computer-readable medium or computer storage device, such as hard drives, solid state memory, optical disc, and/or the like. The systems and modules may also be transmitted as generated data signals (e.g., as part of a carrier wave or other analog or digital propagated signal) on a variety of computer-readable transmission mediums, including wireless-based and wired/cable-based mediums, and may take a variety of forms (e.g., as part of a single or multiplexed analog signal, or as multiple discrete digital packets or frames). The processes and algorithms may be implemented partially or wholly in application-specific circuitry. The results of the disclosed processes and process steps may be stored, persistently or otherwise, in any type of non-transitory computer storage such as, e.g., volatile or non-volatile storage.


The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.


Conditional language used herein, such as, among others, “can,” “could,” “might,” “may,” “e.g.,” and the like, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without author input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment. The terms “comprising,” “including,” “having,” and the like are synonymous and are used inclusively, in an open-ended fashion, and do not exclude additional elements, features, acts, operations, and so forth. Also, the term “or” is used in its inclusive sense (and not in its exclusive sense) so that when used, for example, to connect a list of elements, the term “or” means one, some, or all of the elements in the list. Conjunctive language such as the phrase “at least one of X, Y and Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to convey that an item, term, etc. may be either X, Y or Z. Thus, such conjunctive language is not generally intended to imply that certain embodiments require at least one of X, at least one of Y and at least one of Z to each be present.


While certain example embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the disclosure. Thus, nothing in the foregoing description is intended to imply that any particular element, feature, characteristic, step, module, or block is necessary or indispensable. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the inventions disclosed herein. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of certain of the inventions disclosed herein.


It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure.

Claims
  • 1. A computer-implemented method of identifying one or more geographic units to combine with at least one target geographic unit for display on a graphical user interface, the method comprising: under control of a computing device configured with specific computer- executable instructions: receiving at least one indication associated with the at least one target geographic unit and a minimum threshold of households in an aggregated group of households;causing display of a map within the graphical user interface, the map depicting a geographic area including the at least one target geographic unit based on the at least one indication;identifying a plurality of candidate geographic units within a geographic distance of the at least one target geographic unit;applying one or more filter criteria to the plurality of candidate geographic units to remove those candidate geographic units which do not satisfy the filter criteria to generate a plurality of remaining candidate geographic units;determining, for each remaining candidate geographic unit of the plurality of remaining geographic units after application of the one or more filter criteria, a score based at least in part on similarity of household data attributes associated with each remaining candidate geographic unit and the at least one target geographic unit;selecting a first candidate geographic unit from the plurality of remaining candidate geographic units for rollup aggregation with the at least one target geographic unit into a rollup group based on the determined scores;aggregating the first candidate geographic unit with the target geographic unit into the rollup group; andin response to determining that a combined number of households associated with the rollup group is not below the minimum threshold, updating the map to display each of the geographic units of the rollup group, wherein the updated map includes visual indications of relative scores of each of the geographic units of the rollup group.
  • 2. The computer-implemented method of claim 1, wherein the household data attributes include one or more socio-economic and/or lifestyle segment attributes.
  • 3. The computer-implemented method of claim 2, wherein the socio- economic attributes include an average asset value per household within the respective geographic unit.
  • 4. The computer-implemented method of claim 2, wherein the lifestyle segment attribute is a segment code.
  • 5. The computer-implemented method of claim 1, wherein each candidate geographic unit is a ZIP+4 code.
  • 6. The computer-implemented method of claim 1, wherein the one or more filter criteria further are received from a requesting entity.
  • 7. The computer-implemented method of claim 6, wherein the one or more filter criteria are received from the requesting entity via a web user interface, and wherein the web user interface provides one or more input fields enabling the requesting entity to configure custom filter criteria for the rollup group.
  • 8. The computer-implemented method of claim 1, wherein determining the score for each remaining candidate geographic unit further comprises: identifying one or more target attributes on which to analyze the similarity of the household data attributes associated with each remaining candidate geographic unit to the target geographic unit;calculating, for each remaining candidate geographic unit, a weighted similarity of the remaining candidate geographic unit to the target geographic unit based on a comparison of the target attributes; anddetermining the score based at least in part on the weighted similarity.
  • 9. The computer-implemented method of claim 8, wherein the weighted similarity is calculated based at least in part on a calculated geographic distance between the remaining candidate geographic unit and the target geographic unit.
  • 10. A computer system for identifying one or more geographic units to combine with at least one target geographic unit for display on a graphical user interface, the computer system comprising: an electronic data store configured to at least store geographic data associated with each of a plurality of geographic units; anda computing system comprising one or more hardware computing devices, said computing system in communication with the electronic data store and configured to at least: receive at least one indication associated with the at least one target geographic unit and a minimum threshold of households in an aggregated group of households;cause display of a map within the graphical user interface, the map depicting a geographic area including the at least one target geographic unit based on the at least one indication;identify a plurality of candidate geographic units within a geographic distance of the at least one target geographic unit;apply one or more filter criteria to the plurality of candidate geographic units to remove candidate geographic units which do not satisfy the filter criteria to generate a plurality of remaining candidate geographic units;determine, for each remaining candidate geographic unit of the plurality of remaining geographic units after application of the filter criteria, a score based at least in part on similarity of household data attributes associated with each remaining candidate geographic unit and at least one the target geographic unit;select a first candidate geographic unit from the plurality of remaining candidate geographic units for rollup aggregation with the at least one target geographic unit into a rollup group based on the determined scores;aggregate the first candidate geographic unit with the target geographic unit into the rollup group; andin response to determining that a combined number of households associated with the rollup group is not below a minimum threshold, update the map to display each of the geographic units of the rollup group, wherein the updated map includes visual indications of relative scores of each of the geographic units of the rollup group.
  • 11. The computer system of claim 10, wherein each candidate geographic unit is a ZIP+4 code.
  • 12. Non-transitory physical computer storage comprising computer-executable instructions stored thereon that, when executed by a hardware processor, are configured to perform operations to identify one or more geographic units to combine with at least one target geographic unit for display on a graphical user interface, the operations comprising: receiving at least one indication associated with the at least one target geographic unit and a minimum threshold of households in an aggregated group of households;causing display of a map within the graphical user interface, the map depicting a geographic area including the at least one target geographic unit based on the at least one indication;identifying a plurality of candidate geographic units within a geographic distance of the at least one target geographic unit;applying filter criteria to the plurality of candidate geographic units to remove candidate geographic units which do not satisfy the filter criteria to generate a plurality of remaining candidate geographic units;determining, for each remaining candidate geographic unit of the plurality of remaining geographic units after application of the one or more filter criteria, a score based at least in part on similarity of household data attributes associated with each remaining candidate geographic unit and the at least one target geographic unit;selecting a first candidate geographic unit from the plurality of remaining candidate geographic units for rollup aggregation with the at least one target geographic unit into a rollup group based on the determined scores;aggregating the first candidate geographic unit with the target geographic unit into the rollup group; andresponsive to determining that the combined number of households associated with the rollup group is not below a minimum threshold, updating the map to display each of the geographic units of the rollup group, wherein the updated map includes visual indications of relative scores of each of the geographic units of the rollup group.
  • 13. The non-transitory physical computer storage of claim of claim 12, wherein the household data attributes include one or more socio-economic and/or lifestyle segment attributes.
  • 14. The non-transitory physical computer storage of claim of claim 12, wherein each candidate geographic unit is a ZIP+4 code.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/244,186, filed Apr. 3, 2014, which claims the benefit of priority under 35 U.S.C. § 119(e) of U.S. Provisional Application No. 61/905,021, filed Nov. 15, 2013, the disclosure of which is hereby incorporated by reference in its entirety.

US Referenced Citations (1452)
Number Name Date Kind
3316395 Lavin et al. Apr 1967 A
4163290 Sutherlin et al. Jul 1979 A
4774664 Campbell et al. Sep 1988 A
4775935 Yourick Oct 1988 A
4827508 Shear May 1989 A
4868570 Davis Sep 1989 A
4872113 Dinerstein Oct 1989 A
4935870 Burk, Jr. et al. Jun 1990 A
4989141 Lyons et al. Jan 1991 A
5056019 Schultz et al. Oct 1991 A
5121484 Hirami et al. Jun 1992 A
5146403 Goodman Sep 1992 A
5201010 Deaton et al. Apr 1993 A
5216612 Cornett et al. Jun 1993 A
5247575 Sprague et al. Sep 1993 A
5274547 Zoffel et al. Dec 1993 A
5325509 Lautzenheiser Jun 1994 A
5341429 Stringer et al. Aug 1994 A
5454030 de Oliveira et al. Sep 1995 A
5504675 Cragun et al. Apr 1996 A
5528701 Aref Jun 1996 A
5555409 Leenstra, Sr. et al. Sep 1996 A
5563783 Stolfo et al. Oct 1996 A
5590038 Pitroda Dec 1996 A
5592560 Deaton et al. Jan 1997 A
5621201 Langhans et al. Apr 1997 A
5629982 Micali May 1997 A
5630070 Dietrich et al. May 1997 A
5640551 Chu et al. Jun 1997 A
5640577 Scharmer Jun 1997 A
5655129 Ito Aug 1997 A
5659731 Gustafson Aug 1997 A
5666528 Thai Sep 1997 A
5692107 Simoudis et al. Nov 1997 A
5696907 Tom Dec 1997 A
5703783 Allen et al. Dec 1997 A
5734568 Borgendale et al. Mar 1998 A
5737732 Gibson et al. Apr 1998 A
5739512 Tognazzini Apr 1998 A
5745654 Titan Apr 1998 A
5748098 Grace May 1998 A
5754632 Smith May 1998 A
5754938 Herz et al. May 1998 A
5754939 Herz et al. May 1998 A
5765143 Sheldon et al. Jun 1998 A
5768423 Aref et al. Jun 1998 A
5774692 Boyer et al. Jun 1998 A
5774868 Cragun et al. Jun 1998 A
5778405 Ogawa Jul 1998 A
5781634 Cordery et al. Jul 1998 A
5797136 Boyer et al. Aug 1998 A
5805710 Higgins et al. Sep 1998 A
5812840 Shwartz Sep 1998 A
5819226 Gopinathan et al. Oct 1998 A
5822410 McCausland et al. Oct 1998 A
5822750 Jou et al. Oct 1998 A
5822751 Gray et al. Oct 1998 A
5825884 Zdepski et al. Oct 1998 A
5828837 Eikland Oct 1998 A
5832068 Smith Nov 1998 A
5835915 Carr et al. Nov 1998 A
5842185 Chancey et al. Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5848396 Gerace Dec 1998 A
5870721 Norris Feb 1999 A
5875108 Hoffberg et al. Feb 1999 A
5881131 Farris et al. Mar 1999 A
5884287 Edesess Mar 1999 A
5893090 Friedman et al. Apr 1999 A
5905985 Malloy et al. May 1999 A
5912839 Ovshinsky et al. Jun 1999 A
5915243 Smolen Jun 1999 A
5926800 Baronowski et al. Jul 1999 A
5944787 Zoken Aug 1999 A
5950179 Buchanan et al. Sep 1999 A
5956693 Geerlings Sep 1999 A
5961593 Gabber et al. Oct 1999 A
5963932 Jakobsson et al. Oct 1999 A
5966695 Melchione et al. Oct 1999 A
5974396 Anderson et al. Oct 1999 A
5978780 Watson Nov 1999 A
6009415 Shurling et al. Dec 1999 A
6014688 Venkatraman et al. Jan 2000 A
6018723 Siegel et al. Jan 2000 A
6026368 Brown et al. Feb 2000 A
6026381 Barton, III et al. Feb 2000 A
6029139 Cunningham et al. Feb 2000 A
6038551 Barlow et al. Mar 2000 A
6044357 Garg Mar 2000 A
6064990 Goldsmith May 2000 A
6070147 Harms et al. May 2000 A
6073106 Rozen et al. Jun 2000 A
6073140 Morgan et al. Jun 2000 A
6073241 Rosenberg et al. Jun 2000 A
6085242 Chandra Jul 2000 A
6098052 Kosiba et al. Aug 2000 A
6119103 Basch et al. Sep 2000 A
6121901 Welch et al. Sep 2000 A
6128602 Northington et al. Oct 2000 A
6128624 Papierniak et al. Oct 2000 A
6144957 Cohen et al. Nov 2000 A
6144988 Kappel Nov 2000 A
6151601 Papierniak et al. Nov 2000 A
6154729 Cannon et al. Nov 2000 A
6157707 Baulier et al. Dec 2000 A
6157927 Schaefer et al. Dec 2000 A
6161139 Win et al. Dec 2000 A
6178442 Yamazaki Jan 2001 B1
6182060 Hedgcock et al. Jan 2001 B1
6199077 Inala et al. Mar 2001 B1
6202053 Christiansen et al. Mar 2001 B1
6223171 Chaudhuri et al. Apr 2001 B1
6233588 Marchoili et al. May 2001 B1
6246794 Kagehiro et al. Jun 2001 B1
6253202 Gilmour Jun 2001 B1
6256630 Gilai et al. Jul 2001 B1
6263334 Fayyad et al. Jul 2001 B1
6263337 Fayyad et al. Jul 2001 B1
6266649 Linden et al. Jul 2001 B1
6275824 O'Flaherty et al. Aug 2001 B1
6304860 Martin et al. Oct 2001 B1
6304869 Moore et al. Oct 2001 B1
6311169 Duhon Oct 2001 B2
6317783 Freishtat et al. Nov 2001 B1
6330546 Gopinathan et al. Dec 2001 B1
6334110 Walter et al. Dec 2001 B1
6339769 Cochrane et al. Jan 2002 B1
6366903 Agrawal et al. Apr 2002 B1
6397197 Gindlesperger May 2002 B1
6405173 Honarvar Jun 2002 B1
6405245 Burson et al. Jun 2002 B1
6424956 Werbos Jul 2002 B1
6430539 Lazarus et al. Aug 2002 B1
6442577 Britton et al. Aug 2002 B1
6446200 Ball et al. Sep 2002 B1
6448980 Kumar et al. Sep 2002 B1
6453353 Win et al. Sep 2002 B1
6456979 Flagg Sep 2002 B1
6457012 Jatkowski Sep 2002 B1
6460036 Herz Oct 2002 B1
6463533 Calamera et al. Oct 2002 B1
6477565 Daswani et al. Nov 2002 B1
6496819 Bello et al. Dec 2002 B1
6496931 Rajchel et al. Dec 2002 B1
6505168 Rothman et al. Jan 2003 B1
6505176 DeFrancesco, Jr. et al. Jan 2003 B2
6513018 Culhane Jan 2003 B1
6517587 Satyavolu et al. Feb 2003 B2
6523021 Monberg et al. Feb 2003 B1
6523022 Hobbs Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6532450 Brown et al. Mar 2003 B1
6543683 Hoffman Apr 2003 B2
6549919 Lambert et al. Apr 2003 B2
6564210 Korda et al. May 2003 B1
6567850 Freishtat et al. May 2003 B1
6574623 Laung et al. Jun 2003 B1
6574736 Andrews Jun 2003 B1
6575376 Yu Jun 2003 B2
6581059 Barrett et al. Jun 2003 B1
6598030 Siegel et al. Jul 2003 B1
6601173 Mohler Jul 2003 B1
6601234 Bowman-Amuah Jul 2003 B1
6615247 Murphy Sep 2003 B1
6618727 Wheeler et al. Sep 2003 B1
6622266 Goddard et al. Sep 2003 B1
6623529 Lakritz Sep 2003 B1
6631496 Li et al. Oct 2003 B1
6633910 Rajan et al. Oct 2003 B1
6647383 August et al. Nov 2003 B1
6651220 Penteroudakis et al. Nov 2003 B1
6658393 Basch et al. Dec 2003 B1
6665677 Wotring et al. Dec 2003 B1
6665715 Houri Dec 2003 B1
6691136 Lee et al. Feb 2004 B2
6708166 Dysart et al. Mar 2004 B1
6714944 Shapiro et al. Mar 2004 B1
6725381 Smith et al. Apr 2004 B1
6725425 Rajan et al. Apr 2004 B1
6738748 Wetzer May 2004 B2
6738759 Wheeler et al. May 2004 B1
6741724 Bruce et al. May 2004 B1
6742001 Ripley May 2004 B2
6748426 Shaffer et al. Jun 2004 B1
6750985 Rhoads Jun 2004 B2
6754665 Futagami et al. Jun 2004 B1
6757740 Parekh et al. Jun 2004 B1
6766327 Morgan, Jr. et al. Jul 2004 B2
6766946 Iida et al. Jul 2004 B2
6782379 Lee Aug 2004 B2
6801909 Delgado et al. Oct 2004 B2
6802042 Rangan et al. Oct 2004 B2
6804346 Mewhinney Oct 2004 B1
6804701 Muret et al. Oct 2004 B2
6807533 Land et al. Oct 2004 B1
6816871 Lee Nov 2004 B2
6839714 Wheeler et al. Jan 2005 B2
6845448 Chaganti et al. Jan 2005 B1
6850895 Brodersen et al. Feb 2005 B2
6853997 Wotring et al. Feb 2005 B2
6865680 Wu et al. Mar 2005 B1
6871220 Rajan et al. Mar 2005 B1
6873972 Marcial et al. Mar 2005 B1
6873979 Fishman et al. Mar 2005 B2
6879960 Nascenzi et al. Apr 2005 B2
6879983 Bellamy et al. Apr 2005 B2
6910624 Natsuno Jun 2005 B1
6915269 Shapiro et al. Jul 2005 B1
6925441 Jones, III et al. Aug 2005 B1
6928487 Eggebraaten et al. Aug 2005 B2
6934714 Meinig Aug 2005 B2
6947984 Schweitzer et al. Sep 2005 B2
6947989 Gullotta et al. Sep 2005 B2
6950858 Ogami Sep 2005 B2
6954757 Zargham et al. Oct 2005 B2
6970830 Samra et al. Nov 2005 B1
6976056 Kumar Dec 2005 B1
6983379 Spalink et al. Jan 2006 B1
6983478 Grauch et al. Jan 2006 B1
6985882 Del Sesto Jan 2006 B1
6985887 Sunstein et al. Jan 2006 B1
6985898 Ripley et al. Jan 2006 B1
6988085 Hedy Jan 2006 B2
6988129 Quine Jan 2006 B2
6999941 Agarwal Feb 2006 B1
7003504 Angus et al. Feb 2006 B1
7003792 Yuen Feb 2006 B1
7013310 Messing et al. Mar 2006 B2
7016907 Boreham et al. Mar 2006 B2
7028001 Muthuswamy et al. Apr 2006 B1
7028052 Chapman et al. Apr 2006 B2
7031945 Donner Apr 2006 B1
7035855 Kilger et al. Apr 2006 B1
7039176 Borodow et al. May 2006 B2
7039607 Watarai et al. May 2006 B2
7039656 Tsai et al. May 2006 B1
7043476 Robson May 2006 B2
7047251 Reed et al. May 2006 B2
7050982 Sheinson et al. May 2006 B2
7050989 Hurt et al. May 2006 B1
7054828 Heching et al. May 2006 B2
7062475 Szabo et al. Jun 2006 B1
7069240 Spero et al. Jun 2006 B2
7072963 Anderson et al. Jul 2006 B2
7075894 Hein et al. Jul 2006 B2
7076475 Honarvar et al. Jul 2006 B2
7082435 Guzman et al. Jul 2006 B1
7085997 Wu et al. Aug 2006 B1
7092898 Mattick et al. Aug 2006 B1
7117172 Black Oct 2006 B1
7124144 Christianson et al. Oct 2006 B2
7133935 Hedy Nov 2006 B2
7136448 Venkataperumal et al. Nov 2006 B1
7139734 Nathans et al. Nov 2006 B2
7155739 Bari et al. Dec 2006 B2
7167907 Shaffer et al. Jan 2007 B2
7178096 Rangan et al. Feb 2007 B2
7184974 Shishido Feb 2007 B2
7185016 Rasmussen Feb 2007 B1
7188107 Moon et al. Mar 2007 B2
7191144 White Mar 2007 B2
7200602 Jonas Apr 2007 B2
7206768 deGroeve et al. Apr 2007 B1
7219107 Beringer May 2007 B2
7222101 Bishop et al. May 2007 B2
7222369 Vering et al. May 2007 B2
7234160 Vogel et al. Jun 2007 B2
7236950 Savage et al. Jun 2007 B2
7240059 Bayliss et al. Jul 2007 B2
7243369 Bhat et al. Jul 2007 B2
7246067 Austin et al. Jul 2007 B2
7249048 O'Flaherty Jul 2007 B1
7263548 Daswani et al. Aug 2007 B2
7272591 Ghazal et al. Sep 2007 B1
7277869 Starkman Oct 2007 B2
7277900 Ganesh et al. Oct 2007 B1
7283998 Moon et al. Oct 2007 B2
7296734 Pliha Nov 2007 B2
7308418 Malek et al. Dec 2007 B2
7313538 Wilmes et al. Dec 2007 B2
7314166 Anderson et al. Jan 2008 B2
7315837 Sloan et al. Jan 2008 B2
7328233 Salim et al. Feb 2008 B2
7340679 Botscheck et al. Mar 2008 B2
7346703 Cope Mar 2008 B2
7360251 Spalink et al. Apr 2008 B2
7366694 Lazerson Apr 2008 B2
7366726 Bellamy et al. Apr 2008 B2
7367011 Ramsey et al. Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7373335 Cleghorn et al. May 2008 B2
7376603 Mayr et al. May 2008 B1
7376714 Gerken May 2008 B1
7379880 Pathria et al. May 2008 B1
7383215 Navarro et al. Jun 2008 B1
7383227 Weinflash et al. Jun 2008 B2
7383988 Slonecker, Jr. Jun 2008 B2
7386554 Ripley et al. Jun 2008 B2
7386786 Davis et al. Jun 2008 B2
7389305 Kindig et al. Jun 2008 B1
7392216 Palmgren et al. Jun 2008 B1
7395273 Khan et al. Jul 2008 B2
7398225 Voltmer et al. Jul 2008 B2
7398226 Haines et al. Jul 2008 B2
7403923 Elliott et al. Jul 2008 B2
7403942 Bayliss Jul 2008 B1
7421322 Silversmith et al. Sep 2008 B1
7421442 Gelb et al. Sep 2008 B2
7424439 Fayyad et al. Sep 2008 B1
7424520 Daswani et al. Sep 2008 B2
7428498 Voltmer et al. Sep 2008 B2
7428509 Klebanoff Sep 2008 B2
7433864 Malik Oct 2008 B2
7451113 Kasower Nov 2008 B1
7458508 Shao et al. Dec 2008 B1
7460857 Roach, Jr. Dec 2008 B2
7467096 Antonucci et al. Dec 2008 B2
7467127 Baccash et al. Dec 2008 B1
7467401 Cicchitto Dec 2008 B2
7475118 Leiba et al. Jan 2009 B2
7478157 Bohrer et al. Jan 2009 B2
7483842 Fung et al. Jan 2009 B1
7490356 Lieblich et al. Feb 2009 B2
7496524 Voltmer et al. Feb 2009 B2
7505938 Lang et al. Mar 2009 B2
7529698 Joao May 2009 B2
7533179 Tarquini et al. May 2009 B2
7536329 Goldberg et al. May 2009 B2
7536346 Aliffi et al. May 2009 B2
7536348 Shao et al. May 2009 B2
7543739 Brown et al. Jun 2009 B2
7546266 Beirne et al. Jun 2009 B2
7546271 Chmielewski et al. Jun 2009 B1
7552089 Bruer et al. Jun 2009 B2
7552190 Freishtat et al. Jun 2009 B1
7556192 Wokaty, Jr. Jul 2009 B2
7559217 Bass Jul 2009 B2
7562093 Gelb et al. Jul 2009 B2
7562184 Henmi et al. Jul 2009 B2
7562814 Shao et al. Jul 2009 B1
7571473 Boydstun et al. Aug 2009 B1
7577934 Anonsen et al. Aug 2009 B2
7584126 White Sep 2009 B1
7584146 Duhon Sep 2009 B1
7584149 Bishop et al. Sep 2009 B1
7587366 Grim, III et al. Sep 2009 B2
7593889 Raines et al. Sep 2009 B2
7596512 Raines et al. Sep 2009 B1
7596716 Frost et al. Sep 2009 B2
7603701 Gaucas Oct 2009 B2
7606725 Robertson et al. Oct 2009 B2
7606778 Dewar Oct 2009 B2
7610243 Haggerty et al. Oct 2009 B2
7613600 Krane Nov 2009 B2
7613628 Ariff et al. Nov 2009 B2
7613629 Antonucci et al. Nov 2009 B2
7613671 Serrano-Morales et al. Nov 2009 B2
7634737 Beringer et al. Dec 2009 B2
7640200 Gardner et al. Dec 2009 B2
7647344 Skurtovich, Jr. et al. Jan 2010 B2
7653592 Flaxman et al. Jan 2010 B1
7653593 Zarikian et al. Jan 2010 B2
7653688 Bittner Jan 2010 B2
7657540 Bayliss Feb 2010 B1
7668725 Alston Feb 2010 B2
7668769 Baker et al. Feb 2010 B2
7668840 Bayliss et al. Feb 2010 B2
7672833 Blume et al. Mar 2010 B2
7672865 Kumar et al. Mar 2010 B2
7672870 Haines et al. Mar 2010 B2
7672879 Kumar et al. Mar 2010 B1
7672924 Scheurich et al. Mar 2010 B1
7672926 Ghazal et al. Mar 2010 B2
7676410 Petralia Mar 2010 B2
7676751 Allen et al. Mar 2010 B2
7685209 Norton et al. Mar 2010 B1
7686214 Shao et al. Mar 2010 B1
7689494 Torre et al. Mar 2010 B2
7689505 Kasower Mar 2010 B2
7689526 Byrnes et al. Mar 2010 B2
7693787 Provinse Apr 2010 B2
7698163 Reed et al. Apr 2010 B2
7698445 Fitzpatrick et al. Apr 2010 B2
7707059 Reed et al. Apr 2010 B2
7707102 Rothstein Apr 2010 B2
7707164 Kapochunas et al. Apr 2010 B2
7707271 Rudkin et al. Apr 2010 B2
7711635 Steele et al. May 2010 B2
7711636 Robida et al. May 2010 B2
7720846 Bayliss May 2010 B1
7725300 Pinto et al. May 2010 B2
7730078 Schwabe et al. Jun 2010 B2
7734523 Cui et al. Jun 2010 B1
7739139 Robertson et al. Jun 2010 B2
7742982 Chaudhuri et al. Jun 2010 B2
7743043 Winslow Jun 2010 B2
7747480 Agresta et al. Jun 2010 B1
7747559 Leitner et al. Jun 2010 B2
7752236 Williams et al. Jul 2010 B2
7752535 Satyavolu Jul 2010 B2
7756789 Welker et al. Jul 2010 B2
7761379 Zoldi et al. Jul 2010 B2
7765166 Beringer et al. Jul 2010 B2
7765279 Kaib et al. Jul 2010 B1
7765311 Itabashi et al. Jul 2010 B2
7769696 Yoda Aug 2010 B2
7769998 Lynch et al. Aug 2010 B2
7774270 MacCloskey Aug 2010 B1
7783515 Kumar et al. Aug 2010 B1
7783562 Ellis Aug 2010 B1
7788040 Haskell et al. Aug 2010 B2
7793835 Coggeshall et al. Sep 2010 B1
7797252 Rosskamm et al. Sep 2010 B2
7797725 Lunt et al. Sep 2010 B2
7801812 Conlin et al. Sep 2010 B2
7801956 Cumberbatch et al. Sep 2010 B1
7805345 Abrahams et al. Sep 2010 B2
7810036 Bales et al. Oct 2010 B2
7813955 Ariff et al. Oct 2010 B2
7814005 Imrey et al. Oct 2010 B2
7818228 Coulter Oct 2010 B1
7818229 Imrey et al. Oct 2010 B2
7818231 Rajan Oct 2010 B2
7830382 Cirit et al. Nov 2010 B2
7832006 Chen et al. Nov 2010 B2
7836111 Shan Nov 2010 B1
7841008 Cole et al. Nov 2010 B1
7844604 Baio et al. Nov 2010 B2
7848972 Sharma Dec 2010 B1
7848978 Imrey et al. Dec 2010 B2
7848987 Haig Dec 2010 B2
7849004 Choudhuri et al. Dec 2010 B2
7853493 DeBie et al. Dec 2010 B2
7853518 Cagan Dec 2010 B2
7853998 Blaisdell et al. Dec 2010 B2
7856386 Hazlehurst et al. Dec 2010 B2
7856397 Whipple et al. Dec 2010 B2
7860786 Blackburn et al. Dec 2010 B2
7870151 Mayer et al. Jan 2011 B2
7877304 Coulter Jan 2011 B1
7877322 Nathans et al. Jan 2011 B2
7890367 Senghore et al. Feb 2011 B2
7895139 Sullivan et al. Feb 2011 B2
7899750 Klieman et al. Mar 2011 B1
7904366 Pogust Mar 2011 B2
7908242 Achanta Mar 2011 B1
7912842 Bayliss et al. Mar 2011 B1
7912865 Akerman et al. Mar 2011 B2
7925917 Roy Apr 2011 B1
7930242 Morris et al. Apr 2011 B2
7945516 Bishop et al. May 2011 B2
7954698 Pliha Jun 2011 B1
7958126 Schachter Jun 2011 B2
7970701 Lewis et al. Jun 2011 B2
7974860 Travis Jul 2011 B1
7975299 Balducci et al. Jul 2011 B1
7983932 Kane Jul 2011 B2
7983976 Nafeh et al. Jul 2011 B2
7991666 Haggerty et al. Aug 2011 B2
7991688 Phelan et al. Aug 2011 B2
7991689 Brunzell et al. Aug 2011 B1
7991901 Tarquini et al. Aug 2011 B2
7996320 Bishop et al. Aug 2011 B2
7996521 Chamberlain et al. Aug 2011 B2
7996912 Spalink et al. Aug 2011 B2
8001042 Brunzell et al. Aug 2011 B1
8001153 Skurtovich, Jr. et al. Aug 2011 B2
8001235 Russ et al. Aug 2011 B2
8005712 von Davier et al. Aug 2011 B2
8005759 Hirtenstein et al. Aug 2011 B2
8006261 Haberman et al. Aug 2011 B1
8019843 Cash et al. Sep 2011 B2
8024220 Ariff et al. Sep 2011 B2
8024263 Zarikian et al. Sep 2011 B2
8024264 Chaudhuri et al. Sep 2011 B2
8024778 Cash et al. Sep 2011 B2
8036979 Torrez et al. Oct 2011 B1
8050968 Antonucci et al. Nov 2011 B2
8060423 Rukonic et al. Nov 2011 B1
8060424 Kasower Nov 2011 B2
8060502 Churi et al. Nov 2011 B2
8064586 Shaffer Nov 2011 B2
8065182 Voltmer et al. Nov 2011 B2
8065233 Lee et al. Nov 2011 B2
8065234 Liao et al. Nov 2011 B2
8065264 Achanta Nov 2011 B1
8078453 Shaw Dec 2011 B2
8078528 Vicente et al. Dec 2011 B1
8082202 Weiss Dec 2011 B2
8086524 Craig et al. Dec 2011 B1
8095443 DeBie Jan 2012 B2
8095458 Peterson et al. Jan 2012 B2
8099341 Varghese Jan 2012 B2
8099356 Feinstein et al. Jan 2012 B2
8104671 Besecker et al. Jan 2012 B2
8104679 Brown Jan 2012 B2
8126805 Sulkowski et al. Feb 2012 B2
8127986 Taylor et al. Mar 2012 B1
8131777 McCullouch Mar 2012 B2
8135642 Krause Mar 2012 B1
8145754 Chamberlain et al. Mar 2012 B2
8155999 de Boer et al. Apr 2012 B2
8160960 Fei et al. Apr 2012 B1
8161104 Tomkow Apr 2012 B2
8175889 Girulat et al. May 2012 B1
8180654 Berkman et al. May 2012 B2
8190629 Wu et al. May 2012 B2
8190998 Bitterlich May 2012 B2
8195550 Haggerty et al. Jun 2012 B2
8201257 Andres et al. Jun 2012 B1
8204774 Chwast et al. Jun 2012 B2
8214238 Fairfield et al. Jul 2012 B1
8219464 Inghelbrecht et al. Jul 2012 B2
8219535 Kobori Jul 2012 B1
8219771 Le Neel Jul 2012 B2
8224723 Bosch et al. Jul 2012 B2
8234498 Britti et al. Jul 2012 B2
8239130 Upstill Aug 2012 B1
8244635 Freishtat et al. Aug 2012 B2
8266065 Dilip et al. Sep 2012 B2
8266168 Bayliss Sep 2012 B2
8266515 Satyavolu Sep 2012 B2
8271378 Chaudhuri et al. Sep 2012 B2
8280805 Abrahams et al. Oct 2012 B1
8281180 Roy Oct 2012 B1
8285656 Chang et al. Oct 2012 B1
8290840 Kasower Oct 2012 B2
8296213 Haggerty et al. Oct 2012 B2
8296229 Yellin et al. Oct 2012 B1
8301574 Kilger et al. Oct 2012 B2
8306890 Haggerty et al. Nov 2012 B2
8306986 Routson et al. Nov 2012 B2
8312033 McMillan Nov 2012 B1
8315933 Haggerty et al. Nov 2012 B2
8315943 Torrez et al. Nov 2012 B2
8321335 Bramlage et al. Nov 2012 B1
8321339 Imrey et al. Nov 2012 B2
8321952 Spalink et al. Nov 2012 B2
8326672 Haggerty et al. Dec 2012 B2
8326725 Elwell et al. Dec 2012 B2
8340685 Cochran Dec 2012 B2
8341073 Bramlage et al. Dec 2012 B1
8345790 Sartori et al. Jan 2013 B2
8355967 Debie et al. Jan 2013 B2
8359210 Altinger et al. Jan 2013 B1
8364518 Blake Jan 2013 B1
8364582 Haggerty et al. Jan 2013 B2
8364588 Celka et al. Jan 2013 B2
8370371 Moncla et al. Feb 2013 B1
8380590 Rukonic et al. Feb 2013 B1
8386377 Xiong et al. Feb 2013 B1
8392334 Hirtenstein et al. Mar 2013 B2
8401889 Chwast et al. Mar 2013 B2
8407137 Thomas Mar 2013 B2
8417612 Chatterji et al. Apr 2013 B2
8433512 Lopatenko Apr 2013 B1
8438105 Haggerty et al. May 2013 B2
8458026 Voltmer et al. Jun 2013 B2
8458052 Libman Jun 2013 B2
8458074 Showalter Jun 2013 B2
8463919 Tarquini et al. Jun 2013 B2
8468198 Tomkow Jun 2013 B2
8473354 Psota Jun 2013 B2
8473380 Thomas et al. Jun 2013 B2
8478674 Kapczynski et al. Jul 2013 B1
8484211 Bayliss Jul 2013 B2
8489482 Haggerty et al. Jul 2013 B2
8494855 Khosla et al. Jul 2013 B1
8495077 Bayliss Jul 2013 B2
8495384 DeLuccia Jul 2013 B1
8498930 Chung et al. Jul 2013 B2
8510184 Imrev et al. Aug 2013 B2
8510189 Imrey et al. Aug 2013 B2
8515828 Wolf et al. Aug 2013 B1
8515862 Zhang et al. Aug 2013 B2
8521628 Gowen et al. Aug 2013 B1
8521729 Churi et al. Aug 2013 B2
8533322 Chamberlain et al. Sep 2013 B2
8549472 Tilwani Oct 2013 B1
8560434 Morris et al. Oct 2013 B2
8560436 Ingram et al. Oct 2013 B2
8566029 Lopatenko Oct 2013 B1
8566141 Nagdev et al. Oct 2013 B1
8566167 Munjal Oct 2013 B2
8572083 Snell et al. Oct 2013 B1
8583593 Achanta Nov 2013 B1
8589069 Lehman Nov 2013 B1
8589208 Kruger Nov 2013 B2
8600854 Mayr et al. Dec 2013 B2
8606632 Libman Dec 2013 B2
8606666 Courbage et al. Dec 2013 B1
8620579 Upstill Dec 2013 B1
8626560 Anderson Jan 2014 B1
8626582 Ariff et al. Jan 2014 B2
8626618 Psota Jan 2014 B2
8626646 Torrez et al. Jan 2014 B2
8630929 Haggerty et al. Jan 2014 B2
8639568 de Boer et al. Jan 2014 B2
8639616 Rolenaitis et al. Jan 2014 B1
8639920 Stack et al. Jan 2014 B2
8666885 Bramlage et al. Mar 2014 B1
8671115 Skurtovich, Jr. et al. Mar 2014 B2
8677129 Milana et al. Mar 2014 B2
8682770 Haggerty et al. Mar 2014 B2
8694390 Imrey et al. Apr 2014 B2
8694403 Haggerty et al. Apr 2014 B2
8705718 Baniak et al. Apr 2014 B2
8706474 Blume et al. Apr 2014 B2
8719114 Libman May 2014 B2
8725613 Celka et al. May 2014 B1
8732004 Ramos et al. May 2014 B1
8732013 Senghore et al. May 2014 B2
8732073 Thomas May 2014 B2
8738435 Libman May 2014 B2
8738515 Chaudhuri et al. May 2014 B2
8738516 Dean et al. May 2014 B1
8738532 Ariff et al. May 2014 B2
8744944 Haggerty et al. Jun 2014 B2
8762053 Lehman Jun 2014 B1
8768826 Imrey et al. Jul 2014 B2
8768914 Scriffignano et al. Jul 2014 B2
8775290 Haggerty et al. Jul 2014 B2
8775299 Achanta et al. Jul 2014 B2
8775301 Haggerty et al. Jul 2014 B2
8781877 Kruger Jul 2014 B2
8781882 Arboletti et al. Jul 2014 B1
8781933 Haggerty et al. Jul 2014 B2
8781951 Lewis et al. Jul 2014 B2
8781953 Kasower Jul 2014 B2
8782217 Arone et al. Jul 2014 B1
8788388 Chatterji et al. Jul 2014 B2
8788701 Byrnes et al. Jul 2014 B1
8805805 Kobori Aug 2014 B1
8818888 Kapczynski et al. Aug 2014 B1
8825544 Imrey et al. Sep 2014 B2
8843780 Roy Sep 2014 B1
8862566 Leitner et al. Oct 2014 B2
8930251 DeBie Jan 2015 B2
8938432 Rossmark Jan 2015 B2
8949981 Trollope et al. Feb 2015 B1
8954459 McMillan et al. Feb 2015 B1
8966649 Stack et al. Feb 2015 B2
8972400 Kapczynski et al. Mar 2015 B1
9026088 Groenjes May 2015 B1
9057616 Lopatenko Jun 2015 B1
9057617 Lopatenko Jun 2015 B1
9058340 Chamberlain et al. Jun 2015 B1
9063226 Zheng et al. Jun 2015 B2
9075848 Churi et al. Jul 2015 B2
9116918 Kim Aug 2015 B1
9143541 Szamonek Sep 2015 B1
9147042 Haller et al. Sep 2015 B1
9147152 Nack et al. Sep 2015 B2
9152727 Balducci et al. Oct 2015 B1
9165044 Psenka et al. Oct 2015 B2
9213646 LaPanse et al. Dec 2015 B1
9251541 Celka et al. Feb 2016 B2
9256624 Skurtovich, Jr. et al. Feb 2016 B2
9256866 Pontious Feb 2016 B2
9268803 Kapochunas et al. Feb 2016 B2
9305300 Mulhern et al. Apr 2016 B2
9318105 Khosla Apr 2016 B1
9324087 Routson et al. Apr 2016 B2
9329715 Schwarz et al. May 2016 B2
9342783 Chang et al. May 2016 B1
9438570 Milana et al. Sep 2016 B2
9483606 Dean et al. Nov 2016 B1
9489614 Nack et al. Nov 2016 B2
9529851 Smith Dec 2016 B1
9535959 Sun et al. Jan 2017 B2
9553936 Dijk Jan 2017 B2
9576030 Kapczynski et al. Feb 2017 B1
9595051 Stack et al. Mar 2017 B2
9646058 Churi et al. May 2017 B2
9684905 Haller et al. Jun 2017 B1
9704192 Ainsworth et al. Jul 2017 B2
9710523 Skurtovich, Jr. et al. Jul 2017 B2
9710841 Ainsworth, III et al. Jul 2017 B2
9774681 Zoldi et al. Sep 2017 B2
9842345 Ariff et al. Dec 2017 B2
9866561 Psenka et al. Jan 2018 B2
10019508 Kapczynski Jul 2018 B1
10075446 McMillan et al. Sep 2018 B2
10102536 Hickman et al. Oct 2018 B1
10115102 Burrell et al. Oct 2018 B2
10140193 Roy Nov 2018 B1
10180861 Raghavan et al. Jan 2019 B2
10242019 Shan et al. Mar 2019 B1
10262362 Hu et al. Apr 2019 B1
10367888 Zoldi et al. Jul 2019 B2
10380619 Pontious Aug 2019 B2
20010000536 Tarin Apr 2001 A1
20010011245 Duhon Aug 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010014878 Mitra et al. Aug 2001 A1
20010029470 Schultz et al. Oct 2001 A1
20010029482 Tealdi et al. Oct 2001 A1
20010034631 Kiselik Oct 2001 A1
20010037332 Miller et al. Nov 2001 A1
20010039523 Iwamoto Nov 2001 A1
20010039532 Coleman, Jr. et al. Nov 2001 A1
20010049274 Degraeve Dec 2001 A1
20010049620 Blasko Dec 2001 A1
20020004736 Roundtree et al. Jan 2002 A1
20020010664 Rabideau et al. Jan 2002 A1
20020010701 Kosciuszko Jan 2002 A1
20020013827 Edstrom et al. Jan 2002 A1
20020026411 Nathans et al. Feb 2002 A1
20020026507 Sears et al. Feb 2002 A1
20020026519 Itabashi et al. Feb 2002 A1
20020029162 Mascarenhas Mar 2002 A1
20020033846 Balasubramanian et al. Mar 2002 A1
20020035684 Vogel et al. Mar 2002 A1
20020049701 Nabe et al. Apr 2002 A1
20020049738 Epstein Apr 2002 A1
20020052841 Guthrie et al. May 2002 A1
20020052884 Farber et al. May 2002 A1
20020055869 Hegg May 2002 A1
20020059142 Krause et al. May 2002 A1
20020069122 Yun et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020091650 Ellis Jul 2002 A1
20020091706 Anderson et al. Jul 2002 A1
20020099628 Takaoka et al. Jul 2002 A1
20020099824 Bender et al. Jul 2002 A1
20020099936 Kou et al. Jul 2002 A1
20020103809 Starzl et al. Aug 2002 A1
20020103933 Garon et al. Aug 2002 A1
20020111816 Lortscher et al. Aug 2002 A1
20020111910 Walsh Aug 2002 A1
20020119824 Allen Aug 2002 A1
20020120504 Gould et al. Aug 2002 A1
20020120757 Sutherland et al. Aug 2002 A1
20020123928 Eldering et al. Sep 2002 A1
20020128962 Kasower Sep 2002 A1
20020129368 Schlack et al. Sep 2002 A1
20020131565 Scheuring et al. Sep 2002 A1
20020133504 Vlahos et al. Sep 2002 A1
20020138297 Lee Sep 2002 A1
20020138331 Hosea et al. Sep 2002 A1
20020138333 DeCotiis et al. Sep 2002 A1
20020138334 DeCotiis et al. Sep 2002 A1
20020138417 Lawrence Sep 2002 A1
20020138470 Zhou Sep 2002 A1
20020143943 Lee et al. Oct 2002 A1
20020147695 Khedkar et al. Oct 2002 A1
20020147801 Gullotta et al. Oct 2002 A1
20020156676 Ahrens et al. Oct 2002 A1
20020161496 Yamaki Oct 2002 A1
20020161664 Shaya et al. Oct 2002 A1
20020165757 Lisser Nov 2002 A1
20020169747 Chapman et al. Nov 2002 A1
20020173984 Robertson et al. Nov 2002 A1
20020173994 Ferguson, III Nov 2002 A1
20020184255 Edd et al. Dec 2002 A1
20020188544 Wizon et al. Dec 2002 A1
20020194103 Nabe Dec 2002 A1
20020198800 Shamrakov Dec 2002 A1
20020198824 Cook Dec 2002 A1
20030002671 Inchalik et al. Jan 2003 A1
20030009418 Green et al. Jan 2003 A1
20030018549 Fei et al. Jan 2003 A1
20030018578 Schultz Jan 2003 A1
20030018769 Foulger et al. Jan 2003 A1
20030023489 McGuire et al. Jan 2003 A1
20030023531 Fergusson Jan 2003 A1
20030041031 Hedy Feb 2003 A1
20030041050 Smith et al. Feb 2003 A1
20030046311 Baidya et al. Mar 2003 A1
20030050882 Degen et al. Mar 2003 A1
20030055931 Cravo De Almeida et al. Mar 2003 A1
20030060284 Hamalainen et al. Mar 2003 A1
20030061233 Manasse et al. Mar 2003 A1
20030069839 Whittington et al. Apr 2003 A1
20030069943 Bahrs et al. Apr 2003 A1
20030078877 Beirne et al. Apr 2003 A1
20030093289 Thornley et al. May 2003 A1
20030093311 Knowlson May 2003 A1
20030097342 Whittingtom May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030101111 Dang et al. May 2003 A1
20030101344 Wheeler et al. May 2003 A1
20030105728 Yano et al. Jun 2003 A1
20030105733 Boreham Jun 2003 A1
20030105742 Boreham et al. Jun 2003 A1
20030110111 Nalebuff et al. Jun 2003 A1
20030110293 Friedman et al. Jun 2003 A1
20030120591 Birkhead et al. Jun 2003 A1
20030135451 O'Brien et al. Jul 2003 A1
20030153299 Perfit et al. Aug 2003 A1
20030158749 Olchanski et al. Aug 2003 A1
20030158776 Landesmann Aug 2003 A1
20030163416 Kitajima Aug 2003 A1
20030163513 Schaeck et al. Aug 2003 A1
20030163708 Tang Aug 2003 A1
20030171942 Gaito Sep 2003 A1
20030182018 Snapp Sep 2003 A1
20030191731 Stewart et al. Oct 2003 A1
20030200151 Ellenson et al. Oct 2003 A1
20030204429 Botscheck et al. Oct 2003 A1
20030208362 Enthoven et al. Nov 2003 A1
20030212600 Hood, III et al. Nov 2003 A1
20030212654 Harper et al. Nov 2003 A1
20030219709 Olenick et al. Nov 2003 A1
20030225742 Tenner et al. Dec 2003 A1
20030229892 Sardera Dec 2003 A1
20030233278 Marshall Dec 2003 A1
20030233655 Gutta et al. Dec 2003 A1
20040006488 Fitall et al. Jan 2004 A1
20040006536 Kawashima et al. Jan 2004 A1
20040010443 May et al. Jan 2004 A1
20040010458 Friedman Jan 2004 A1
20040019799 Vering et al. Jan 2004 A1
20040030649 Nelson et al. Feb 2004 A1
20040030667 Xu et al. Feb 2004 A1
20040039688 Sulkowski et al. Feb 2004 A1
20040044673 Brady et al. Mar 2004 A1
20040052357 Logan et al. Mar 2004 A1
20040059626 Smallwood Mar 2004 A1
20040062213 Koss Apr 2004 A1
20040078324 Lonnberg et al. Apr 2004 A1
20040083215 de Jong Apr 2004 A1
20040088237 Moenickheim et al. May 2004 A1
20040088255 Zielke et al. May 2004 A1
20040098625 Lagadec et al. May 2004 A1
20040102197 Dietz May 2004 A1
20040103147 Flesher et al. May 2004 A1
20040107250 Marciano Jun 2004 A1
20040111305 Gavan et al. Jun 2004 A1
20040111359 Hudock Jun 2004 A1
20040117235 Shacham Jun 2004 A1
20040117358 Von Kaenel et al. Jun 2004 A1
20040122696 Beringer Jun 2004 A1
20040122730 Tucciarone et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040128150 Lundegren Jul 2004 A1
20040128156 Beringer et al. Jul 2004 A1
20040128227 Whipple et al. Jul 2004 A1
20040128230 Oppenheimer et al. Jul 2004 A1
20040128236 Brown et al. Jul 2004 A1
20040133509 McCoy et al. Jul 2004 A1
20040133513 McCoy et al. Jul 2004 A1
20040133515 McCoy et al. Jul 2004 A1
20040139025 Coleman Jul 2004 A1
20040141005 Banatwala et al. Jul 2004 A1
20040143546 Wood et al. Jul 2004 A1
20040143596 Sirkin Jul 2004 A1
20040153330 Miller et al. Aug 2004 A1
20040153448 Cheng et al. Aug 2004 A1
20040153521 Kogo Aug 2004 A1
20040158520 Noh Aug 2004 A1
20040158523 Dort Aug 2004 A1
20040176995 Fusz Sep 2004 A1
20040186807 Nathans et al. Sep 2004 A1
20040193538 Raines Sep 2004 A1
20040199456 Flint et al. Oct 2004 A1
20040199458 Ho Oct 2004 A1
20040199462 Starrs Oct 2004 A1
20040199789 Shaw et al. Oct 2004 A1
20040204948 Singletary et al. Oct 2004 A1
20040205157 Bibelnieks et al. Oct 2004 A1
20040220865 Lozowski et al. Nov 2004 A1
20040220896 Finlay et al. Nov 2004 A1
20040220918 Scriffignano et al. Nov 2004 A1
20040221043 Su et al. Nov 2004 A1
20040225099 Hohberg et al. Nov 2004 A1
20040225545 Turner et al. Nov 2004 A1
20040225594 Nolan, III et al. Nov 2004 A1
20040225596 Kemper et al. Nov 2004 A1
20040225643 Alpha et al. Nov 2004 A1
20040230534 McGough Nov 2004 A1
20040230820 Hui Hsu et al. Nov 2004 A1
20040243588 Tanner et al. Dec 2004 A1
20040254935 Chagoly et al. Dec 2004 A1
20040261116 Mckeown et al. Dec 2004 A1
20040267714 Frid et al. Dec 2004 A1
20050004805 Srinivasan Jan 2005 A1
20050005168 Dick Jan 2005 A1
20050010513 Duckworth et al. Jan 2005 A1
20050010555 Gallivan Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050021856 Basile et al. Jan 2005 A1
20050027633 Fortuna et al. Feb 2005 A1
20050027995 Menschik et al. Feb 2005 A1
20050038726 Salomon et al. Feb 2005 A1
20050038737 Norris Feb 2005 A1
20050049991 Aggarwal Mar 2005 A1
20050050027 Yeh et al. Mar 2005 A1
20050055231 Lee Mar 2005 A1
20050060332 Bernstein et al. Mar 2005 A1
20050071328 Lawrence Mar 2005 A1
20050086261 Mammone Apr 2005 A1
20050091164 Varble Apr 2005 A1
20050097039 Kulcsar et al. May 2005 A1
20050102180 Gailey et al. May 2005 A1
20050102206 Savasoglu et al. May 2005 A1
20050108396 Bittner May 2005 A1
20050108631 Amorin et al. May 2005 A1
20050113991 Rogers et al. May 2005 A1
20050114335 Wesinger, Jr. et al. May 2005 A1
20050114344 Wesinger, Jr. et al. May 2005 A1
20050114345 Wesinger, Jr. et al. May 2005 A1
20050120249 Shuster Jun 2005 A1
20050137899 Davies et al. Jun 2005 A1
20050137963 Ricketts et al. Jun 2005 A1
20050144452 Lynch et al. Jun 2005 A1
20050144641 Lewis Jun 2005 A1
20050154664 Guy et al. Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050187948 Monitzer et al. Aug 2005 A1
20050189414 Fano et al. Sep 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050197953 Broadbent et al. Sep 2005 A1
20050197954 Maitland et al. Sep 2005 A1
20050201272 Wang et al. Sep 2005 A1
20050208461 Krebs et al. Sep 2005 A1
20050209892 Miller Sep 2005 A1
20050209922 Hofmeister Sep 2005 A1
20050222900 Fuloria et al. Oct 2005 A1
20050226224 Lee et al. Oct 2005 A1
20050240468 Inman et al. Oct 2005 A1
20050246256 Gastineau et al. Nov 2005 A1
20050246338 Bird Nov 2005 A1
20050251408 Swaminathan et al. Nov 2005 A1
20050251474 Shinn et al. Nov 2005 A1
20050256780 Eldred Nov 2005 A1
20050257250 Mitchell et al. Nov 2005 A1
20050262158 Sauermann Nov 2005 A1
20050267774 Merritt et al. Dec 2005 A1
20050267821 Anderson Dec 2005 A1
20050273849 Araujo et al. Dec 2005 A1
20050278246 Friedman et al. Dec 2005 A1
20050279827 Mascavage et al. Dec 2005 A1
20050288954 McCarthy et al. Dec 2005 A1
20050288998 Verma et al. Dec 2005 A1
20050289003 Thompson et al. Dec 2005 A1
20060004626 Holmen et al. Jan 2006 A1
20060004753 Coifman et al. Jan 2006 A1
20060014129 Coleman et al. Jan 2006 A1
20060015425 Brooks Jan 2006 A1
20060020611 Gilbert et al. Jan 2006 A1
20060032909 Seegar Feb 2006 A1
20060036543 Blagg et al. Feb 2006 A1
20060036748 Nusbaum et al. Feb 2006 A1
20060041443 Horvath Feb 2006 A1
20060041670 Musseleck et al. Feb 2006 A1
20060059073 Walzak Mar 2006 A1
20060069635 Ram et al. Mar 2006 A1
20060074991 Lussier et al. Apr 2006 A1
20060079211 Degraeve Apr 2006 A1
20060080233 Mendelovich et al. Apr 2006 A1
20060080251 Fried et al. Apr 2006 A1
20060085334 Murphy Apr 2006 A1
20060085361 Hoerle et al. Apr 2006 A1
20060085454 Blegen et al. Apr 2006 A1
20060089842 Medawar Apr 2006 A1
20060122921 Comerford et al. Jun 2006 A1
20060129419 Flaxer et al. Jun 2006 A1
20060129428 Wennberg Jun 2006 A1
20060136330 DeRoy et al. Jun 2006 A1
20060136595 Satyavolu Jun 2006 A1
20060144927 Love et al. Jul 2006 A1
20060149674 Cook et al. Jul 2006 A1
20060155573 Hartunian Jul 2006 A1
20060155780 Sakairi et al. Jul 2006 A1
20060161554 Lucovsky et al. Jul 2006 A1
20060177226 Ellis, III Aug 2006 A1
20060178189 Walker et al. Aug 2006 A1
20060178971 Owen et al. Aug 2006 A1
20060179050 Giang et al. Aug 2006 A1
20060184440 Britti et al. Aug 2006 A1
20060184585 Grear et al. Aug 2006 A1
20060195688 Drissi et al. Aug 2006 A1
20060202012 Grano et al. Sep 2006 A1
20060212350 Ellis et al. Sep 2006 A1
20060229961 Lyftogt et al. Oct 2006 A1
20060235935 Ng Oct 2006 A1
20060241923 Xu et al. Oct 2006 A1
20060242046 Haggerty et al. Oct 2006 A1
20060242047 Haggerty et al. Oct 2006 A1
20060242048 Haggerty et al. Oct 2006 A1
20060242050 Haggerty et al. Oct 2006 A1
20060267999 Cash et al. Nov 2006 A1
20060271457 Romain et al. Nov 2006 A1
20060271472 Cagan Nov 2006 A1
20060276171 Pousti Dec 2006 A1
20060277089 Hubbard et al. Dec 2006 A1
20060277092 Williams Dec 2006 A1
20060277102 Agliozzo Dec 2006 A1
20060277141 Palmer Dec 2006 A1
20060282328 Gerace et al. Dec 2006 A1
20060282359 Nobili et al. Dec 2006 A1
20060282429 Hernandez-Sherrington et al. Dec 2006 A1
20060282819 Graham et al. Dec 2006 A1
20060288090 Kraft Dec 2006 A1
20060293921 McCarthy et al. Dec 2006 A1
20060293932 Cash et al. Dec 2006 A1
20060293979 Cash et al. Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070011020 Martin Jan 2007 A1
20070011039 Oddo Jan 2007 A1
20070011083 Bird et al. Jan 2007 A1
20070011099 Sheehan Jan 2007 A1
20070016500 Chatterji et al. Jan 2007 A1
20070022141 Singleton et al. Jan 2007 A1
20070022297 Britti et al. Jan 2007 A1
20070027778 Schellhammer et al. Feb 2007 A1
20070030282 Cash et al. Feb 2007 A1
20070033227 Gaito et al. Feb 2007 A1
20070038483 Wood Feb 2007 A1
20070038497 Britti et al. Feb 2007 A1
20070043654 Libman Feb 2007 A1
20070047714 Baniak et al. Mar 2007 A1
20070055618 Pogust Mar 2007 A1
20070055621 Tischler et al. Mar 2007 A1
20070061195 Liu et al. Mar 2007 A1
20070061243 Ramer et al. Mar 2007 A1
20070067207 Haggerty et al. Mar 2007 A1
20070067235 Nathans et al. Mar 2007 A1
20070067285 Blume et al. Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070067437 Sindambiwe Mar 2007 A1
20070083460 Bachenheimer Apr 2007 A1
20070094137 Phillips et al. Apr 2007 A1
20070094230 Subramaniam et al. Apr 2007 A1
20070094241 M. Blackwell et al. Apr 2007 A1
20070094264 Nair Apr 2007 A1
20070106582 Baker et al. May 2007 A1
20070112579 Ratnakaran et al. May 2007 A1
20070112668 Celano et al. May 2007 A1
20070118393 Rosen et al. May 2007 A1
20070121843 Atazky et al. May 2007 A1
20070124235 Chakraborty et al. May 2007 A1
20070127702 Shaffer Jun 2007 A1
20070130070 Williams Jun 2007 A1
20070156515 Hasselback et al. Jul 2007 A1
20070156554 Nikoley et al. Jul 2007 A1
20070156589 Zimler et al. Jul 2007 A1
20070168246 Haggerty et al. Jul 2007 A1
20070179860 Romero Aug 2007 A1
20070185797 Robinson Aug 2007 A1
20070192347 Rossmark Aug 2007 A1
20070204338 Aiello et al. Aug 2007 A1
20070208640 Banasiak et al. Sep 2007 A1
20070208729 Martino Sep 2007 A1
20070214000 Shahrabi et al. Sep 2007 A1
20070220611 Socolow et al. Sep 2007 A1
20070226010 Larsen Sep 2007 A1
20070226093 Chan et al. Sep 2007 A1
20070226129 Liao et al. Sep 2007 A1
20070244782 Chimento Oct 2007 A1
20070250327 Hedy Oct 2007 A1
20070250441 Paulsen et al. Oct 2007 A1
20070250459 Schwarz et al. Oct 2007 A1
20070261114 Pomerantsev Nov 2007 A1
20070282684 Prosser et al. Dec 2007 A1
20070282730 Carpenter et al. Dec 2007 A1
20070282736 Conlin et al. Dec 2007 A1
20070288360 Seeklus Dec 2007 A1
20070299759 Kelly Dec 2007 A1
20080004957 Hildreth et al. Jan 2008 A1
20080005313 Flake et al. Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080015938 Haddad et al. Jan 2008 A1
20080021804 Deckoff Jan 2008 A1
20080027858 Benson Jan 2008 A1
20080027859 Nathans et al. Jan 2008 A1
20080028067 Berkhin et al. Jan 2008 A1
20080033742 Bernasconi Feb 2008 A1
20080033750 Burriss et al. Feb 2008 A1
20080033956 Saha et al. Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080052244 Tsuei et al. Feb 2008 A1
20080059224 Schechter Mar 2008 A1
20080059317 Chandran et al. Mar 2008 A1
20080059364 Tidwell et al. Mar 2008 A1
20080059449 Webster et al. Mar 2008 A1
20080065774 Keeler Mar 2008 A1
20080072316 Chang et al. Mar 2008 A1
20080082536 Schwabe et al. Apr 2008 A1
20080086368 Bauman et al. Apr 2008 A1
20080097768 Godshalk Apr 2008 A1
20080103972 Lanc May 2008 A1
20080109875 Kraft May 2008 A1
20080110973 Nathans et al. May 2008 A1
20080115191 Kim et al. May 2008 A1
20080120155 Pliha May 2008 A1
20080120569 Mann et al. May 2008 A1
20080133273 Marshall Jun 2008 A1
20080133325 De et al. Jun 2008 A1
20080134042 Jankovich Jun 2008 A1
20080140476 Anand et al. Jun 2008 A1
20080140576 Lewis et al. Jun 2008 A1
20080147523 Mulry et al. Jun 2008 A1
20080167956 Keithley Jul 2008 A1
20080172324 Johnson Jul 2008 A1
20080177655 Zalik Jul 2008 A1
20080177836 Bennett Jul 2008 A1
20080183504 Highley Jul 2008 A1
20080183564 Tien et al. Jul 2008 A1
20080184270 Cole et al. Jul 2008 A1
20080195548 Chu et al. Aug 2008 A1
20080195600 Deakter Aug 2008 A1
20080201401 Pugh et al. Aug 2008 A1
20080205655 Wilkins et al. Aug 2008 A1
20080205774 Brinker et al. Aug 2008 A1
20080208548 Metzger et al. Aug 2008 A1
20080208610 Thomas et al. Aug 2008 A1
20080208631 Morita et al. Aug 2008 A1
20080208735 Balet et al. Aug 2008 A1
20080208873 Boehmer Aug 2008 A1
20080215470 Sengupta et al. Sep 2008 A1
20080216156 Kosaka Sep 2008 A1
20080221970 Megdal et al. Sep 2008 A1
20080221971 Megdal et al. Sep 2008 A1
20080221972 Megdal et al. Sep 2008 A1
20080221990 Megdal et al. Sep 2008 A1
20080222027 Megdal et al. Sep 2008 A1
20080228540 Megdal et al. Sep 2008 A1
20080228556 Megdal et al. Sep 2008 A1
20080228606 Megdal et al. Sep 2008 A1
20080228635 Megdal et al. Sep 2008 A1
20080243680 Megdal et al. Oct 2008 A1
20080244008 Wilkinson et al. Oct 2008 A1
20080249869 Angell et al. Oct 2008 A1
20080255897 Megdal et al. Oct 2008 A1
20080255975 Chaudhuri et al. Oct 2008 A1
20080262925 Kim et al. Oct 2008 A1
20080263058 Peden Oct 2008 A1
20080263638 McMurtry et al. Oct 2008 A1
20080270209 Mauseth et al. Oct 2008 A1
20080270245 Boukadoum et al. Oct 2008 A1
20080270294 Lent et al. Oct 2008 A1
20080288283 Baldwin, Jr. et al. Nov 2008 A1
20080294540 Celka et al. Nov 2008 A1
20080300977 Gerakos et al. Dec 2008 A1
20080301016 Durvasula et al. Dec 2008 A1
20080301188 O'Hara Dec 2008 A1
20080306750 Wunder et al. Dec 2008 A1
20080312963 Reiner Dec 2008 A1
20080312969 Raines et al. Dec 2008 A1
20080319889 Hammad Dec 2008 A1
20080320575 Gelb et al. Dec 2008 A1
20090006185 Stinson Jan 2009 A1
20090006475 Udezue et al. Jan 2009 A1
20090012889 Finch Jan 2009 A1
20090018986 Alcorn et al. Jan 2009 A1
20090018996 Hunt et al. Jan 2009 A1
20090019027 Ju et al. Jan 2009 A1
20090024428 Hudock, Jr. Jan 2009 A1
20090024505 Patel et al. Jan 2009 A1
20090030776 Walker et al. Jan 2009 A1
20090031426 Dal Lago et al. Jan 2009 A1
20090043637 Eder Feb 2009 A1
20090043691 Kasower Feb 2009 A1
20090048877 Binns et al. Feb 2009 A1
20090055894 Lorsch Feb 2009 A1
20090060343 Rosca Mar 2009 A1
20090076883 Kilger et al. Mar 2009 A1
20090089190 Girulat Apr 2009 A1
20090089205 Bayne Apr 2009 A1
20090094064 Tyler et al. Apr 2009 A1
20090094237 Churi et al. Apr 2009 A1
20090094674 Schwartz et al. Apr 2009 A1
20090094675 Powers Apr 2009 A1
20090099914 Lang et al. Apr 2009 A1
20090106846 Dupray et al. Apr 2009 A1
20090112650 Iwane Apr 2009 A1
20090113532 Lapidous Apr 2009 A1
20090119169 Chandratillake et al. May 2009 A1
20090119199 Salahi May 2009 A1
20090132347 Anderson et al. May 2009 A1
20090138335 Lieberman May 2009 A1
20090144102 Lopez Jun 2009 A1
20090144201 Gierkink et al. Jun 2009 A1
20090150166 Leite et al. Jun 2009 A1
20090150238 Marsh et al. Jun 2009 A1
20090164232 Chmielewski et al. Jun 2009 A1
20090164380 Brown Jun 2009 A1
20090172815 Gu et al. Jul 2009 A1
20090183259 Rinek et al. Jul 2009 A1
20090198557 Wang et al. Aug 2009 A1
20090198602 Wang et al. Aug 2009 A1
20090198612 Meimes et al. Aug 2009 A1
20090210807 Xiao et al. Aug 2009 A1
20090210886 Bhojwani et al. Aug 2009 A1
20090215479 Karmarkar Aug 2009 A1
20090216591 Buerger et al. Aug 2009 A1
20090216640 Masi Aug 2009 A1
20090222308 Zoldi et al. Sep 2009 A1
20090222373 Choudhuri et al. Sep 2009 A1
20090222374 Choudhuri et al. Sep 2009 A1
20090222375 Choudhuri et al. Sep 2009 A1
20090222376 Choudhuri et al. Sep 2009 A1
20090222377 Choudhuri et al. Sep 2009 A1
20090222378 Choudhuri et al. Sep 2009 A1
20090222379 Choudhuri et al. Sep 2009 A1
20090222380 Choudhuri et al. Sep 2009 A1
20090222449 Hom et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234665 Conkel Sep 2009 A1
20090234775 Whitney et al. Sep 2009 A1
20090234876 Schigel et al. Sep 2009 A1
20090240609 Cho et al. Sep 2009 A1
20090248567 Haggerty et al. Oct 2009 A1
20090248568 Haggerty et al. Oct 2009 A1
20090248569 Haggerty et al. Oct 2009 A1
20090248570 Haggerty et al. Oct 2009 A1
20090248571 Haggerty et al. Oct 2009 A1
20090248572 Haggerty et al. Oct 2009 A1
20090248573 Haggerty et al. Oct 2009 A1
20090249440 Platt et al. Oct 2009 A1
20090254375 Martinez et al. Oct 2009 A1
20090254656 Vignisson et al. Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090265326 Lehrman et al. Oct 2009 A1
20090271248 Sherman et al. Oct 2009 A1
20090271265 Lay et al. Oct 2009 A1
20090276233 Brimhall et al. Nov 2009 A1
20090276368 Martin et al. Nov 2009 A1
20090300066 Guo et al. Dec 2009 A1
20090313049 Joao et al. Dec 2009 A1
20090313163 Wang et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090319648 Dutta et al. Dec 2009 A1
20090327120 Eze et al. Dec 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100010935 Shelton Jan 2010 A1
20100011428 Atwood et al. Jan 2010 A1
20100023434 Bond Jan 2010 A1
20100030578 Siddique et al. Feb 2010 A1
20100030677 Melik-Aslanian et al. Feb 2010 A1
20100037299 Karasick et al. Feb 2010 A1
20100042583 Gervais Feb 2010 A1
20100049651 Lang et al. Feb 2010 A1
20100049803 Ogilvie et al. Feb 2010 A1
20100094704 Subramanian et al. Apr 2010 A1
20100094758 Chamberlain et al. Apr 2010 A1
20100094774 Jackowitz et al. Apr 2010 A1
20100114646 McIlwain et al. May 2010 A1
20100114724 Ghosh et al. May 2010 A1
20100142698 Spottiswoode et al. Jun 2010 A1
20100145836 Baker et al. Jun 2010 A1
20100145840 Kasower Jun 2010 A1
20100169159 Rose et al. Jul 2010 A1
20100169264 O'Sullivan Jul 2010 A1
20100185453 Satyavolu et al. Jul 2010 A1
20100185546 Pollard Jul 2010 A1
20100188684 Kumara Jul 2010 A1
20100198629 Wesileder et al. Aug 2010 A1
20100205076 Parson et al. Aug 2010 A1
20100211445 Bodington Aug 2010 A1
20100211636 Starkenburg et al. Aug 2010 A1
20100217837 Ansari et al. Aug 2010 A1
20100228657 Kagarlis Sep 2010 A1
20100248681 Phills Sep 2010 A1
20100250338 Banerjee et al. Sep 2010 A1
20100250410 Song et al. Sep 2010 A1
20100250411 Ogrodski Sep 2010 A1
20100250434 Megdal et al. Sep 2010 A1
20100250497 Redlich et al. Sep 2010 A1
20100250509 Andersen Sep 2010 A1
20100268557 Faith et al. Oct 2010 A1
20100268660 Ekdahl Oct 2010 A1
20100293090 Domenikos et al. Nov 2010 A1
20100293114 Khan et al. Nov 2010 A1
20100332292 Anderson Dec 2010 A1
20110009707 Kaundinya et al. Jan 2011 A1
20110016042 Cho et al. Jan 2011 A1
20110023115 Wright Jan 2011 A1
20110029388 Kendall et al. Feb 2011 A1
20110047071 Choudhuri et al. Feb 2011 A1
20110054981 Faith Mar 2011 A1
20110066495 Ayloo et al. Mar 2011 A1
20110071950 Ivanovic Mar 2011 A1
20110076663 Krallman et al. Mar 2011 A1
20110078073 Annappindi et al. Mar 2011 A1
20110093383 Haggerty et al. Apr 2011 A1
20110112958 Haggerty et al. May 2011 A1
20110113084 Ramnani May 2011 A1
20110113086 Long et al. May 2011 A1
20110125595 Neal et al. May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110131131 Griffin et al. Jun 2011 A1
20110137760 Rudie et al. Jun 2011 A1
20110137789 Kortina et al. Jun 2011 A1
20110142213 Baniak et al. Jun 2011 A1
20110145122 Haggerty et al. Jun 2011 A1
20110161218 Swift Jun 2011 A1
20110161323 Hagiwara Jun 2011 A1
20110164746 Nice et al. Jul 2011 A1
20110166988 Coulter Jul 2011 A1
20110173116 Yan et al. Jul 2011 A1
20110178899 Huszar Jul 2011 A1
20110178922 Imrey et al. Jul 2011 A1
20110179139 Starkenburg et al. Jul 2011 A1
20110184838 Winters et al. Jul 2011 A1
20110196791 Dominguez Aug 2011 A1
20110202474 Mele et al. Aug 2011 A1
20110211445 Chen Sep 2011 A1
20110218826 Birtel et al. Sep 2011 A1
20110219421 Ullman et al. Sep 2011 A1
20110238566 Santos Sep 2011 A1
20110251946 Haggerty et al. Oct 2011 A1
20110258050 Chan et al. Oct 2011 A1
20110264566 Brown Oct 2011 A1
20110270779 Showalter Nov 2011 A1
20110276396 Rathod Nov 2011 A1
20110307397 Benmbarek Dec 2011 A1
20110320307 Mehta et al. Dec 2011 A1
20120011056 Ward et al. Jan 2012 A1
20120011158 Avner et al. Jan 2012 A1
20120016948 Sinha Jan 2012 A1
20120017266 DiChiara et al. Jan 2012 A1
20120029956 Ghosh et al. Feb 2012 A1
20120029996 Lang et al. Feb 2012 A1
20120030216 Churi et al. Feb 2012 A1
20120030771 Pierson et al. Feb 2012 A1
20120047219 Feng et al. Feb 2012 A1
20120054592 Jaffe et al. Mar 2012 A1
20120066065 Switzer Mar 2012 A1
20120066084 Sneyders Mar 2012 A1
20120072464 Cohen Mar 2012 A1
20120101939 Kasower Apr 2012 A1
20120106801 Jackson May 2012 A1
20120110467 Blake et al. May 2012 A1
20120110677 Abendroth et al. May 2012 A1
20120124498 Santoro et al. May 2012 A1
20120136763 Megdal et al. May 2012 A1
20120136774 Imrey et al. May 2012 A1
20120143921 Wilson Jun 2012 A1
20120150587 Kruger Jun 2012 A1
20120158460 Kruger Jun 2012 A1
20120158574 Brunzell et al. Jun 2012 A1
20120158654 Behren et al. Jun 2012 A1
20120173339 Flynt et al. Jul 2012 A1
20120179536 Kalb et al. Jul 2012 A1
20120198556 Patel et al. Aug 2012 A1
20120209586 Mieritz et al. Aug 2012 A1
20120215682 Lent et al. Aug 2012 A1
20120216125 Pierce Aug 2012 A1
20120226916 Hahn et al. Sep 2012 A1
20120232958 Silbert Sep 2012 A1
20120239497 Nuzzi Sep 2012 A1
20120239515 Batra et al. Sep 2012 A1
20120265607 Belwadi Oct 2012 A1
20120284118 Mamich, Jr. Nov 2012 A1
20120290660 Rao et al. Nov 2012 A1
20120317016 Hughes Dec 2012 A1
20120323954 Bonalle et al. Dec 2012 A1
20130018811 Britti et al. Jan 2013 A1
20130031109 Roulson et al. Jan 2013 A1
20130031624 Britti et al. Jan 2013 A1
20130080242 Alhadeff et al. Mar 2013 A1
20130080467 Carson et al. Mar 2013 A1
20130085804 Leff et al. Apr 2013 A1
20130085902 Chew Apr 2013 A1
20130117832 Gandhi May 2013 A1
20130124263 Amaro May 2013 A1
20130125010 Strandell May 2013 A1
20130132151 Stibel et al. May 2013 A1
20130137464 Kramer et al. May 2013 A1
20130151388 Falkenborg et al. Jun 2013 A1
20130159168 Evans Jun 2013 A1
20130159411 Bowen Jun 2013 A1
20130173481 Hirtenstein et al. Jul 2013 A1
20130185293 Boback Jul 2013 A1
20130211986 Debie et al. Aug 2013 A1
20130218638 Kilger et al. Aug 2013 A1
20130226783 Haggerty et al. Aug 2013 A1
20130226787 Haggerty et al. Aug 2013 A1
20130226820 Sedota, Jr. et al. Aug 2013 A1
20130238413 Carlson et al. Sep 2013 A1
20130268357 Heath Oct 2013 A1
20130279676 Baniak et al. Oct 2013 A1
20130293363 Plymouth Nov 2013 A1
20130332338 Yan et al. Dec 2013 A1
20130332342 Kasower Dec 2013 A1
20130347059 Fong et al. Dec 2013 A1
20140025562 Rothrock et al. Jan 2014 A1
20140032265 Paprocki et al. Jan 2014 A1
20140032300 Zhang et al. Jan 2014 A1
20140040182 Gilder et al. Feb 2014 A1
20140046887 Lessin Feb 2014 A1
20140095251 Huovilainen Apr 2014 A1
20140279197 Ainsworth, III et al. Sep 2014 A1
20140316969 Imrey Oct 2014 A1
20150066772 Griffin et al. Mar 2015 A1
20150095184 Ainsworth et al. Apr 2015 A1
20150095187 Ainsworth et al. Apr 2015 A1
20150108227 Nack et al. Apr 2015 A1
20150235230 Ainsworth, III et al. Aug 2015 A1
20150248661 Pontious Sep 2015 A1
20150248665 Walz Sep 2015 A1
20150248691 Pontious Sep 2015 A1
20150248716 Ainsworth, III et al. Sep 2015 A1
20150262109 Ainsworth, III et al. Sep 2015 A1
20150262291 West et al. Sep 2015 A1
20150278225 Weiss et al. Oct 2015 A1
20150295906 Ufford et al. Oct 2015 A1
20150332414 Unser Nov 2015 A1
20160004728 Balet et al. Jan 2016 A1
20160005114 Donovan et al. Jan 2016 A1
20160048700 Stransky-Heilkron Feb 2016 A1
20160055487 Votaw et al. Feb 2016 A1
20160071175 Reuss et al. Mar 2016 A1
20160092997 Shen et al. Mar 2016 A1
20160098775 Ainsworth, III et al. Apr 2016 A1
20160098776 Ainsworth, III et al. Apr 2016 A1
20160098784 Ainsworth, III et al. Apr 2016 A1
20160110694 Walz et al. Apr 2016 A1
20160110707 Nack et al. Apr 2016 A1
20160140639 Ainsworth, III et al. May 2016 A1
20160155160 Walz et al. Jun 2016 A1
20160155191 Walz et al. Jun 2016 A1
20160171542 Fanous et al. Jun 2016 A1
20160180258 Walz Jun 2016 A1
20160180349 Korra et al. Jun 2016 A1
20160183051 Nack et al. Jun 2016 A1
20160189152 Walz Jun 2016 A1
20160189192 Walz Jun 2016 A1
20160210224 Cohen et al. Jul 2016 A1
20160267485 Walz et al. Sep 2016 A1
20160267508 West Sep 2016 A1
20160267513 Walz et al. Sep 2016 A1
20160267514 Walz et al. Sep 2016 A1
20160267515 Walz et al. Sep 2016 A1
20160267516 Walz et al. Sep 2016 A1
20160342999 Rouston et al. Nov 2016 A1
20160350851 Ainsworth, III et al. Dec 2016 A1
20170039588 Koltnow et al. Feb 2017 A1
20170039616 Korra et al. Feb 2017 A1
20170061511 Korra et al. Mar 2017 A1
20170061532 Koltnow et al. Mar 2017 A1
20170161780 Michalek Jun 2017 A1
20170177809 Bull et al. Jun 2017 A1
20170186297 Brenner Jun 2017 A1
20170193315 El-Khamy et al. Jul 2017 A1
20180053172 Nack et al. Feb 2018 A1
20180053252 Koltnow et al. Feb 2018 A1
20180060546 Yin Mar 2018 A1
20180089379 Collins et al. Mar 2018 A1
20180101889 Nack et al. Apr 2018 A1
20180150599 Valdes et al. May 2018 A1
20180218069 Rege et al. Aug 2018 A1
20180308151 Ainsworth, III et al. Oct 2018 A1
20180330383 Pontious et al. Nov 2018 A1
20180330415 Billman et al. Nov 2018 A1
20180343265 McMillan et al. Nov 2018 A1
20190005498 Roca et al. Jan 2019 A1
20190026354 Kapczynski Jan 2019 A1
20190043126 Billman et al. Feb 2019 A1
Foreign Referenced Citations (61)
Number Date Country
2 865 348 Mar 2015 CA
2 895 452 Jan 2016 CA
2 901 057 Apr 2016 CA
2 909 392 Jun 2016 CA
2 915 375 Jun 2016 CA
2 923 334 Sep 2016 CA
10-2013-0107394 Oct 2013 KR
256569 Jun 2006 TW
WO 94006103 Mar 1994 WO
WO 95034155 Dec 1995 WO
WO 96000945 Jan 1996 WO
WO 97023838 Jul 1997 WO
WO 98041931 Sep 1998 WO
WO 98041932 Sep 1998 WO
WO 98041933 Sep 1998 WO
WO 98049643 Nov 1998 WO
WO 99017225 Apr 1999 WO
WO 99017226 Apr 1999 WO
WO 99022328 May 1999 WO
WO 99038094 Jul 1999 WO
WO 00004465 Jan 2000 WO
WO 00028441 May 2000 WO
WO 00055778 Sep 2000 WO
WO 00055789 Sep 2000 WO
WO 00055790 Sep 2000 WO
WO 00065469 Nov 2000 WO
WO 01009752 Feb 2001 WO
WO 01009792 Feb 2001 WO
WO 01010090 Feb 2001 WO
WO 01011522 Feb 2001 WO
WO 01084281 Nov 2001 WO
WO 2004031986 Apr 2004 WO
WO 2004051436 Jun 2004 WO
WO 2004088464 Oct 2004 WO
WO 2004114160 Dec 2004 WO
WO 2005059781 Jun 2005 WO
WO 2005124619 Dec 2005 WO
WO 2006050278 May 2006 WO
WO 2007004158 Jan 2007 WO
WO 2007014271 Feb 2007 WO
WO 2007106393 Sep 2007 WO
WO 2008022289 Feb 2008 WO
WO 2008042614 Apr 2008 WO
WO 2008054403 May 2008 WO
WO 2008076343 Jun 2008 WO
WO 2008127288 Oct 2008 WO
WO 2008147918 Dec 2008 WO
WO 2009061342 May 2009 WO
WO 2009076555 Jun 2009 WO
WO 2009117518 Sep 2009 WO
WO 2009132114 Oct 2009 WO
WO 2010045160 Apr 2010 WO
WO 2010062537 Jun 2010 WO
WO 2010132492 Nov 2010 WO
WO 2010150251 Dec 2010 WO
WO 2011005876 Jan 2011 WO
WO 2013009920 Jan 2013 WO
WO 2014018900 Jan 2014 WO
WO 2015162681 Oct 2015 WO
WO 2018039377 Mar 2018 WO
WO 2018144612 Aug 2018 WO
Non-Patent Literature Citations (20)
Entry
Amo, Tina, “How to Find Out Who Has Lived inYour House Before You”, https://web.archive.org/web/20130327090532/http://homeguides.sfgate.com/out-lived-house-before-50576.html as archived Mar. 27, 2013, pp. 2.
Gao et al., “Exploring Temporal Effects for Location Recommendation on Location-Based Social Networks”, RecSys'13, Oct. 12-16, 2013, Hong Kong, China, pp. 93-100.
MERit Credit Engine™, Diagram, http://creditengine.net/diagram.htm, copyright 1997, pp. 1.
Nelson et al., “Efficient, Automatic Web Resource Harvesting”, Conference: Eigth ACM International Workshop on Web Information and Data Management (WIDM 2006), Arlington, Virginia, USA, Nov. 10, 2006, pp. 8.
“New FICO score extends lenders' reach to credit-underserved millions”, Viewpoints: News, Ideas and Solutions from Fair Isaac, Sep./Oct. 2004 as downloaded from http://www.fairisaac.com/NR/exeres/F178D009-647A-444F-BD11-8B4D7D8B3532,frame . . . in 6 pages.
Reinartz et al., “On the Profitability of Long-Life Customers in a Noncontractual Setting: An Empirical Investigation and Implications for Marketing” Journal of Marketing, Oct. 2000, vol. 64, pp. 17-35.
“STAGG Variables Sum Up Credit Attributes for Automated Decisions”, PRWeb, May 11, 2011, pp. 2. http://www.prweb.com/releases/2011/5/prweb8404324.htm.
Tan et al., “Modeling of Web Robot Navigational Patterns”, 2000, Department of Computer Science; University of Minnesota, pp. 7.
Yuan et al., “Time-Aware Point-of-Interest Recommendation”, SIGIR'13, Jul. 28-Aug. 1, 2013, Dublin, Ireland, pp. 363-372.
Official Communication in Australian Patent Application No. 2012281182, dated Jul. 8, 2014.
Official Communication in Australian Patent Application No. 2012281182, dated May 19, 2015.
Official Communication in European Patent Application No. 12811546.6, dated Sep. 18, 2015.
International Search Report and Written Opinion for Application No. PCT/US2017/048265, dated Dec. 5, 2017.
International Preliminary Report on Patentability in Application No. PCT/US2017/048265, dated Mar. 7, 2019.
International Search Report and Written Opinion for Application No. PCT/US2018/016258, dated May 16, 2018.
U.S. Appl. No. 14/244,186, U.S. Pat. No. 10,102,536, Micro-Georgraphic Aggregation System, filed Apr. 3, 2014.
U.S. Appl. No. 12/705,489, filed Feb. 12, 2010, Bargoli et al.
U.S. Appl. No. 12/705,511, filed Feb. 12, 2010, Bargoli et al.
International Preliminary Report on Patentability in Application No. PCT/US2018/016258, dated Aug. 15, 2019.
Official Communication in Indian Patent Application No. 490/DELNP/2014, dated Jun. 20, 2019.
Related Publications (1)
Number Date Country
20190095939 A1 Mar 2019 US
Provisional Applications (1)
Number Date Country
61905021 Nov 2013 US
Continuations (1)
Number Date Country
Parent 14244186 Apr 2014 US
Child 16144230 US