Organizational data enrichment

A system comprising:

• a computer-readable medium having instructions stored there on, which, when executed by a processor, cause the system to perform operations comprising:
• training, using a supervised machine learning algorithm, a supervised machine learning mapping component to calculate a similarity function between records corresponding to organizations based on a first plurality of features, the training comprising executing the supervised machine learning algorithm on training data to learn previously undefined weights assigned to the plurality of features, each record corresponding to an organization and containing information about the organization, at least some of the plurality of records corresponding to an identical organization as each other, each record comprising a plurality of fields with one or more tokens in each field, the method comprising:
• performing a fuzzy join operation by:
• for each pair of records in the plurality of records:
• evaluating the first plurality of features for both records in the pair of records by calculating term frequency-inverse document frequency (TF-IDF) for each token of each field relevant to each feature in the first plurality of features;
• modifying the calculated TF-IDF for each token;
• based on the modified calculated TF-IDF for each token of each field relevant to each feature in the first plurality of features, computing a similarity score based on the similarity function using the supervised machine learning mapping component by adding the modified TF-IDF for any token that appears in both records in the pair of records;
• creating a graph data structure having a node for each record in the plurality of records and edges between each of the nodes, except, for each record pair having a similarity score that does not transgress a first threshold, causing no edge between the nodes for the record pair to appear in the graph data structure;
• clustering nodes in the graph data structure into one or more record clusters using a clustering algorithm;
• and
• for each of the one or more record clusters, fusing each record having a node in the record cluster together to create a single record for each record cluster.

A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform operations comprising:

• training, using a supervised machine learning algorithm, a supervised machine learning mapping component to calculate a similarity function between records corresponding to organizations based on a first plurality of features, the training comprising executing the supervised machine learning algorithm on training data to learn previously undefined weights assigned to the plurality of features, each record corresponding to an organization and containing information about the organization, at least some of the plurality of records corresponding to an identical organization as each other, each record comprising a plurality of fields with one or more tokens in each field, the method comprising:
• performing a fuzzy join operation by:
• for each pair of records in the plurality of records:
• evaluating the first plurality of features for both records in the pair of records by calculating term frequency-inverse document frequency (TF-IDF) for each token of each field relevant to each feature in the first plurality of features;
• modifying the calculated TF-IDF for each token;
• based on the modified calculated TF-IDF for each token of each field relevant to each feature in the first plurality of features, computing a similarity score based on the similarity function using the supervised machine learning mapping component by adding the modified TF-IDF for any token that appears in both records in the pair of records;
• creating a graph data structure having a node for each record in the plurality of records and edges between each of the nodes, except, for each record pair having a similarity score that does not transgress a first threshold, causing no edge between the nodes for the record pair to appear in the graph data structure;
• clustering nodes in the graph data structure into one or more record clusters using a clustering algorithm;
• and
• for each of the one or more record clusters, fusing each record having a node in the record cluster together to create a single record for each record cluster.