# US 2022/0277249 A1 · Benchmarking based on company vendor data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0277249 A1
- Document ID: US20220277249A1
- Status: Published application
- Kind: A1
- Application number: 17/187,408
- Filed: 2021-02-26
- Published: 2022-09-01
- Earliest claimed: 2021-02-26
- Assignees: Intuit Inc.
- Applicants: Intuit Inc.
- Inventors: Sigalit BECHLER; Natalie BARELIYAHU; Guy MAMAN; Daniel ZACH; Shlomi MEDALION
- Web page: https://patentgrep.com/patent/US20220277249A1

## CPC

- G06Q 10/06393: {Score-carding, benchmarking or key performance indicator [KPI] analysis}
- G06F 17/18: for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)}
- G06F 18/23213: with fixed number of clusters, e.g. K-means clustering
- G06N 20/00: Machine learning
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Certain aspects of the present disclosure provide methods, processing systems, and computer-readable mediums for benchmarking based on company vendor data. Transactions identifying vendors are received for a group of companies whose industry is known. For each identified vendor, a vendor embedding is generated in the form of a vector representing a distribution of transactions for the vendor across industries represented by the companies. For each company, a company embedding is generated in the form of a vector representing an aggregation of vendor embeddings from vendors with which the company has had a transaction. The company embeddings are then clustered using an unsupervised clustering method such as k-Means clustering. For a new company, a company embedding is generated and correlated to the appropriate cluster. Based on the cluster correlated to the new company, data is generated from other companies in the cluster that may be used to benchmark the new company.

## Claims

### Claim 1

A method, comprising:
receiving a plurality of vendor transactions for each company of a plurality of companies, each vendor transaction identifying a transaction between each respective company of the plurality of companies and one vendor of a plurality of vendors;
generating a vendor embedding vector for each vendor of the plurality of vendors comprising a vector of industry parameters;
generating a company embedding vector for each company of the plurality of companies, comprising an aggregation of vendor embedding vectors;
providing the company embedding vectors to a clustering algorithm to produce a plurality of industry clusters;
correlating a first company to an industry cluster of the plurality of industry clusters, the first company comprising an attribute;
aggregating data associated with the attribute for each company in the industry cluster; and
displaying a value of the attribute of the first company relative to the aggregated data of the attribute to a user.

### Claim 2 (depends on 1)

The method of claim 1, wherein the vector of industry parameters comprises a distribution of industries with which the vendor has had at least one transaction.

### Claim 3 (depends on 2)

The method of claim 2, wherein the company embedding vector for each respective company of the plurality of companies includes one or more vendor embedding vectors for vendors with which the respective company has had at least one transaction comprises one of an average, a median, and a mode.

### Claim 4 (depends on 1)

The method of claim 1, wherein the clustering algorithm is an unsupervised machine learning algorithm.

### Claim 5 (depends on 4)

The method of claim 4, wherein the clustering algorithm is a K-means clustering algorithm.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
dividing at least one cluster generated by the clustering algorithm into at least two clusters, the dividing comprising:
measuring a distance from each member in the at least one cluster to a centroid of the cluster;
adding a second centroid to the cluster when the distance measured from at least one member exceeds a threshold; and
generating two clusters by providing each member of the at least one cluster, the centroid, and the second centroid, to the clustering algorithm.

### Claim 7 (depends on 1)

The method of claim 1, wherein correlating the first company to the industry cluster comprises generating a first company embedding vector for the first company and measuring a distance from the first company embedding vector to a center of a centroid of the industry cluster.

### Claim 8

A non-transitory computer-readable storage medium storing instructions that, when executed by a processor of a processing system, cause the processing system to perform a method, the method comprising:
receiving a plurality of vendor transactions for each company of a plurality of companies, each vendor transaction identifying a transaction between each respective company of the plurality of companies and one vendor of a plurality of vendors;
generating a vendor embedding vector for each vendor of the plurality of vendors comprising a vector of industry parameters;
generating a company embedding vector for each company of the plurality of companies, comprising an aggregation of vendor embedding vectors;
providing the company embedding vectors to a clustering algorithm to produce a plurality of industry clusters;
correlating a first company to an industry cluster of the plurality of industry clusters, the first company comprising an attribute;
aggregating data associated with the attribute for each company in the industry cluster; and
displaying a value of the attribute of the company relative to the aggregated data of the attribute to a user.

### Claim 9 (depends on 8)

The non-transitory computer-readable storage medium of claim 8, wherein the vector of industry parameters comprises a distribution of industries with which the vendor has had at least one transaction.

### Claim 10 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, wherein the company embedding vector for each respective company of the plurality of companies includes one or more vendor embedding vectors for vendors with which the respective company has had at least one transaction comprises one of an average, a median, and a mode.

### Claim 11 (depends on 8)

The non-transitory computer-readable storage medium of claim 8, wherein the clustering algorithm is an unsupervised machine learning algorithm.

### Claim 12 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein the clustering algorithm is a K-means clustering algorithm.

### Claim 13 (depends on 12)

The non-transitory computer-readable storage medium of claim 12, wherein the method further comprises:
dividing at least one cluster generated by the clustering algorithm into at least two clusters, the dividing comprising:
measuring a distance from each member in the at least one cluster to a centroid of the cluster;
adding a second centroid to the cluster when the distance measured from at least one member exceeds a threshold; and
generating two clusters by providing each member of the at least one cluster, the centroid, and the second centroid, to the clustering algorithm.

### Claim 14 (depends on 8)

The non-transitory computer-readable storage medium of claim 8, correlating the first company to the industry cluster comprises generating a first company embedding vector for the first company and measure a distance from the first company embedding vector to a center of a centroid of the industry cluster.

### Claim 15

A system, comprising:
a memory comprising executable instructions;
a processor configured to execute the executable instructions and cause the system to:
receive a plurality of vendor transactions for each company of a plurality of companies, each vendor transaction identifying a transaction between each respective company of the plurality of companies and one vendor of a plurality of vendors;
generate a vendor embedding vector for each vendor of the plurality of vendors comprising a vector of industry parameters;
generate a company embedding vector for each company of the plurality of companies, comprising an aggregation of vendor embedding vectors;
provide the company embedding vectors to a clustering algorithm to produce a plurality of industry clusters;
correlate a first company to an industry cluster of the plurality of industry clusters, the first company comprising an attribute;
aggregate data associated with the attribute for each company in the industry cluster; and
display a value of the attribute of the first company relative to the aggregated data of the attribute to a user.

### Claim 16 (depends on 15)

The system of claim 15, wherein the vector of industry parameters comprises a distribution of industries with which the vendor has had at least one transaction.

### Claim 17 (depends on 16)

The system of claim 16, wherein the company embedding vector for each respective company of the plurality of companies is based on one or more vendor embedding vectors for vendors with which the respective company has had at least one transaction comprises one of an average, a median, and a mode.

### Claim 18 (depends on 15)

The system of claim 15, wherein the clustering algorithm is an unsupervised machine learning algorithm.

### Claim 19 (depends on 18)

The system of claim 18, wherein the clustering algorithm is a K-means clustering algorithm.

### Claim 20 (depends on 19)

The system of claim 19, wherein the processor is further configured to cause the system to:
divide at least one cluster generated by the clustering algorithm into at least two clusters, the dividing comprising:
measure a distance from each member in the at least one cluster to a centroid of the cluster;
add a second centroid to the cluster when the distance measured from at least one member exceeds a threshold; and
generate two clusters by providing each member of the at least one cluster, the centroid, and the second centroid, to the clustering algorithm.
