# US 2013/0159288 A1 · Information graph

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0159288 A1
- Document ID: US20130159288A1
- Status: Published application
- Kind: A1
- Application number: 13/328,256
- Filed: 2011-12-16
- Published: 2013-06-20
- Earliest claimed: 2011-12-16
- Assignees: Rawllin International Inc.
- Inventors: Andrey N. Nikankin
- Web page: https://patentgrep.com/patent/US20130159288A1

## CPC

- G06Q 40/03: Credit; Loans; Processing thereof
- G06Q 40/02: Banking, e.g. interest calculation or account maintenance (credit or loans G06Q40/03)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Disclosed are electronic systems and techniques that generate an information graph with associated validation measures related to information obtained from data sources for providing recommendations about a potential candidate for a financial product. Search results are used to gather data associated with a potential client for loan offers. Levels of certainty are initiated from the associations and used to modify the search criteria or identifying data for searching further. A credit worthiness score related to the potential client is configured based on the information graph.

## Claims

### Claim 1

A method, comprising:
executing, by a computing device including at least one processor, a search of a first set of data that is related to a first candidate;
associating the first set of data with a first level of certainty;
transforming the first set of data into a first data cluster for representation in display based on the first set of data and the first level of certainty;
executing, by the computing device, a different search of a second set of data related to a second candidate;
associating the second set of data with a second level of certainty;
transforming the second set of data into a second data cluster for representation in display based on the second set of data and the second level of certainty;
generating an information graph with the first data cluster and the second data cluster for further representation in display; and
determining associations of the information graph between the first data cluster and the second data cluster, and based on the associations, determining whether to merge the first data cluster and the second data cluster in the information graph into a merged data cluster that is associated with the first candidate.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining an eligibility of the first candidate to provide at least one financial offer based at least in part on the information graph.

### Claim 3 (depends on 1)

The method of claim 1, wherein the transforming the first set of data into the first data cluster includes determining first edges, for representation in display, connecting a first candidate node associated with the first candidate to first data elements of the first set of data based on the first level of certainty, wherein the first level of certainty differs among the first data elements of the first set of data according to a reliability of a data source for the first data elements.

### Claim 4 (depends on 3)

The method of claim 3, wherein the transforming the second set of data into the second data cluster includes providing second edges in the display connecting a second candidate node associated with the second candidate to second data elements of the second set of data based on the second level of certainty, wherein the second level of certainty differs among the second data elements of the second set of data according to a reliability of a data source for the second data elements.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
merging the first data cluster and the second data cluster in the information graph into the merged data cluster including merging the first candidate node and the second candidate node into a single candidate node having the first set of data and the second set of data, in response to a determination to merge the first data cluster and the second data cluster into the merged data cluster that is associated with the first candidate.

### Claim 6 (depends on 4)

The method of claim 4, further comprising determining a length of the first edges and the second edges based on the first level of certainty and the second level of certainty respectively.

### Claim 7 (depends on 1)

The method of claim 1, wherein the determining the associations in the information graph between the first data cluster and the second data cluster includes identifying the associations between first data elements of the first set of data and second data elements of the second set of data and determining the first level of certainty and the second level of certainty between each association based on a reliability of a data source from which the first data elements and the second data elements are retrieved by the search and on a reliability of association between the first candidate with the first data elements and the second data elements.

### Claim 8 (depends on 1)

The method of claim 1, wherein the determining the associations in the information graph between the first data cluster and the second data cluster further includes assessing whether edges in the display connecting each of the associations meet a condition for a predetermined function.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
merging the first data cluster and the second data cluster in the information graph into the merged data cluster, in response to a determination to merge the first data cluster and the second data cluster into the merged data cluster that is associated with the first candidate, according to one or more first data elements of the first set of data being equal to one or more second data elements of the second set of data and according to the first level of certainty associated with the one or more first data elements of the first set of data and the second level of certainty associated with the one or more second data elements of the second set of data.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
determining the first level of certainty and the second level of certainty based on a reliability associated with one or more data sources from which at least one data element of the first set of data and at least one data element of the second set of data are retrieved by the search.

### Claim 11 (depends on 10)

The method of claim 10, wherein the determining the first level of certainty and the second level of certainty further comprises determining the first level of certainty and the second level of certainty based on a reliability of association that the at least one data element of the first set of data and the at least one data element of the second set of data are associated with the first candidate and the second candidate respectively.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
dynamically determining a credit worthiness score associated with a loan offer for the first candidate based upon the first level of certainty in the information graph, wherein the first level of certainty is updated based on a determination to merge the first data cluster and the second data cluster into the merged data cluster.

### Claim 13 (depends on 12)

The method of claim 12, wherein the determining the credit worthiness score for the first candidate includes analyzing the information graph, classifying the first candidate and the first set of data based at least in part on the analyzing, and determining the credit worthiness score for the loan offer based at least in part on the classifying.

### Claim 14 (depends on 1)

The method of claim 1, further comprising:
dynamically updating the first level of certainty in response to a determination to merge the first data cluster and the second data cluster into the merged data cluster; and
generating a single candidate node associated with the first candidate and first edges connecting the single candidate node with first data elements of the first data cluster and second edges connecting the single candidate node with second data elements of the second data cluster.

### Claim 15 (depends on 1)

The method of claim 1, further comprising:
merging the first data cluster and the second data cluster in the information graph into the merged data cluster in response to a determination to merge the first data cluster and the second data cluster into the merged data cluster, wherein less than all first data elements of the first set of data are equal to less than all second data elements of the second set of data.

### Claim 16

A computer readable storage medium comprising computer executable instructions that, in response to execution by a computing system, cause the computing system to perform operations, comprising:
executing, via a search engine, a search of one or more data sources and retrieving a set of data related to a candidate;
associating a level of certainty to one or more data elements of the set of data;
transforming, for display in the computing system, the set of data into a data cluster based on the one or more data elements and the level of certainty, including:
generating a candidate node associated with the candidate;
generating one or more element nodes of the one or more data elements; and
generating one or more edges that respectively connect the candidate node with the one or more element nodes and that include the level of certainty for the one or more data elements of the set of data;
executing, via the search engine, a search for data elements of a plurality of different candidates;
transforming, for display in the computing system, the data elements of the plurality of different candidates into different data clusters associated with different candidates;
generating an information graph with the data cluster and the different data clusters in the display; and
determining associations in the information graph between the data cluster and the different data clusters, and based on the associations, determining whether to merge the data cluster with at least one of the different data clusters in the information graph into a merged data cluster.

### Claim 17 (depends on 16)

The computer readable storage medium of claim 16, further comprising:
merging the data cluster with the at least one of the different data clusters in the information graph into the merged data cluster in response to a determination to merge, wherein the merged data cluster includes the candidate node associated with the candidate, the one or more element nodes, the one or more edges, different element nodes related to the data elements of the at least one of the different data clusters, and edges connecting the candidate node with the data elements of the at least one of the different data clusters.

### Claim 18 (depends on 17)

The computer readable storage medium of claim 17, further comprising:
associating a different level of certainty to the data elements of the plurality of different candidates;
wherein the determination to merge includes factoring the different level of certainty and the level of certainty of the one or more data elements to determine whether a condition is met for a predetermined function.

### Claim 19 (depends on 18)

The computer readable storage medium of claim 18, wherein less than all of the set of data is equal to less than all of the data elements of the at least one of the different data clusters.

### Claim 20 (depends on 18)

The computer readable storage medium of claim 18, further comprising:
updating the merged data cluster for the candidate in the information graph as subsequent searches for the data elements of the plurality of different candidates changes the different level of certainty associated with shared data elements that are in common with the candidate node and the plurality of different candidates.

### Claim 21 (depends on 18)

The computer readable storage medium of claim 18, wherein the level of certainty and the different level of certainty are provided in the information graph in the display according to a length of each edge.

### Claim 22 (depends on 16)

The computer readable storage medium of claim 16, further comprising:
determining an eligibility of the candidate to provide at least one financial offer based at least in part on the information graph.

### Claim 23

A system, comprising:
a search engine configured to generate search results with a computing device including at least one processor, wherein the search results have a first set of data that is related to a first candidate and a second set of data related to a second candidate;
a certainty level component configured to associate the first set of data with a first level of certainty, and the second set of data with a second level of certainty;
a transformation component configured to transform, for representation in display, the first set of data into a first data cluster based on the first set of data and the first level of certainty and the second set of data into a second data cluster based on the second set of data and the second level of certainty;
an information graph component configured to generate an information graph, for further representation in display, with the first data cluster and the second data cluster; and
a merging component configured to determine associations of the information graph between the first data cluster and the second data cluster, and to determine, based on the associations, whether to merge the first data cluster and the second data cluster in the information graph into a merged data cluster that is associated with the first candidate.

### Claim 24 (depends on 23)

The system of claim 23, further comprising:
an advisor component configured to determine an eligibility of the first candidate and determine at least one financial offer based at least in part on the information graph, and to dynamically determine a credit worthiness score associated with a loan offer for the first candidate based upon the first level of certainty in the information graph, wherein the first level of certainty is updated based on a determination to merge the first data cluster and the second data cluster into the merged data cluster, wherein the determining the credit worthiness score for the first candidate includes analyzing the information graph, classifying the first candidate and the first set of data based at least in part on the analyzing, and determining the credit worthiness score for the loan offer based at least in part on the classifying.

### Claim 25 (depends on 23)

The system of claim 23, the information graph component is further configured to provide first edges, for representation in display, connecting a first candidate node associated with the first candidate to data elements of the first set of data based on the first level of certainty, wherein the first level of certainty differs among the respective data elements according to a reliability of data sources for data elements of the first set of data, wherein the information graph is further configured to provide second edges, for representation in, display connecting a second candidate node associated with the second candidate to data elements of the second set of data based on the second level of certainty, wherein the second level of certainty differs among the data elements of the second set of data according to a reliability of data sources for data elements of the second set of data.

### Claim 26 (depends on 25)

The system of claim 25, wherein the information graph is further configured to determine a length of each edge based on the first level of certainty or the second level of certainty.

### Claim 27 (depends on 23)

The system of claim 23, wherein the merging component is further configured to merge the first data cluster and the second data cluster in the information graph into the merged data cluster according to a determination that one or more data elements of the first set of data are equal to one or more data elements of the second set of data, and according to the first level of certainty associated with the one or more data elements of the first set of data and the second level of certainty associated with the one or more data elements of the second set of data.

### Claim 28 (depends on 27)

The system of claim 27, wherein the merging component is configured to make the determination to merge when less than all of the first set of data is equal to less than all of the second set of data.

### Claim 29 (depends on 23)

The system of claim 23, wherein the merging component is further configured to identify one or more associations between data elements of the first set of data and data elements of the second set of data and

### Claim 30 (depends on 23)

The system of claim 23, wherein the certainty level component is further configured to determine the first level of certainty and the second level of certainty of each association based on a reliability of a data source from which data elements of the first set of data and the second set of data are retrieved by the search engine and on a reliability of association between the data elements of the first and the second set of data with the first candidate.

### Claim 31

A system, comprising:
means for searching to retrieve data elements of a set of data related to a candidate from a set of data sources and for different data elements of a plurality of different candidates;
means for associating respectively a level of certainty to the data elements of the set of data and different levels of certainty to the data elements of the plurality of different candidates;
means for transforming the set of data into a data cluster based on the set of data and the level of certainty and transforming the data elements of the plurality of different candidates into different data clusters;
means for generating an information graph with the data cluster and the different data clusters for representation in display; and
means for determining associations in the information graph between the data cluster and the different data clusters and determining whether to merge the data cluster with at least one of the different data clusters in the information graph into a merged data cluster.

### Claim 32 (depends on 31)

The system of claim 31, further comprising:
means for advising an eligibility of the candidate for a loan offer based at least in part on the information graph.
