Systems and methods for determining thin-file records and determining thin-file risk levels

Information

  • Patent Grant
  • 8271378
  • Patent Number
    8,271,378
  • Date Filed
    Monday, September 19, 2011
    13 years ago
  • Date Issued
    Tuesday, September 18, 2012
    12 years ago
Abstract
In some embodiments, systems and methods are disclosed for generating filters to determine whether a consumer is likely to have a scoreable credit record based on non-credit data, and to determine a potential risk level associated with an unscoreable credit record based on non-credit data. Existing scoreable and unscoreable records are compared to determine factors correlated with having an unscoreable record, and a multi-level filter is developed. Unscoreable records having at least one entry are compared to determine whether they are “good” or “bad” risks, factors correlated with either condition are determined, and a filter is developed. The filters can be applied to records comprising demographic data to determine consumers that are likely to have unscoreable records but represent good risks.
Description
TECHNICAL FIELD

This disclosure relates generally to financial data processing systems, and more particularly to methods and systems for developing filters to identify thin-file credit records and assess a risk level associated with thin-file credit records.


DESCRIPTION OF THE RELATED ART

Various financial service providers provide credit accounts such as mortgages, automobile loans, credit card accounts, and the like, to consumers. Financial service providers typically determine whether or not to offer a particular consumer a credit account and on what terms based upon a credit history acquired by the consumer over a period of time. A consumer credit history may reflect the credit related activities of the consumer, such as taking out loans, making payments, or the like, and may be embodied in a report or score.


However, some consumers have little or no credit history. For example, young people often do not have any credit history. This situation can make it difficult for a financial service provider to determine whether a consumer represents a “good” or “bad” credit risk, even though reaching the consumer before they have a significant credit history may be an effective way to build new business.


SUMMARY OF THE INVENTION

Accordingly, systems and methods are disclosed for determining the likelihood of a consumer having a thin-file record (for example, little or no credit record) and assessing a risk level associated with a potential thin-file consumer.


According to one embodiment, a computing system may determine whether existing credit records are either scoreable records or thin-file records. The two groups of records may be analyzed, such that non-credit data variables that correlate or are otherwise related to a likelihood of an individual being a thin-file record are determined. These correlated variables are weighted and combined to generate a multi-level filter. The multi-level filter is configured to provide a score related to a likelihood of an individual having a thin-file record based on non-credit data.


According to another embodiment, a computing system filters thin-file records to determine those having at least one transaction entry. Those thin-file records that have at least one transaction entry are further filtered based on whether the transaction entry is in good standing. Demographic characteristics and non-credit data that correlate with or are otherwise related to being a “good” or “bad” credit risk are determined by comparing the characteristics of those thin-file records having a transaction entry that is “good” with those that are “bad.” A multi-level filter is developed based on these variables that provide a score related to the credit-risk associated with a thin-file record based on non-credit data.


These and additional embodiments are discussed in greater detail below. Numerous other advantages and features of the present invention will become readily apparent from the following detailed description of the invention and the embodiments thereof, from the claims and from the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

The objects, features and advantages of the present invention will be more readily appreciated upon reference to the following disclosure when considered in conjunction with the accompanying drawings and examples which form a portion of the specification, in which:



FIG. 1 is a block diagram of a system for generating and applying filters to determine a likelihood of being a thin-file record and an associated risk level according to one embodiment;



FIG. 2 is a flowchart showing a process for generating and applying filters to determine a likelihood of being a thin-file record and an associated risk level according to one embodiment;



FIG. 3 is a process diagram showing the processing of credit records to develop thin-file filters according to one embodiment;



FIG. 4 is a process diagram showing the processing of potential customer data by the filters developed in FIG. 3 according to one embodiment;



FIGS. 5A-C show credit database records utilized to develop the thin-file filters according to one embodiment; and



FIG. 6 is a diagram showing various levels of specificity for analyzing demographic data for the thin-file filters according to one embodiment.





DESCRIPTION OF THE PREFERRED EMBODIMENTS

Embodiments of the invention will now be described with reference to the 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 invention. Furthermore, embodiments of the invention may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the inventions herein described.



FIG. 1 is one embodiment of a block diagram of a computing system 100 that is in communication with a network 160 and various devices and/or systems that are also in communication with the network 160. The computing system 100 may be used to implement certain systems and methods described herein. For example, the computing system 100 may be configured to analyze demographic information in order to determine a likelihood that a consumer has a thin-file record and to determine a credit risk associated with the thin-file record. Although the description provided herein refers to individuals, consumers, or customers, the terms “individual,” “consumer,” and “customer” should be interpreted to include applicants, or groups of individuals or customers or applicants, such as, for example, married couples or domestic partners, and business entities. The functionality provided for in the components and modules of computing system 100 may be combined into fewer components and modules or further separated into additional components and modules.


The computing system 100 includes, for example, a personal computer that is IBM, Macintosh, or Linux/Unix compatible. In one embodiment, the computing system 100 comprises a server, a laptop computer, a cell phone, a personal digital assistant, a kiosk, or an audio player, for example. In one embodiment, the exemplary computing system 100 includes a central processing unit (“CPU”) 105, which may include a conventional microprocessor. The computing system 100 further includes a memory 130, such as random access memory (“RAM”) for temporary storage of information and a read only memory (“ROM”) for permanent storage of information, and a mass storage device 120, such as a hard drive, diskette, or optical media storage device. Typically, the modules of the computing system 100 are connected to the computer using a standards based bus system. In different embodiments, the standards based bus system could be Peripheral Component Interconnect (PCI), Microchannel, SCSI, Industrial Standard Architecture (ISA) and Extended ISA (EISA) architectures, for example.


The computing system 100 is generally controlled and coordinated by operating system software, such as Windows 95, Windows 98, Windows NT, Windows 2000, Windows XP, Windows Vista, Linux, SunOS, Solaris, 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 computing 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.


In the embodiment of FIG. 1, the computing system 100 also includes a thin-file module 150 that may be executed by the CPU 105. This module 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.


Thin-file module 150 of the computing system 100 operates to generate filters that are applied to consumer records in a demographic database for determining whether a consumer is likely to be a thin-file record and to define a risk level associated with potential thin-file records, based on demographic data and/or other non-credit data. It is also recognized that other data may be used. The thin-file module 150 further operates to apply these filters to existing and potential customer demographic database records, and to generate reports based on the application of these filters. For example, a report may be generated for a client system 164 that indicates individual consumers or groups of consumers having certain characteristics associated with “good” risk thin-file consumers so that the client system 164 may target marketing efforts to those consumers. Thin-file module 150 and the operations thereof are described in more detail below.


The exemplary computing system 100 includes 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 device, 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 computing 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. 1, the I/O devices and interfaces 110 provide a communication interface to various external devices. In the embodiment of FIG. 1, the computing system 100 communicates with a network 160, such as a LAN, WAN, 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 and/or systems via wired or wireless communication links.


According to FIG. 1, information is provided to computing system 100 over the network 160 from one or more data sources including, for example, one or more of the financial data sources 162, the client system 164, and one or more demographic data sources 166. The information supplied by the various data sources may include credit data, demographic data, application information, product terms, accounts receivable data, and financial statements, for example. Financial data sources may comprise a regulated credit database storing consumer records having demographic data, non-credit data, and credit data. Demographic data source 166 may comprise an unregulated demographic database storing consumer records having demographic and other non-credit data.


In addition to the devices and systems that are illustrated in FIG. 1, the network 160 may communicate with other data sources or other computing devices and/or systems. In addition, the data sources may include one or more internal and/or external data sources. 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.


Client system 164 may include, for example, a financial service provider or a collection agency. One client system 164 is shown, but any number of clients 164 may communicate with the computing system 100 over the network 160. The client system 164 may provide data related to consumer credit activity, such as opening new accounts, making payments on existing accounts, or the like. In addition to supplying data, client system 164 may further request and/or receive information from the computing system 100. For example, the client system 164 may request information related to thin-file accounts analyzed by the computing system 100.


The network 160 may comprise one or more networks in some embodiments, as described above. The financial data sources 162, client system 164, demographic data sources 166, and any additional data sources may communicate over the same network or over different networks. For example, financial data sources 162 may comprise public data available over the Internet, while the computing system 100 may access demographic data source over a secured LAN. In some embodiments, one of the data sources such as financial data sources 162 comprises multiple sources, and some of the sources are available to computing system 100 over the network 160 while others are accessed via another connection, such as a LAN.


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 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.



FIG. 2 shows one embodiment of a process 200 for identifying thin-file records and developing filters for analyzing new thin-file applicants based on demographic or other non-credit data. In some embodiments, the process 200 is a computer-implemented process that is stored and runs on the computing system 100. In one embodiment, the process 200 applies the filter to the data based on two or more attributes or collections of attributes of consumer records in a demographic database. Thus, the filter may be a single-level filter or a multi-level filter. As one example, one level of the filter may be directed to one or more of the demographic data fields such as marital status whereas another level of the filter may be directed to attributes associated with a geographic area.


Process 200 begins at state 210 where thin-file records are identified. Thin-file records may be identified, for example, within a credit database stored by computing system 100 or available as a financial data source 162 over the network 160. In one embodiment, thin-file records comprise those records which do not include a sufficient amount of credit related data to provide a score or other metric for assessing the credit-worthiness of a consumer associated with that record. For example, consumers that do not have a long credit history, have never had a credit card or a loan, or for whatever reason, do not have sufficient amount of credit data to develop a score may be identified as thin-file records. In some embodiments, thin-file records are those records having either zero transaction entries or one transaction entry, where a transaction entry corresponds to a credit related activity such as applying for a loan or taking out a credit card. In some embodiments, the records relate to a specific country or region.


At state 220, those records identified as being thin-file records and having at least one transaction entry are identified. Thus, at state 220, records within a credit database may be identified as either a scoreable record, a thin-file record having at least one transaction entry, or a thin-file record.


At state 230, a filter is developed to determine the propensity of an individual to be a thin-file record based on demographic data in the records of the credit database. In one embodiment, based on the tracked thin-file records identified at state 210, a filter is developed that, when applied to a set of data in a demographic database, determines whether or not a consumer is likely to be a thin-file record based on non-credit data. At state 240, the filter is applied to a record in a demographic database, for example of a new or potential credit applicant, to determine whether or not the consumer related to that record is likely to be a thin-file record. In other embodiments, the filter is applied to a set of consumer records in a demographic database. In other embodiments, other databases may be used.


The one-entry thin-file records identified at state 220 may also be used to develop a filter at state 250 to assess the risk score of an individual deemed to be a thin-file. For example, those one-entry thin-file records may be filtered to determine whether or not the existing entry represents “good” or “bad” credit activity. The state of being a “good” or “bad” credit risk, or a quantitative representation of credit worthiness along a scale, may be correlated with demographic information or other non-credit data included within the credit record. Thus, a filter may be developed for assessing a risk level that is not dependent on credit information, but rather on demographic data and other information that is likely to be available for a potential applicant from a demographic database. At state 260 the filter developed at state 250 is applied to a record in a demographic database to determine the risk score of an individual deemed to be a thin-file record.


As an example case, the filters developed at state 230 may be used to identify particular demographic groups, such as those people living in a certain area or having certain characteristics, that are likely to be thin-file records. Records corresponding to those groups may be further analyzed by the filter developed at state 250 to determine whether or not they are likely to be “good” credit risks. Thus, for example, a group of people such as those people in a zip code area that is known to have “good” credit consumers living therein may be targeted, for example, for a mailing campaign.



FIG. 3 is a diagram showing one embodiment of a process 300 for filtering and comparing credit records in order to develop a thin-file propensity filter 360 and a thin-file risk filter 395. In some embodiments, the process 300 is a computer-implemented process that is stored and runs on the computing system 100. The process 300 begins when credit records 301 and 302 in a credit record database 310 are filtered at state 320. The credit record database 310 may, according to some embodiments, be stored in the memory 130 of the computing system 100 and/or may be accessed over the network 160. The credit record database 310 may comprise records relating to a large number of consumers, such as more than one million. In some embodiments, credit database 310 is a regulated database. Credit record database 310 comprises scoreable credit records 301 and thin-file (for example, non-scoreable) credit records 302. Records in a set of the records are compared at state 320. In some embodiments, the set is all of the records, a subset of the records, or a random subset of the records. Those records that are determined to be thin-file records may be identified as a thin-file record collection 340. Those records that are scoreable may be identified as a non-thin-file record collection 330.


As shown, scoreable record collection 330 comprises scoreable record 301 sorted by a filter at state 320 from credit database 310. Scoreable record collection 330 may identify any number of scoreable records 301.


Thin-file record collection 340 comprises thin-file records 302a, 302b, and 302c filtered from credit database 310 at state 320. Three thin-file records 302a, 302b, and 302c are shown in FIG. 3. However, any number of thin-file records may be identified in thin-file record collection 340. The number of thin-file records stored in the thin-file record collection 340 is related to the number of thin-file records stored in credit database 310.


In order to develop the thin-file propensity filter 360, records identified by scoreable record collection 330 and records identified by thin-file record collection 340 are compared at state 350. That is, all or a subset of the scoreable records 301 identified by the scoreable record collection 330 are compared with all or a subset of the thin-file records 302 identified by the thin-file record collection 340 at state 350. The scoreable records 301 are compared with thin-file records 302 on the basis of, for example, the demographic information therein. It is determined at state 350 what demographic characteristics or other non-credit data correlates to, is dependent on, or is otherwise related to a record being either a thin-file record 302 or a scoreable record 301. Certain characteristics or variables may be directly related, such as a length of time at a current residence. Other variables may be indirectly related. For example, it may be determined that individuals living within a geographic area having certain characteristics such as a low average income are more likely to have thin-file records. In that case, the thin-file propensity filter 360 may be developed such that the geographic area in which a consumer resides and the characteristics of that area are taken into account. In general, the thin-file propensity filter 360 may apply weights to values of certain characteristics. In addition to those mentioned above, characteristics used to determine whether or not an individual is likely to be a thin-file record may comprise, for example, the individual consumer's percentage of bank cards reported delinquent in a geographic area, the length of residence at the consumer's current residence, the average length of residence for consumers in a certain geographic area, the percentage of households in an area comprising families rather than individuals, the age of the consumer, some combination of these or other characteristics, or the like. In some embodiments, certain characteristics may be excluded even though they are determined to be related. For example, a consumer age may be relevant but removed because certain credit decisions made by a client 164 cannot be dependent on age according to government regulations. Characteristics may be converted into quantitative representations. For example, a characteristic may comprise a consumers' presence in an age group between 18-20 years old, corresponding to a “yes” or “no” value. A quantitative value of “1” or “0” may be assigned to each possibility. The quantitative representations may comprise binary values as described above, some other set of discrete values, or numerical values along a continuous scale. The values are weighted in the filter according to their importance or correlation to the presence or absence of a thin-file condition.



FIG. 3 also shows a process for developing a thin-file risk filter 395. While the development of thin-file risk filter 395 is shown interleaved with that for creating thin-file propensity filter 360, the two may be independent.


Utilizing a thin-file record collection 340, the thin-file records are filtered at state 355 to identify those thin-file records having one transaction entry. As shown in FIG. 3, thin-file records 302a and 302b have only one entry, while thin-file record 302c has zero entries. Thin-file records 302a and 302b are therefore identified in a one-entry collection 365. One-entry collection 365 is shown identifying two thin-file records, but may identify any number of thin-file records. While the embodiment shown filters the thin-file records 302 based on whether they comprise one or zero entries, in some embodiments the thin-file records may comprise more than one entry, and the filter 355 may filter the thin-file records based on some other predetermined minimum number of entries.


At state 370 thin-file records identified by one-entry collection 365 are filtered. Thin-file records 302a and 302b are filtered to determine whether or not these records correspond to “good” or “bad” credit risks. Although thin-file records 302a and 302b are shown being filtered, all of the records identified by the one-entry collection 365, or a subset of the records identified by the one-entry collection 365, may be filtered. Filtering may comprise a determination of the existing transaction entry for a thin-file record is a “good” risk or a “bad” risk. After it is determined whether or not thin-file records 302a and 302b are “good” or “bad” credit risks, they are identified by “good” risk collection 380 or “bad” risk collection 385. In the example shown, “good” risk collection 380 identifies thin-file record 303b. “Bad” risk collection 385 identifies thin-file record 303a.


At state 390, the records identified by “good” risk collection 380 and “bad” risk collection 385 are compared. The compared records are used to generate a thin-file risk filter 395. Thin-file risk filter 395 determines the likelihood of a thin-file record being a “good” or “bad” risk based on demographic data or other non-credit data. “Good” risk records 302b identified by collection 380 are compared with “bad” risk records 302a identified by collection 385 to determine those demographic or other non-credit characteristics most closely correlated with or otherwise related to being a “good” or “bad” risk. For example, data that may be used to indicate whether or not an applicant is likely to be a “good” credit or “bad” credit risk may comprise the likelihood of individuals in the same geographic area being “good” or “bad” credit risks, the number of credit related accounts or activities certain geographic area engages in, an age group, scores based on such characteristics as average income in a geographic area or purchasing habits of people living in the geographic area, or the like.


Thin-file risk filter 395 may therefore be used to determine, based on demographic characteristics of a potential thin-file applicant stored in a demographic database, whether or not that applicant is likely to be a “good” or a “bad” risk. Thin-file risk filter 395 may, for example, provide a score for a consumer based on the determined characteristics that are significant, and that score may be associated with a certain likelihood that the applicant is a “good” risk. A high score may correspond to a high likelihood of being a “good” risk. For example, the highest possible score for the thin-file risk filter 395 may correspond to a 75% chance of being a “good” risk. The score may be a quantitative representation of the risk associated with a thin-file applicant such as, for example, a credit risk. The scale of the score may be arbitrary or may be aligned with well known credit scoring systems or other scoring systems.



FIG. 4 shows a system process 400 for utilizing a thin-file propensity filter 360 and a thin-file risk filter 395 in order to determine whether or not a potential customer is likely to be a thin-file record and what risk is likely associated with the potential customer. In some embodiments, the process 400 is a computer implemented process that is stored and runs on the computing system 100. The process 400 shows the application of the thin-file propensity filter 360 and the thin-file risk filter 450 as related processes, such that a portion of the files output by the thin-file propensity filter 360 may be used as input files by the thin-file risk filter 450. However, the filters may also be utilized independently, as both may operate on existing data and provide independently useful results.


Process 400 begins with potential customer data 410. Potential customer data 410 may reflect, for example, demographic data for a specific applicant or for one or more groups of applicants or potential applicants, such as potential targets for a direct mailing campaign.


Demographic information from potential customer data 410 is provided as an input to the thin-file propensity filter 360 from a demographic database. The thin-file propensity filter 360 is applied to the potential customer data 410 for each consumer to generate a score related to the likelihood of the consumer being a thin-file record based on non-credit data. Based on the score or likelihood determined by the thin-file propensity filter 360, consumer records in potential customer data 410 are identified as either scoreable records or thin-file records. For example, a cut-off score may be determined, and any consumer having a score higher than that value may be determined to be a potential thin-file record 440. In some embodiments, this score is a score for which there is a greater than 50% likelihood that a record is a thin-file record. For those records which are not thin-file records, a potential customer credit score 430 may be determined. Those records that have a score above the predetermined value may comprise known thin-file records 440.


A thin-file risk filter 450 may be applied to potential thin-file records 440 in order to determine the potential customer risk score 460. For example, potential thin-file customer data 440 may comprise demographic information associated with one or more consumers or potential customers obtained from a demographic database. Demographic information may include, for example, the consumer's age, the consumer's residence, the length at that residence, the geographic area surrounding the residence, or some other demographic indicator. The thin-file risk filter may take this demographic information as an input and analyze characteristics that determine if a potential customer is a thin-file risk 460. The thin-file risk filter may directly associate certain geographic data, but may also associate economic indicators associated with certain geographic locations in order to determine a potential customer thin-file risk score 460. Potential customer thin-file risk score 460 may be utilized to determine whether or not to provide an applicant a credit account, or the specific terms associated with an account to offer a potential customer. In other embodiments, a potential customer thin-file risk score 460 may be used to determine whether or not to direct marketing efforts towards a potential customer.



FIGS. 5A-C show example embodiments of records from a credit database that may be utilized according to generate the thin-file filters described above. For example, FIG. 5A shows a record 501 comprising a scoreable credit record. Scoreable credit record 501 comprises first and last name fields 510, geographic residence fields 520, a customer pin field 530 comprising a unique identifier, an age field 540, a length of residence field 550 identifying the amount of time the consumer has lived at his or her current residence, demographic data fields 560, and scoreable credit data 570. Demographic data field 560 may comprise, for example, other demographic data not shown in the other fields above and/or one or more of the data fields shown may be excluded. Scoreable credit data 570 may comprise, for example, information on loan accounts, outstanding credit accounts, payment histories, and the like.



FIG. 5B shows a non-scoreable or thin-file credit record 502. Credit record 502 comprises name fields 510, address fields 520, customer pin 530, age field 540, length of residence field 550, and demographic data 560. Potential customer record 502 further comprises scoreable credit data 570. However, for customer record 502, the scoreable credit data is empty, and therefore insufficient to form a credit record or to score the credit record. Thus, the credit record 501 shown in FIG. 5A would be associated with a scoreable record, while credit entry 502 shown in FIG. 5B would be associated with a thin-file record.



FIG. 5C shows the credit record 503 for a thin-file record from a credit database. The record 502 includes one transaction entry that may be analyzed in order to determine whether or not the record 502 is a “good” or “bad” credit risk. The record 503 has a single credit entry 580 identifying that the single transaction represents an account in good standing.



FIG. 6 shows one embodiment of an example of different levels of geographic distinctions, in order to demonstrate types of demographic data that may be utilized. FIG. 6 shows a map 600 comprising different areas with different postal codes such as, for the United States, zip codes and zip+4 area codes. For example, map 600 comprises three different zip codes including 56801, 56802, 56803 and 56804. The zip code 56803 corresponding to area 604 is identified here as including potential customers. Potential customer 601, in a household 602 and an area 603, corresponds to zip code 56803-1001. Information concerning the zip+4 area 603 in the zip area 604, may be used as demographic information associated with customer 601 to determine the likelihood of customer 601 being a thin-file record. If customer 601 is a thin-file record, then the likelihood of customer 601 being a “good” or “bad” credit risk may be determined. Information related to household 602 may also be used in the determination, as well as information specifically related to customer 601, such as age.


The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated.

Claims
  • 1. A computing system, comprising: a computer processor configured to access a plurality of records and configured to select a first one or more records that include less than a predetermined amount of credit data;a thin-file propensity module executing in the computer processor and configured to: access the selected records;determine first demographic characteristics that are correlated to the selected records based at least on a likelihood that other records that are also associated with one or more of the first demographic characteristics include less than the predetermined amount of credit data; anddetermine that a first record likely includes less than the predetermined amount of credit data based at least on matching of one or more demographic characteristics associated with the first record to the first demographic characteristics; anda risk assessment module executing in the computer processor and configured to determine a risk score associated with the first record based at least on a demographic characteristic associated with the first record.
  • 2. The computing system of claim 1, wherein the first demographic characteristics comprise one or more of residence address data, age data, household data, marital status data, delinquent data for consumers in a geographic area, and data related to length of residency.
  • 3. The computing system of claim 1, wherein one or more of the first demographic characteristics are the same as the demographic characteristic associated with the first record that the risk score determination is based on.
  • 4. The computing system of claim 1, wherein each of the first demographic characteristics is different than the demographic characteristic associated with the first record that the risk score determination is based on.
  • 5. The computing system of claim 1, wherein the demographic characteristic associated with the first record that the risk score determination is based on is one of residence address data, age data, household data, marital status data, delinquent data for consumers in a geographic area, or data related to length of residency.
  • 6. A method of identifying a level of risk associated with a thin-file credit record, comprising: accessing a first set of records to select a first one or more records which include less than a predetermined amount of credit data;determining first demographic characteristics that are correlated to the selected records based at least on a likelihood that other records that are also associated with one or more of the first demographic characteristics include less than the predetermined amount of credit data;determining, by at least one computer processor, that a first record likely includes less than the predetermined amount of credit data based at least on matching of one or more demographic characteristics associated with the first record to the first demographic characteristics; anddetermining, by at least one computer processor, a risk score associated with the first record based at least on a demographic characteristic associated with the first record.
  • 7. The method of claim 6, wherein each of the first demographic characteristics is different than the demographic characteristic associated with the first record that the risk score determination is based on.
  • 8. The method of claim 6, wherein the demographic characteristic associated with the first record that the risk score determination is based on is one of residence address data, age data, household data, marital status data, delinquent data for consumers in a geographic area, or data related to length of residency.
  • 9. The method of claim 6, wherein one or more of the first demographic characteristics are the same as the demographic characteristic associated with the first record that the risk score determination is based on.
  • 10. The method of claim 6, wherein the first demographic characteristics comprise one or more of residence address data, age data, household data, marital status data, delinquent data for consumers in a geographic area, and data related to length of residency.
  • 11. A tangible computer-readable medium having instructions stored thereon, the instructions configured for execution by a computing system having one or more computer processors in order to cause the computing system to: access a first set of records to select a first one or more records that include less than a predetermined amount of credit data;determine first demographic characteristics that are correlated to the selected records based at least on a likelihood that other records that are also associated with one or more of the first demographic characteristics include less than the predetermined amount of credit data;determine that a first record likely includes less than the predetermined amount of credit data based at least on matching of one or more demographic characteristics associated with the first record to the first demographic characteristics; anddetermine a risk score associated with the first record based at least on a demographic characteristic associated with the first record.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 12/818,096 filed on Jun. 17, 2010, entitled “SYSTEMS AND METHODS FOR DETERMINING THIN-FILE RECORDS AND DETERMINING THIN-FILE RISK LEVELS,” scheduled to be issued as U.S. Pat. No. 8,024,264, which is a continuation of U.S. patent application Ser. No. 11/871,572 filed on Oct. 12, 2007, entitled “SYSTEMS AND METHODS FOR DETERMINING THIN-FILE RECORDS AND DETERMINING THIN-FILE RISK LEVELS,” issued as U.S. Pat. No. 7,742,982, which claims the benefit of priority under 35 U.S.C. §119(e) of U.S. Provisional Application No. 60/923,060 filed on Apr. 12, 2007, entitled “SYSTEMS AND METHODS FOR PROSPECTING IN A THIN FILE ENVIRONMENT.” The disclosures of all of the above referenced applications are hereby incorporated by reference in their entireties. All publications and patent applications mentioned in this specification are herein incorporated by reference to the same extent as if each individual publication or patent application was specifically and individually indicated to be incorporated by reference.

US Referenced Citations (421)
Number Name Date Kind
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
4982346 Girouard et al. Jan 1991 A
5056019 Schultz et al. Oct 1991 A
5201010 Deaton et al. Apr 1993 A
5247575 Sprague et al. Sep 1993 A
5274547 Zoffel et al. Dec 1993 A
5283731 Lalonde et al. Feb 1994 A
5305195 Murphy Apr 1994 A
5325509 Lautzenheiser Jun 1994 A
5341429 Stringer et al. Aug 1994 A
5459306 Stein et al. Oct 1995 A
5504675 Cragun et al. Apr 1996 A
5515098 Carles May 1996 A
5521813 Fox et al. May 1996 A
5528701 Aref Jun 1996 A
5555409 Leenstra, Sr. et al. Sep 1996 A
5583763 Atcheson et al. Dec 1996 A
5592560 Deaton et al. Jan 1997 A
3316395 Lavin Apr 1997 A
5627973 Armstrong et al. May 1997 A
5640551 Chu et al. Jun 1997 A
5649114 Deaton et al. Jul 1997 A
5655129 Ito Aug 1997 A
5659731 Gustafson Aug 1997 A
5661516 Carles Aug 1997 A
5666528 Thai Sep 1997 A
5692107 Simoudis et al. Nov 1997 A
5696907 Tom Dec 1997 A
5737732 Gibson et al. Apr 1998 A
5740549 Reilly et al. Apr 1998 A
5754938 Herz et al. May 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
5797136 Boyer et al. Aug 1998 A
5802142 Browne 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
5835915 Carr et al. Nov 1998 A
5848396 Gerace Dec 1998 A
5857175 Day et al. Jan 1999 A
5873068 Beaumont et al. Feb 1999 A
5881131 Farris et al. Mar 1999 A
5884287 Edesess Mar 1999 A
5905985 Malloy et al. May 1999 A
5926800 Baronowski et al. Jul 1999 A
5933813 Teicher et al. Aug 1999 A
5944790 Levy Aug 1999 A
5953707 Huang et al. Sep 1999 A
5963932 Jakobsson et al. Oct 1999 A
5974396 Anderson et al. Oct 1999 A
5991735 Gerace Nov 1999 A
6009415 Shurling et al. Dec 1999 A
6018723 Siegel et al. Jan 2000 A
6029139 Cunningham et al. Feb 2000 A
6044357 Garg Mar 2000 A
6070147 Harms et al. May 2000 A
6073140 Morgan et al. Jun 2000 A
6101486 Roberts et al. Aug 2000 A
6119103 Basch et al. Sep 2000 A
6121901 Welch et al. Sep 2000 A
6128624 Papierniak et al. Oct 2000 A
6144948 Walker et al. Nov 2000 A
6144957 Cohen et al. Nov 2000 A
6151601 Papierniak et al. Nov 2000 A
6182060 Hedgcock et al. Jan 2001 B1
6202053 Christiansen et al. Mar 2001 B1
6208979 Sinclair Mar 2001 B1
6223171 Chaudhuri et al. Apr 2001 B1
6236977 Verba et al. May 2001 B1
6256630 Gilai et al. Jul 2001 B1
6263334 Fayyad et al. Jul 2001 B1
6263337 Fayyad et al. Jul 2001 B1
6269325 Lee et al. Jul 2001 B1
6289318 Barber Sep 2001 B1
6298330 Gardenswartz et al. Oct 2001 B1
6304869 Moore et al. Oct 2001 B1
6311169 Duhon Oct 2001 B2
6317752 Lee et al. Nov 2001 B1
6321205 Eder Nov 2001 B1
6324566 Himmel 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
6385592 Angles et al. May 2002 B1
6393406 Eder May 2002 B1
6412012 Bieganski et al. Jun 2002 B1
6430539 Lazarus et al. Aug 2002 B1
6442577 Britton et al. Aug 2002 B1
6460036 Herz Oct 2002 B1
6496819 Bello 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
6523022 Hobbs Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6542894 Lee et al. Apr 2003 B1
6574623 Leung et al. Jun 2003 B1
6597775 Lawyer et al. Jul 2003 B2
6598030 Siegel et al. Jul 2003 B1
6615247 Murphy Sep 2003 B1
6623529 Lakritz Sep 2003 B1
6631496 Li et al. Oct 2003 B1
6640215 Galperin et al. Oct 2003 B1
6651220 Penteroudakis et al. Nov 2003 B1
6658393 Basch et al. Dec 2003 B1
6665715 Houri Dec 2003 B1
6698020 Zigmond et al. Feb 2004 B1
6757740 Parekh et al. Jun 2004 B1
6766327 Morgan, Jr. et al. Jul 2004 B2
6782390 Lee et al. Aug 2004 B2
6804701 Muret et al. Oct 2004 B2
6810356 Garcia-Franco et al. Oct 2004 B1
6823319 Lynch et al. Nov 2004 B1
6839682 Blume et al. Jan 2005 B1
6850606 Lawyer et al. Feb 2005 B2
6850895 Brodersen et al. Feb 2005 B2
6873979 Fishman et al. Mar 2005 B2
6925441 Jones, III et al. Aug 2005 B1
6934714 Meinig Aug 2005 B2
6959281 Freeling et al. Oct 2005 B1
6983478 Grauch et al. Jan 2006 B1
7003504 Angus et al. Feb 2006 B1
7003792 Yuen Feb 2006 B1
7028052 Chapman et al. Apr 2006 B2
7033792 Zhong et al. Apr 2006 B2
7047251 Reed et al. May 2006 B2
7050989 Hurt et al. May 2006 B1
7054828 Heching et al. May 2006 B2
7072853 Shkedi Jul 2006 B2
7072963 Anderson et al. Jul 2006 B2
7082435 Guzman et al. Jul 2006 B1
7120599 Keyes Oct 2006 B2
7136448 Venkataperumal et al. Nov 2006 B1
7139734 Nathans et al. Nov 2006 B2
7150030 Eldering et al. Dec 2006 B1
7152018 Wicks Dec 2006 B2
7152237 Flickinger et al. Dec 2006 B2
7184974 Shishido Feb 2007 B2
7185016 Rasmussen Feb 2007 B1
7185353 Schlack Feb 2007 B2
7200602 Jonas Apr 2007 B2
7240059 Bayliss et al. Jul 2007 B2
7246740 Swift et al. Jul 2007 B2
7249048 O'Flaherty Jul 2007 B1
7275083 Seibel et al. Sep 2007 B1
7277900 Ganesh et al. Oct 2007 B1
7296734 Pliha Nov 2007 B2
7328169 Temares et al. Feb 2008 B2
7360251 Spalink et al. Apr 2008 B2
7366694 Lazerson Apr 2008 B2
7367011 Ramsey et al. Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7376603 Mayr et al. May 2008 B1
7383215 Navarro et al. Jun 2008 B1
7403942 Bayliss Jul 2008 B1
7421442 Gelb et al. Sep 2008 B2
7428509 Klebanoff Sep 2008 B2
7428526 Miller et al. Sep 2008 B2
7433855 Gavan et al. Oct 2008 B2
7467127 Baccash et al. Dec 2008 B1
7472088 Taylor et al. Dec 2008 B2
7475118 Leiba et al. Jan 2009 B2
7483842 Fung et al. Jan 2009 B1
7536346 Aliffi et al. May 2009 B2
7546619 Anderson et al. Jun 2009 B2
7556192 Wokaty, Jr. Jul 2009 B2
7562093 Gelb et al. Jul 2009 B2
7571139 Giordano et al. Aug 2009 B1
7580856 Pliha Aug 2009 B1
7584146 Duhon Sep 2009 B1
7590589 Hoffberg Sep 2009 B2
7596512 Raines et al. Sep 2009 B1
7610257 Abrahams Oct 2009 B1
7647344 Skurtovich et al. Jan 2010 B2
7653592 Flaxman Jan 2010 B1
7653593 Zarikian et al. Jan 2010 B2
7668769 Baker et al. Feb 2010 B2
7668840 Bayliss et al. Feb 2010 B2
7672865 Kumar et al. Mar 2010 B2
7698163 Reed et al. Apr 2010 B2
7698236 Cox et al. Apr 2010 B2
7707059 Reed et al. Apr 2010 B2
7725300 Pinto et al. May 2010 B2
7730509 Boulet et al. Jun 2010 B2
7734523 Cui et al. Jun 2010 B1
7742982 Chaudhuri et al. Jun 2010 B2
7848987 Haig Dec 2010 B2
7849004 Choudhuri et al. Dec 2010 B2
7856397 Whipple et al. Dec 2010 B2
7877322 Nathans et al. Jan 2011 B2
7904366 Pogust Mar 2011 B2
7954698 Pliha Jun 2011 B1
7983932 Kane Jul 2011 B2
7991689 Brunzell et al. Aug 2011 B1
7996521 Chamberlain et al. Aug 2011 B2
8024264 Chaudhuri et al. Sep 2011 B2
8135607 Williams et al. Mar 2012 B2
20010037332 Miller et al. Nov 2001 A1
20010039523 Iwamoto Nov 2001 A1
20010044766 Keyes Nov 2001 A1
20010049620 Blasko Dec 2001 A1
20020023051 Kunzle et al. Feb 2002 A1
20020026411 Nathans et al. Feb 2002 A1
20020046099 Frengut et al. Apr 2002 A1
20020049968 Wilson et al. Apr 2002 A1
20020055906 Katz et al. May 2002 A1
20020072927 Phelan et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020099628 Takaoka et al. Jul 2002 A1
20020123904 Amengual et al. Sep 2002 A1
20020123928 Eldering et al. Sep 2002 A1
20020128960 Lambiotte et al. Sep 2002 A1
20020129368 Schlack et al. Sep 2002 A1
20020133404 Pedersen Sep 2002 A1
20020138297 Lee Sep 2002 A1
20020147695 Khedkar et al. Oct 2002 A1
20020165839 Taylor et al. Nov 2002 A1
20020173984 Robertson et al. Nov 2002 A1
20020184255 Edd et al. Dec 2002 A1
20020194103 Nabe Dec 2002 A1
20020198824 Cook Dec 2002 A1
20030018549 Fei et al. Jan 2003 A1
20030033242 Lynch et al. Feb 2003 A1
20030036996 Lazerson Feb 2003 A1
20030041050 Smith et al. Feb 2003 A1
20030046223 Crawford et al. Mar 2003 A1
20030050882 Degen et al. Mar 2003 A1
20030065563 Elliott et al. Apr 2003 A1
20030083893 Aliffi et al. May 2003 A1
20030093289 Thornley et al. May 2003 A1
20030097329 Nabe et al. May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030105728 Yano et al. Jun 2003 A1
20030171942 Gaito Sep 2003 A1
20030191731 Stewart et al. Oct 2003 A1
20030195830 Merkoulovitch et al. Oct 2003 A1
20030208362 Enthoven et al. Nov 2003 A1
20030212618 Keyes et al. Nov 2003 A1
20030212654 Harper et al. Nov 2003 A1
20030216965 Libman Nov 2003 A1
20030217003 Weinflash et al. Nov 2003 A1
20030233323 Bilski et al. Dec 2003 A1
20030236738 Lange et al. Dec 2003 A1
20040006536 Kawashima et al. Jan 2004 A1
20040030667 Xu et al. Feb 2004 A1
20040039686 Klebanoff Feb 2004 A1
20040044615 Xue et al. Mar 2004 A1
20040044617 Lu Mar 2004 A1
20040062213 Koss Apr 2004 A1
20040064402 Dreyer et al. Apr 2004 A1
20040078809 Drazin Apr 2004 A1
20040102197 Dietz May 2004 A1
20040107125 Guheen et al. Jun 2004 A1
20040111358 Lange et al. Jun 2004 A1
20040111363 Trench et al. Jun 2004 A1
20040117358 Von Kaenel et al. Jun 2004 A1
20040122730 Tucciarone et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040128150 Lundegren Jul 2004 A1
20040128193 Brice et al. Jul 2004 A1
20040139025 Coleman Jul 2004 A1
20040153448 Cheng et al. Aug 2004 A1
20040158520 Noh Aug 2004 A1
20040163101 Swix et al. Aug 2004 A1
20040177030 Shoham Sep 2004 A1
20040186807 Nathans et al. Sep 2004 A1
20040193535 Barazesh Sep 2004 A1
20040199456 Flint et al. Oct 2004 A1
20040199584 Kirshenbaum et al. Oct 2004 A1
20040205157 Bibelnieks et al. Oct 2004 A1
20040220896 Finlay et al. Nov 2004 A1
20040225596 Kemper et al. Nov 2004 A1
20040243588 Tanner et al. Dec 2004 A1
20050004805 Srinivasan Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050027632 Zeitoun et al. Feb 2005 A1
20050027633 Fortuna et al. Feb 2005 A1
20050038726 Salomon et al. Feb 2005 A1
20050050027 Yeh et al. Mar 2005 A1
20050086579 Leitner et al. Apr 2005 A1
20050102206 Savasoglu et al. May 2005 A1
20050102226 Oppenheimer et al. May 2005 A1
20050125350 Tidwell et al. Jun 2005 A1
20050130704 McParland et al. Jun 2005 A1
20050137899 Davies et al. Jun 2005 A1
20050144067 Farahat et al. Jun 2005 A1
20050154664 Guy et al. Jul 2005 A1
20050197953 Broadbent et al. Sep 2005 A1
20050204381 Ludvig et al. Sep 2005 A1
20050209892 Miller Sep 2005 A1
20050209922 Hofmeister Sep 2005 A1
20050222906 Chen Oct 2005 A1
20050251820 Stefanik et al. Nov 2005 A1
20050278246 Friedman et al. Dec 2005 A1
20050278743 Flickinger et al. Dec 2005 A1
20050279824 Anderson et al. Dec 2005 A1
20050288954 McCarthy et al. Dec 2005 A1
20060004731 Seibel et al. Jan 2006 A1
20060041443 Horvath Feb 2006 A1
20060059073 Walzak Mar 2006 A1
20060074991 Lussier et al. Apr 2006 A1
20060129428 Wennberg Jun 2006 A1
20060149674 Cook et al. Jul 2006 A1
20060184440 Britti et al. Aug 2006 A1
20060184585 Grear et al. Aug 2006 A1
20060195688 Drissi et al. Aug 2006 A1
20060195866 Thukral Aug 2006 A1
20060206379 Rosenberg Sep 2006 A1
20060212353 Roslov et al. Sep 2006 A1
20060224696 King et al. Oct 2006 A1
20060230415 Roeding Oct 2006 A1
20060241923 Xu et al. Oct 2006 A1
20060242039 Haggerty et al. Oct 2006 A1
20060242046 Haggerty et al. Oct 2006 A1
20060242049 Haggerty et al. Oct 2006 A1
20060242050 Haggerty et al. Oct 2006 A1
20060242051 Haggerty et al. Oct 2006 A1
20060282359 Nobili et al. Dec 2006 A1
20060282856 Errico et al. Dec 2006 A1
20060287915 Boulet et al. Dec 2006 A1
20060287919 Rubens et al. Dec 2006 A1
20060293921 McCarthy et al. Dec 2006 A1
20060293954 Anderson et al. Dec 2006 A1
20060293955 Wilson et al. Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070011020 Martin Jan 2007 A1
20070011039 Oddo Jan 2007 A1
20070022032 Anderson et al. Jan 2007 A1
20070022297 Britti et al. Jan 2007 A1
20070038497 Britti et al. Feb 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
20070067235 Nathans et al. Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070078835 Donnelli Apr 2007 A1
20070106582 Baker et al. May 2007 A1
20070192165 Haggerty et al. Aug 2007 A1
20070192409 Kleinstern et al. Aug 2007 A1
20070208619 Branam et al. Sep 2007 A1
20070214076 Robida et al. Sep 2007 A1
20070220553 Branam et al. Sep 2007 A1
20070226093 Chan et al. Sep 2007 A1
20070226130 Haggerty et al. Sep 2007 A1
20070233857 Cheng et al. Oct 2007 A1
20070244732 Chatterji et al. Oct 2007 A1
20070255645 Morris et al. Nov 2007 A1
20070255646 Morris et al. Nov 2007 A1
20070282684 Prosser et al. Dec 2007 A1
20070282730 Carpenter et al. Dec 2007 A1
20070282736 Conlin et al. Dec 2007 A1
20070288271 Klinkhammer Dec 2007 A1
20070288950 Downey et al. Dec 2007 A1
20070288953 Sheeman et al. Dec 2007 A1
20080005313 Flake et al. Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080021802 Pendleton Jan 2008 A1
20080027859 Nathans et al. Jan 2008 A1
20080028067 Berkhin et al. Jan 2008 A1
20080059224 Schechter Mar 2008 A1
20080059317 Chandran et al. Mar 2008 A1
20080065774 Keeler Mar 2008 A1
20080110973 Nathans et al. May 2008 A1
20080120155 Pliha May 2008 A1
20080177836 Bennett Jul 2008 A1
20080184289 Cristofalo et al. Jul 2008 A1
20080228635 Megdal et al. Sep 2008 A1
20080243680 Megdal et al. Oct 2008 A1
20080255897 Megdal et al. Oct 2008 A1
20080294540 Celka et al. Nov 2008 A1
20080301016 Durvasula et al. Dec 2008 A1
20080301727 Cristofalo et al. Dec 2008 A1
20080320575 Gelb et al. Dec 2008 A1
20090018996 Hunt et al. Jan 2009 A1
20090024505 Patel et al. Jan 2009 A1
20090044246 Sheehan et al. Feb 2009 A1
20090044279 Crawford et al. Feb 2009 A1
20090048877 Binns et al. Feb 2009 A1
20090094640 Anderson et al. Apr 2009 A1
20090112650 Iwane Apr 2009 A1
20090132559 Chamberlain et al. May 2009 A1
20090133058 Kouritzin et al. May 2009 A1
20090198612 Meimes et al. 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
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
20090288109 Downey et al. Nov 2009 A1
20100037255 Sheehan et al. Feb 2010 A1
20100094758 Chamberlain et al. Apr 2010 A1
20100138290 Zschocke et al. Jun 2010 A1
20100145836 Baker et al. Jun 2010 A1
20100145847 Zarikian et al. Jun 2010 A1
20100185546 Pollard Jul 2010 A1
20110047071 Choudhuri et al. Feb 2011 A1
20110093383 Haggerty et al. Apr 2011 A1
20110112958 Haggerty et al. May 2011 A1
20120095927 Hirtenstein et al. Apr 2012 A1
Foreign Referenced Citations (54)
Number Date Country
1290372 May 2001 CN
1290373 May 2001 CN
0749081 Dec 1966 EP
0419889 Apr 1991 EP
0458698 Nov 1991 EP
0559358 Sep 1993 EP
0977128 Feb 2000 EP
1122664 Aug 2001 EP
0772836 Dec 2001 EP
10-222559 Aug 1998 JP
10-261009 Sep 1998 JP
2000-331068 Nov 2000 JP
2001-297141 Oct 2001 JP
2001-344463 Dec 2001 JP
2001-357256 Dec 2001 JP
2002-149778 May 2002 JP
2002-163498 Jun 2002 JP
2002-259753 Sep 2002 JP
2003 016261 Jan 2003 JP
2003-271851 Sep 2003 JP
2003-316881 Nov 2003 JP
10-2000-0036594 Jul 2000 KR
10-2000-0063995 Nov 2000 KR
10-2001-0016349 Mar 2001 KR
10-2001-0035145 May 2001 KR
10-2002-0007132 Jan 2002 KR
256569 Jun 2006 TW
WO 9534155 Dec 1995 WO
WO 9600945 Jan 1996 WO
WO 9723838 Jul 1997 WO
WO 9841931 Sep 1998 WO
WO 9841932 Sep 1998 WO
WO 9841933 Sep 1998 WO
WO 9904350 Jan 1999 WO
WO 9917225 Apr 1999 WO
WO 9917226 Apr 1999 WO
WO 9922328 May 1999 WO
WO 9933012 Jul 1999 WO
WO 9938094 Jul 1999 WO
WO 9946710 Sep 1999 WO
WO 0004465 Jan 2000 WO
WO 0028441 May 2000 WO
WO 0055790 Sep 2000 WO
WO 0111522 Feb 2001 WO
WO 0125896 Apr 2001 WO
WO 0175754 Oct 2001 WO
WO 03101123 Dec 2003 WO
WO 2004051436 Jun 2004 WO
WO 2004114160 Dec 2004 WO
WO 2006099492 Sep 2006 WO
WO 2007014271 Feb 2007 WO
WO 2007149941 Dec 2007 WO
WO 2008076343 Jun 2008 WO
WO 2008127288 Oct 2008 WO
Related Publications (1)
Number Date Country
20120158575 A1 Jun 2012 US
Provisional Applications (1)
Number Date Country
60923060 Apr 2007 US
Continuations (2)
Number Date Country
Parent 12818096 Jun 2010 US
Child 13236555 US
Parent 11871572 Oct 2007 US
Child 12818096 US