Abstract:
Systems and methods are provided for investigation of network activities. Network activity information may be accessed. The network activity information may describe for an individual (1) respective relationship with one or more persons; and (2) respective activity status information indicating whether a given person has engaged in a particular activity. A network activity graph may be generated based on the network activity information. The network activity graph may include two or more nodes representing the individual and the one or more persons. Connections between the nodes may represent the respective relationships between the individual and the one or more persons. Data corresponding to the network activity graph may be presented through an interface.
Abstract:
Systems, methods, and non-transitory computer readable media are provided for labeling depictions of objects within images. An image may be obtained. The image may include a depiction of an object. A user's marking of a set of dots within the image may be received. The set of dots may include one or more dots. The set of dots may be positioned within or near the depiction of the object. The depiction of the object within the image may be labeled based on the set of dots.
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.
Abstract:
Various systems and methods are provided that identify prior art patent references for a subject patent application. For example, the system preprocesses a corpus of patent references to identify keywords that are present in each of the patent references, n-grams present in the corpus, and a weighting associated with the identified n-grams. To identify prior art patent references, the system requests a user to provide a patent application. The system extracts n-grams found in the provided patent application and orders the n-grams based on the assigned n-gram weights. The system compares the top Y-rated n-grams with the identified keywords and retrieves patent references that include a keyword that matches one of the top Y-rated n-grams. The system re-ranks the retrieved patent references using, for example, artificial intelligence. The top Z-ranked retrieved patent references are transmitted to a user device for display in a user interface.
Abstract:
Computer implemented systems and methods are disclosed for automatically clustering and canonically identifying related data in various data structures. Data structures may include a plurality of records, wherein each record is associated with a respective entity. In accordance with some embodiments, the systems and methods further comprise identifying clusters of records associated with a respective entity by grouping the records into pairs, analyzing the respective pairs to determine a probability that both members of the pair relate to a common entity, and identifying a cluster of overlapping pairs to generate a collection of records relating to a common entity. Clusters may further be analyzed to determine canonical names or other properties for the respective entities by analyzing record fields and identifying similarities.
Abstract:
Computer implemented systems and methods are disclosed for automatically clustering and canonically identifying related data in various data structures. Data structures may include a plurality of records, wherein each record is associated with a respective entity. In accordance with some embodiments, the systems and methods further comprise identifying clusters of records associated with a respective entity by grouping the records into pairs, analyzing the respective pairs to determine a probability that both members of the pair relate to a common entity, and identifying a cluster of overlapping pairs to generate a collection of records relating to a common entity. Clusters may further be analyzed to determine canonical names or other properties for the respective entities by analyzing record fields and identifying similarities.
Abstract:
Computer implemented systems and methods are disclosed for automatically clustering and canonically identifying related data in various data structures. Data structures may include a plurality of records, wherein each record is associated with a respective entity. In accordance with some embodiments, the systems and methods further comprise identifying clusters of records associated with a respective entity by grouping the records into pairs, analyzing the respective pairs to determine a probability that both members of the pair relate to a common entity, and identifying a cluster of overlapping pairs to generate a collection of records relating to a common entity. Clusters may further be analyzed to determine canonical names or other properties for the respective entities by analyzing record fields and identifying similarities.
Abstract:
Systems and methods are provided for investigation network activities. Network activity information may be accessed. The network activity information may describe for an individual (1) respective relationship with one or more persons; and (2) respective activity status information indicating whether a given person has engaged in a particular activity. A network activity graph may be generated based on the network activity information. The network activity graph may include two or more nodes representing the individual and the one or more persons. Connections between the nodes may represent the respective relationships between the individual and the one or more persons. Data corresponding to the network activity graph may be presented through an interface.
Abstract:
Systems, methods, and non-transitory computer readable media are provided for labeling depictions of objects within images. An image may be obtained. The image may include a depiction of an object. A user's marking of a set of dots within the image may be received. The set of dots may include one or more dots. The set of dots may be positioned within or near the depiction of the object. The depiction of the object within the image may be labeled based on the set of dots.
Abstract:
Systems and methods are provided for performing context-based keyword searching using a search bar. Based on search terms received via the search bar, the system may be configured to provide suggested search parameters to associate with that search term. The suggested search parameters may each include a type of data and/or a filter to associate with the search term (e.g., name, phone number, date of birth, etc.). The one or more suggested search parameters may be identified based on the search term itself, a list of possible types of data or filters, a preliminary search of one or more datasets, a record of one or more previous searches performed, requirements associated with one or more searchable datasets, the format of user input received via the search bar, and/or one or more other factors.