# US 2018/0322198 A1 · Automated assistance for generating relevant and valuable search results for an entity of interest > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2018/0322198 A1 - Document ID: US20180322198A1 - Status: Published application - Kind: A1 - Application number: 15/584,423 - Filed: 2017-05-02 - Published: 2018-11-08 - Earliest claimed: 2017-05-02 - Assignees: Palantir Technologies Inc. - Applicants: Palantir Technologies Inc. - Inventors: Matthew Elkherj; Ashley Einspahr; Breanna Bunge; Chris Hammett; Erika Crawford Tom; Mitchell Beard; Ryan Beiermeister; Seelig Sinton; Sharon Hao; William Ayers; Seth Robinson - Web page: https://patentgrep.com/patent/US20180322198A1 ## CPC - G06F 16/9538: Presentation of query results - G06F 16/38: Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually - G06F 16/951: Indexing; Web crawling techniques - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Systems and methods are provided for identifying relevant information for an entity, referred to as a seed entity. A plurality of search queries can be generated each comprising a property of a seed entity or one of the entities associated with the seed entity (seed-linked entities). Preferably, a collection of search queries includes ones representing different properties of the seed entity and properties of different seed-linked entities. Optionally, the collection of search queries is optimized to reduce search burden. Searches can then be conducted with the search queries in one or more data sources to obtain a plurality of search results, wherein each search result comprises a hit entity and one or more entities associated with the hit entity (hit-linked entity). For each of the search results, a score can be determined taking as input (a) likelihood of match between the seed entity and the hit entity or between a seed-linked entity and a hit-linked entity, (b) presence of a new entity in the search result not present in the search queries or a difference between the new entity and an entity present in the search queries, and (c) characteristic of the new entity in the search result. Based on the scores, high priority search results can be presented a user for further analysis. ## Claims ### Claim 1 A system for identifying relevant information for an entity comprising: one or more processors and a memory storing instructions that, when executed by the one or more processors, cause the system to: generate a plurality of search queries comprising a seed entity and one or more entities associated with the seed entity; conduct searches, with the search queries, in one or more data sources to obtain a plurality of search results, wherein each search result comprises a hit entity and one or more entities associated with the hit entity; and determine a score for each of the search results, taking as input (a) likelihood of match between the seed entity and the hit entity or between an entity associated with the seed entity and an entity associated with the hit entity, (b) presence of a new entity in the search result not present in the search queries or a difference between the new entity and an entity present in the search queries, and (c) characteristic of the new entity in the search result. ### Claim 2 (depends on 1) The system of claim 1, wherein the instructions further cause the system to provide one or more search results based on the scores to a user for analysis. ### Claim 3 (depends on 1) The system of claim 1, wherein at least one of the search queries comprises a third entity associated with one of the entities associated with the seed entity, wherein the third entity is at least not known as directly associated with the seed entity. ### Claim 4 (depends on 3) The system of claim 3, wherein the third entity is identified from a pre-search with a search query that comprises the seed entity and the one or more entities associated with the seed entity. ### Claim 5 (depends on 1) The system of claim 1, wherein the seed entity or the one or more entities associated with the seed entity is represented by a property of the respective entity, wherein the property is selected from the group consisting of name, address, date of birth, social security number, city of birth, image, social networking account, phone number and email address. ### Claim 6 (depends on 1) The system of claim 1, wherein the instructions further cause the system to eliminate search queries less likely to return desired search results. ### Claim 7 (depends on 1) The system of claim 1, wherein determination of likelihood of match comprises the use of a data compression method to determine a likelihood that the entities match with each other by chance. ### Claim 8 (depends on 7) The system of claim 7, wherein the data compression method comprises the use of Huffman coding. ### Claim 9 (depends on 1) The system of claim 1, wherein when an entity is represented by a person's name, the determination of likelihood of match comprises determination of frequency of use of the name. ### Claim 10 (depends on 1) The system of claim 1, wherein the characteristic of the entity is compared to a predefined list of characteristics of entities to determine the value of the characteristic. ### Claim 11 A computer-implemented method comprising: generating, on a suitably programmed computing device, a plurality of search queries comprising a seed entity and one or more entities associated with the seed entity; conducting searches, with the search queries, in one or more data sources to obtain a plurality of search results, wherein each search result comprises a hit entity and one or more entities associated with the hit entity; and determining a score for each of the search results, taking as input (a) likelihood of match between the seed entity and the hit entity or between an entity associated with the seed entity and an entity associated with the hit entity, (b) presence of a new entity in the search result not present in the search queries or a difference between the new entity and an entity present in the search queries, and (c) characteristic of the new entity in the search result. ### Claim 12 (depends on 1) The method of claim 1, further comprising providing one or more search results based on the scores to a user for analysis. ### Claim 13 (depends on 11) The method of claim 11, wherein at least one of the search queries comprises a third entity associated with one of the entities associated with the seed entity, wherein the third entity is at least not known as directly associated with the seed entity. ### Claim 14 (depends on 11) The method of claim 11, wherein the seed entity or the one or more entities associated with the seed entity is represented by a property of the respective entity, wherein the property is selected from the group consisting of name, address, date of birth, social security number, city of birth, image, social networking account, phone number and email address. ### Claim 15 (depends on 11) The method of claim 11, further comprising eliminating search queries less likely to return desired search results. ### Claim 16 (depends on 11) The method of claim 11, wherein determination of likelihood of match comprises the use of a data compression method to determine a likelihood that the entities match with each other by chance. ### Claim 17 (depends on 16) The method of claim 16, wherein the data compression method comprises the use of Huffman coding. ### Claim 18 (depends on 11) The method of claim 11, wherein when an entity is represented by a person's name, the determination of likelihood of match comprises determination of frequency of use of the name. ### Claim 19 (depends on 11) The method of claim 11, wherein the characteristic of the entity is compared to a predefined list of characteristics of entities to determine the value of the characteristic. ### Claim 20 A non-transitory computer readable medium comprising instructions that, when executed, cause one or more processors to perform: generating, on a suitably programmed computing device, a plurality of search queries comprising a seed entity and one or more entities associated with the seed entity; conducting searches, with the search queries, in one or more data sources to obtain a plurality of search results, wherein each search result comprises a hit entity and one or more entities associated with the hit entity; and determining a score for each of the search results, taking as input (a) likelihood of match between the seed entity and the hit entity or between an entity associated with the seed entity and an entity associated with the hit entity, (b) presence of a new entity in the search result not present in the search queries or a difference between the new entity and an entity present in the search queries, and (c) characteristic of the new entity in the search result.