Patent application number | Description | Published |
20120059853 | SYSTEM AND METHOD OF LEARNING-BASED MATCHING - Some embodiments match address data in a database system having a corpus of address information stored therein. In some embodiments, an external address data for a company that is associated with a set of locations is received. Some embodiments determine whether the external address data matches existing address data that includes the set of locations using fuzzy matching techniques. In order to determine whether two addresses match, some embodiments perform fuzzy matching techniques that uses learned knowledge to identify aliases in the address pair. In situations where a contact is specified along with the external address data, the contact is tethered to one of the set of locations when the external address data is determined to match an address within the existing address data. Some embodiments create a new location for the company using the external address data when the external address data does not match the existing address data. | 03-08-2012 |
20120066160 | PROBABILISTIC TREE-STRUCTURED LEARNING SYSTEM FOR EXTRACTING CONTACT DATA FROM QUOTES - Systems and methods for updating data stored in a database, such as contact information. An input string is obtained through a search for timely material associated with the stored contact. The input string is parsed using probabilistic tendencies to extract entities corresponding to those stored with the contact. Secondary entities are used to assist in the identification of the primary entities. The contact is then updated (or added if new) using the extracted primary entities. | 03-15-2012 |
20120317121 | METHODS AND SYSTEMS FOR USING DISTRIBUTED MEMORY AND SET OPERATIONS TO PROCESS SOCIAL NETWORKS - Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed. | 12-13-2012 |
20120317149 | METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS - Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed. | 12-13-2012 |
20130031061 | FRAUD ANALYSIS IN A CONTACT DATABASE - A system and method of identifying fraudulent data in a contact database is disclosed herein. In some embodiments, a set of contact records is received where each of the contact records includes a set of contact field values corresponding to a set of contact fields. Some embodiments determine whether a similar content pattern exists in the contact records using at least one of the set of contact field values. In some embodiments, a determination is made as to whether an unusual content pattern exists in the contact records using at least one of the set of contact field values. The set of contact records is flagged when at least one of the similar content pattern or the unusual content pattern is determined to exist in the contact records. | 01-31-2013 |
20130166489 | SYSTEM AND METHOD FOR USING A STATISTICAL CLASSIFIER TO SCORE CONTACT ENTITIES - A system and method for associating a character string with one or more defined entities of a contact record. An input character string is received. The string is first evaluated to see if the structure of the string is recognized. If not, then the string is compared to entries in a look up table. If the string format is not recognized, and the string is not found in the look up table, then a posterior probability is calculated for a set of defined entities over a limited set of string processing features. The result of probabilistic scoring determines which of the defined entities to associate with the character string. | 06-27-2013 |
20130218904 | SYSTEM AND METHOD FOR INFERRING REPORTING RELATIONSHIPS FROM A CONTACT DATABASE - A system and method for inferring reporting relationships from contact records. Contact records from a single company are identified, and each record is ranked based on the title. A probabilistic analysis is used to compare the number of contacts on the current level with the number of contacts on a lower level, and make a guess as to reporting relationships between contacts on the different levels. If a confidence score of a guessed reporting relationship is high enough, the reporting relationship is accepted, and contact records updated. | 08-22-2013 |
20130297661 | SYSTEM AND METHOD FOR MAPPING SOURCE COLUMNS TO TARGET COLUMNS - A system and method for mapping columns from a source file to a target file. The header for each source column is evaluated heuristically to see if the header matches a predefined entity. The contents of a group of cells in the source column are evaluated probabilistically to determine a probability that the cell contents correspond to at least one of the predefined entities. A score is assigned to the likelihood that the column corresponds to one or more predefined entities. If the score meets a threshold, then the correspondence between the source column and one or more predefined entities is mapped. If the score fails to meets the threshold, then the correspondence between the source column and one or more undefined entities is mapped. Finally, each source column is transformed into a target column in accord with the map. | 11-07-2013 |
20150032729 | MATCHING SNIPPETS OF SEARCH RESULTS TO CLUSTERS OF OBJECTS - Systems and methods are provided for matching snippets of search results to clusters of objects. A system searches information based on objects in a cluster of objects. The system extracts a data snippet from the search results. The system determines whether the data snippet includes data that matches at least one of the objects in the cluster of objects. The system adds the data snippet to the cluster of objects if the data snippet includes data that matches at least one of the objects in the cluster of objects. | 01-29-2015 |
20150032738 | CONFIDENTLY ADDING SNIPPETS OF SEARCH RESULTS TO CLUSTERS OF OBJECTS - Systems and methods are provided for matching snippets of search results to clusters of objects. A system adds a data snippet of a search result to a cluster of objects. The system calculates a confidence score for the add based on the recency, a job title, an email address, and/or a phone number associated with the data snippet. The system stores the add in the customer accessible database if the confidence score is sufficiently high for the add to be stored in the customer accessible database. The system generates a notice for review if the confidence score is not sufficiently high for the add to be stored in the customer accessible database. | 01-29-2015 |