Patents by Inventor Matthew Sprague

Matthew Sprague has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10111037
    Abstract: Systems and methods are disclosed for collocation detection. In accordance with one implementation, a method is provided for collocation detection. The method includes obtaining a first object observation that includes a first object identifier, a first observation time, and a first observation location. The method also includes obtaining a second object observation that includes a second object identifier, a second observation time, and a second observation location. In addition, the method includes associating the first observation with a first area on a map, associating the second observation with a second area on the map, and determining whether a potential meeting occurred between objects associated with the first object identifier and the second object identifier based on the first and second observation times, and the first and second areas.
    Type: Grant
    Filed: November 21, 2016
    Date of Patent: October 23, 2018
    Assignee: Palantir Technologies Inc.
    Inventors: Matthew Sprague, Miklos Danka, Bill Dwyer
  • Publication number: 20180270264
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Application
    Filed: April 24, 2018
    Publication date: September 20, 2018
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9998485
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Grant
    Filed: September 15, 2014
    Date of Patent: June 12, 2018
    Assignee: PALANTIR TECHNOLOGIES, INC.
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9965937
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyzes (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Grant
    Filed: August 29, 2014
    Date of Patent: May 8, 2018
    Assignee: Palantir Technologies Inc.
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Publication number: 20160366164
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Application
    Filed: September 15, 2014
    Publication date: December 15, 2016
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Publication number: 20160344758
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Application
    Filed: August 29, 2014
    Publication date: November 24, 2016
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9503844
    Abstract: Systems and methods are disclosed for collocation detection. In accordance with one implementation, a method is provided for collocation detection. The method includes obtaining a first object observation that includes a first object identifier, a first observation time, and a first observation location. The method also includes obtaining a second object observation that includes a second object identifier, a second observation time, and a second observation location. In addition, the method includes associating the first observation with a first area on a map, associating the second observation with a second area on the map, and determining whether a potential meeting occurred between objects associated with the first object identifier and the second object identifier based on the first and second observation times, and the first and second areas.
    Type: Grant
    Filed: November 22, 2013
    Date of Patent: November 22, 2016
    Assignee: Palantir Technologies Inc.
    Inventors: Matthew Sprague, Miklos Danka, Bill Dwyer
  • Patent number: 9344447
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analysis (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Grant
    Filed: September 15, 2014
    Date of Patent: May 17, 2016
    Assignee: Palantir Technologies Inc.
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9313233
    Abstract: Systems and methods are disclosed for detecting associated devices. In accordance with one implementation, a method is provided for detecting associated devices. The method includes obtaining information about a target device and determining, based on the information about the target device, one or more target observations that include a target time and a target location. The method also includes identifying one or more second observations of one or more candidate devices, wherein the candidate observations include a second time and a second location that correspond with the target time and the target location. In addition, the method includes determining, from the one or more candidate devices, any associated devices that may correspond with the target device.
    Type: Grant
    Filed: September 13, 2013
    Date of Patent: April 12, 2016
    Assignee: Plantir Technologies Inc.
    Inventors: Matthew Sprague, Andy Isaacson
  • Publication number: 20160034470
    Abstract: Techniques are disclosed for for prioritizing a plurality of clusters. Prioritizing clusters may generally include identifying a scoring strategy for prioritizing the plurality of clusters. Each cluster is generated from a seed and stores a collection of data retrieved using the seed. For each cluster, elements of the collection of data stored by the cluster are evaluated according to the scoring strategy and a score is assigned to the cluster based on the evaluation. The clusters may be ranked according to the respective scores assigned to the plurality of clusters. The collection of data stored by each cluster may include financial data evaluated by the scoring strategy for a risk of fraud. The score assigned to each cluster may correspond to an amount at risk.
    Type: Application
    Filed: August 5, 2015
    Publication date: February 4, 2016
    Inventors: Matthew Sprague, Michael Kross, Adam Borochoff, Parvathy Menon, Michael Harris
  • Publication number: 20160006749
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Application
    Filed: September 15, 2014
    Publication date: January 7, 2016
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9202249
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyzes (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Grant
    Filed: August 29, 2014
    Date of Patent: December 1, 2015
    Assignee: Palantir Technologies Inc.
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9177344
    Abstract: In various embodiments, systems, methods, and techniques are disclosed for generating a collection of clusters of related data from a seed. Seeds may be generated based on seed generation strategies or rules. Clusters may be generated by, for example, retrieving a seed, adding the seed to a first cluster, retrieving a clustering strategy or rules, and adding related data and/or data entities to the cluster based on the clustering strategy. Various cluster scores may be generated based on attributes of data in a given cluster. Further, cluster metascores may be generated based on various cluster scores associated with a cluster. Clusters may be ranked based on cluster metascores. Various embodiments may enable an analyst to discover various insights related to data clusters, and may be applicable to various tasks including, for example, tax fraud detection, beaconing malware detection, malware user-agent detection, and/or activity trend detection, among various others.
    Type: Grant
    Filed: December 23, 2013
    Date of Patent: November 3, 2015
    Assignee: Palantir Technologies Inc.
    Inventors: Harkirat Singh, Brendan Weickert, Matthew Sprague, Michael Kross, Adam Borochoff, Parvathy Menon, Michael Harris
  • Patent number: 9171334
    Abstract: In various embodiments, systems, methods, and techniques are disclosed for generating a collection of clusters of related data from a seed. Seeds may be generated based on seed generation strategies or rules. Clusters may be generated by, for example, retrieving a seed, adding the seed to a first cluster, retrieving a clustering strategy or rules, and adding related data and/or data entities to the cluster based on the clustering strategy. Various cluster scores may be generated based on attributes of data in a given cluster. Further, cluster metascores may be generated based on various cluster scores associated with a cluster. Clusters may be ranked based on cluster metascores. Various embodiments may enable an analyst to discover various insights related to data clusters, and may be applicable to various tasks including, for example, tax fraud detection, beaconing malware detection, malware user-agent detection, and/or activity trend detection, among various others.
    Type: Grant
    Filed: December 23, 2013
    Date of Patent: October 27, 2015
    Assignee: Palantir Technologies Inc.
    Inventors: Alexander Visbal, Adam Borochoff, Jacob Albertson, Trevor Austin, Christopher Rogers, Daniel Campos, Matthew Sprague, Michael Kross, Parvathy Menon, Michael Harris
  • Patent number: 9165299
    Abstract: In various embodiments, systems, methods, and techniques are disclosed for generating a collection of clusters of related data from a seed. Seeds may be generated based on seed generation strategies or rules. Clusters may be generated by, for example, retrieving a seed, adding the seed to a first cluster, retrieving a clustering strategy or rules, and adding related data and/or data entities to the cluster based on the clustering strategy. Various cluster scores may be generated based on attributes of data in a given cluster. Further, cluster metascores may be generated based on various cluster scores associated with a cluster. Clusters may be ranked based on cluster metascores. Various embodiments may enable an analyst to discover various insights related to data clusters, and may be applicable to various tasks including, for example, tax fraud detection, beaconing malware detection, malware user-agent detection, and/or activity trend detection, among various others.
    Type: Grant
    Filed: December 23, 2013
    Date of Patent: October 20, 2015
    Assignee: Palantir Technologies Inc.
    Inventors: Geoff Stowe, Harkirat Singh, Stefan Bach, Matthew Sprague, Michael Kross, Adam Borochoff, Parvathy Menon, Michael Harris
  • Patent number: 9135658
    Abstract: Techniques are disclosed for prioritizing a plurality of clusters. Prioritizing clusters may generally include identifying a scoring strategy for prioritizing the plurality of clusters. Each cluster is generated from a seed and stores a collection of data retrieved using the seed. For each cluster, elements of the collection of data stored by the cluster are evaluated according to the scoring strategy and a score is assigned to the cluster based on the evaluation. The clusters may be ranked according to the respective scores assigned to the plurality of clusters. The collection of data stored by each cluster may include financial data evaluated by the scoring strategy for a risk of fraud. The score assigned to each cluster may correspond to an amount at risk.
    Type: Grant
    Filed: April 29, 2014
    Date of Patent: September 15, 2015
    Assignee: Palantir Technologies Inc.
    Inventors: Matthew Sprague, Michael Kross, Adam Borochoff, Parvathy Menon, Michael Harris
  • Publication number: 20150080012
    Abstract: Systems and methods are disclosed for detecting associated devices. In accordance with one implementation, a method is provided for detecting associated devices. The method includes obtaining information about a target device and determining, based on the information about the target device, one or more target observations that include a target time and a target location. The method also includes identifying one or more second observations of one or more candidate devices, wherein the candidate observations include a second time and a second location that correspond with the target time and the target location. In addition, the method includes determining, from the one or more candidate devices, any associated devices that may correspond with the target device.
    Type: Application
    Filed: September 13, 2013
    Publication date: March 19, 2015
    Applicant: PALANTIR TECHNOLOGIES, INC.
    Inventors: Matthew SPRAGUE, Andy ISAACSON
  • Publication number: 20140310282
    Abstract: Techniques are disclosed for prioritizing a plurality of clusters. Prioritizing clusters may generally include identifying a scoring strategy for prioritizing the plurality of clusters. Each cluster is generated from a seed and stores a collection of data retrieved using the seed. For each cluster, elements of the collection of data stored by the cluster are evaluated according to the scoring strategy and a score is assigned to the cluster based on the evaluation. The clusters may be ranked according to the respective scores assigned to the plurality of clusters. The collection of data stored by each cluster may include financial data evaluated by the scoring strategy for a risk of fraud. The score assigned to each cluster may correspond to an amount at risk.
    Type: Application
    Filed: April 29, 2014
    Publication date: October 16, 2014
    Applicant: Palantir Technologies, Inc.
    Inventors: Matthew Sprague, Michael Kross, Adam Borochoff, Parvathy Menon, Michael Harris
  • Patent number: 8818892
    Abstract: Techniques are disclosed for prioritizing a plurality of clusters. Prioritizing clusters may generally include identifying a scoring strategy for prioritizing the plurality of clusters. Each cluster is generated from a seed and stores a collection of data retrieved using the seed. For each cluster, elements of the collection of data stored by the cluster are evaluated according to the scoring strategy and a score is assigned to the cluster based on the evaluation. The clusters may be ranked according to the respective scores assigned to the plurality of clusters. The collection of data stored by each cluster may include financial data evaluated by the scoring strategy for a risk of fraud. The score assigned to each cluster may correspond to an amount at risk.
    Type: Grant
    Filed: August 15, 2013
    Date of Patent: August 26, 2014
    Assignee: Palantir Technologies, Inc.
    Inventors: Matthew Sprague, Michael Kross, Adam Borochoff, Parvathy Menon, Michael Harris
  • Patent number: 8788405
    Abstract: Techniques are disclosed for generating a collection of clusters of related data from a seed. Doing so may generally include retrieving a seed and adding the seed to a first cluster and include retrieving a cluster strategy referencing one or more data bindings. Each data binding specifies a search protocol for retrieving data. For each of the one or more data bindings, data parameters input to the search protocol are identified, the search protocol is performed using the identified data parameters, and data returned by the search protocol is evaluated for inclusion in the first cluster.
    Type: Grant
    Filed: August 15, 2013
    Date of Patent: July 22, 2014
    Assignee: Palantir Technologies, Inc.
    Inventors: Matthew Sprague, Michael Kross, Adam Borochoff, Parvathy Menon, Michael Harris