# US 2026/0300407 A1 · Data clustering using density-based silhouette scores

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

- Number: US 2026/0300407 A1
- Document ID: US20260300407A1
- Status: Published application
- Kind: A1
- Application number: 19/094,875
- Filed: 2025-03-29
- Published: 2026-10-01
- Earliest claimed: 2025-03-26
- Assignees: Infosys Limited
- Applicants: Infosys Limited
- Inventors: Janani Varun
- Web page: https://patentgrep.com/patent/US20260300407A1

## CPC

- G06F 16/906: Clustering; Classification
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A clustering technique using density-based silhouette scores is provided. Based on a cluster count, a clustering operation is executed on data points to generate various clusters. For each data point, a density score, indicating the number of data points within a predefined range from the corresponding data point in the same cluster, is determined. Based on the density score, weighted distances are determined for each data point. Based on the density score and the weighted distances, a silhouette score is generated for each data point. A cluster silhouette score is computed for each cluster as an average of silhouette scores of all data points within the cluster. If any cluster silhouette score is less than a threshold score, the cluster count is updated based on the cluster silhouette scores, and the process is repeated until all cluster silhouette scores are equal to or greater than the threshold score.

## Claims

### Claim 1

A system, comprising:
processing circuitry configured to:
execute, based on a first cluster count, a clustering operation on a plurality of data points to generate a first plurality of clusters, with a first cluster comprising a first set of data points, of the plurality of data points;
determine, for a first data point of the first set of data points, a first density score that is indicative of a number of data points in the first cluster within a predefined range from the first data point;
determine, for the first data point, based on the first density score, a first set of weighted distances, with a first weighted distance being determined between the first data point and a second data point of the first set of data points, wherein the first weighted distance is determined by determining a first distance between the first data point and the second data point, and adjusting the first distance based on the first density score;
generate a first set of silhouette scores for the first set of data points, with a first silhouette score for the first data point generated based on the first density score and the first set of weighted distances; and
compute a first plurality of cluster silhouette scores for the first plurality of clusters, with a first cluster silhouette score for the first cluster computed based on the first set of silhouette scores, wherein the clustering of the plurality of data points is controlled based on the first plurality of cluster silhouette scores.

### Claim 2 (depends on 1)

The system of claim 1, wherein a number of clusters in the first plurality of clusters is equal to the first cluster count.

### Claim 3 (depends on 1)

The system of claim 1, wherein the clustering operation corresponds to one of a k-means clustering operation, a density-based spatial clustering of applications with noise (DBSCAN) operation, a divisive hierarchical clustering operation, or a spectral clustering operation.

### Claim 4

(canceled)

### Claim 5 (depends on 4)

The system of claim 4, wherein the adjusted first distance corresponds to a product of the first distance and the first density score.

### Claim 6 (depends on 4)

The system of claim 4, wherein the first distance between the first data point and the second data point corresponds to a Euclidian distance.

### Claim 7 (depends on 1)

The system of claim 1,
wherein the processing circuitry is further configured to generate a first intra-cluster distance for the first data point based on the first set of weighted distances, and
wherein the first silhouette score for the first data point is generated based on the first density score and the first intra-cluster distance.

### Claim 8 (depends on 7)

The system of claim 7, wherein the first intra-cluster distance corresponds to an average of the first set of weighted distances.

### Claim 9 (depends on 7)

The system of claim 7,
wherein the processing circuitry is further configured to determine a set of distances between the first data point and a second set of data points of a second cluster of the first plurality of clusters,
wherein the second cluster is a k-nearest neighbor of the first cluster, and
wherein the first silhouette score for the first data point is generated further based on a first inter-cluster distance that corresponds to an average of the set of distances.

### Claim 10 (depends on 1)

The system of claim 1, wherein the first cluster silhouette score for the first cluster corresponds to an average of the first set of silhouette scores.

### Claim 11 (depends on 1)

The system of claim 1, wherein the processing circuitry is configured to determine the first density score for the first data point using a k-nearest neighbors' technique.

### Claim 12 (depends on 1)

The system of claim 1, wherein the processing circuitry is further configured to extract the plurality of data points from a source file associated with a legacy system.

### Claim 13 (depends on 12)

The system of claim 12, wherein the source file corresponds to a code block associated with the legacy system, and wherein the plurality of data points extracted from the source file corresponds to a plurality of business rules associated with the code block.

### Claim 14 (depends on 12)

The system of claim 12,
wherein, to execute the clustering operation on the plurality of data points, the processing circuitry is further configured to transform the plurality of data points into a plurality of embedding vectors, with each embedding vector representing a distinct data attribute of the legacy system, and
wherein the first cluster comprises a first set of embedding vectors, of the plurality of embedding vectors, corresponding to the first set of data points.

### Claim 15 (depends on 14)

The system of claim 14, wherein the processing circuitry is configured to transform the plurality of data points into the plurality of embedding vectors based on a Universal Sentence Encoder (USE) technique.

### Claim 16 (depends on 1)

The system of claim 1, wherein the processing circuitry is further configured to:
compare each of the first plurality of cluster silhouette scores with a threshold score;
determine a second cluster count for the clustering operation in response to at least one of the first plurality of cluster silhouette scores being less than the threshold score, wherein the second cluster count is determined based on the first plurality of cluster silhouette scores; and
re-execute, based on the second cluster count, the clustering operation on the plurality of data points to generate a second plurality of clusters, wherein a number of clusters in the second plurality of clusters is equal to the second cluster count.

### Claim 17 (depends on 16)

The system of claim 16, wherein the processing circuitry is further configured to:
compute a second plurality of cluster silhouette scores for the second plurality of clusters;
compare each of the second plurality of cluster silhouette scores with the threshold score; and
generate, in response to each of the second plurality of cluster silhouette scores being equal to or greater than the threshold score, one or more system architecture elements based on the second plurality of clusters.

### Claim 18 (depends on 17)

The system of claim 17,
wherein the plurality of data points corresponds to a plurality of business rules associated with a code block,
wherein each cluster, of the second plurality of clusters, includes a set of business rules of the plurality of business rules,
wherein each cluster of the second plurality of clusters corresponds to an entity associated with the code block, and
wherein the one or more system architecture elements are generated in conformity with the entity and the set of business rules associated with each cluster of the second plurality of clusters.

### Claim 19 (depends on 16)

The system of claim 16, wherein the processing circuitry is configured to execute a combination of a within-cluster sum of squares (WCSS) analysis and a silhouette analysis on the first plurality of cluster silhouette scores to determine the second cluster count.

### Claim 20

A method, comprising:
executing, by processing circuitry, based on a first cluster count, a clustering operation on a plurality of data points to generate a first plurality of clusters, with a first cluster comprising a first set of data points, of the plurality of data points;
determining, by the processing circuitry, for a first data point of the first set of data points, a first density score that is indicative of a number of data points in the first cluster within a predefined range from the first data point;
determining, by the processing circuitry, for the first data point, based on the first density score, a first set of weighted distances, with a first weighted distance being determined between the first data point and a second data point of the first set of data points, wherein the first weighted distance is determined by determining a first distance between the first data point and the second data point, and adjusting the first distance based on the first density score;
generating, by the processing circuitry, a first set of silhouette scores for the first set of data points, with a first silhouette score for the first data point generated based on the first density score and the first set of weighted distances; and
computing, by the processing circuitry, a first plurality of cluster silhouette scores for the first plurality of clusters, with a first cluster silhouette score for the first cluster computed based on the first set of silhouette scores, wherein the clustering of the plurality of data points is controlled based on the first plurality of cluster silhouette scores.
