# US 2024/0202214 A1 · Clustering numerical values using logarithmic binning

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

- Number: US 2024/0202214 A1
- Document ID: US20240202214A1
- Status: Published application
- Kind: A1
- Application number: 18/067,770
- Filed: 2022-12-19
- Published: 2024-06-20
- Earliest claimed: 2022-12-19
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Rajesh Bordawekar
- Web page: https://patentgrep.com/patent/US20240202214A1

## CPC

- G06F 16/285: {Clustering or classification}
- G06F 16/2433: {Query languages}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Clustering data points of a relational database having special data types is performed by establishing logarithmic bins in which the data is collected. Special data types include (i) zero; (ii) positive and negative values; (iii) infinity (positive and negative); (iv) not-a-number values (NaNs); (v) out-of-range values; and (vi) IEEE DECFloat (decimal floating-point) values. The numerical data is mapped to bins according to their values and redistributed among the bins based on median bin value. An occupancy-based partitioning process assures each bin has no more than a pre-defined threshold percentage of the data. Assigning data bins to clusters facilitates prediction of placement of input values into a particular cluster for response to database queries.

## Claims

### Claim 1

A computer-implemented method comprising:
mapping numerical data points from a dataset into a plurality of buckets organized using logarithmic ranges;
redistributing the numerical data points among the plurality of buckets based on median values of the data points within each bucket; and
partitioning the plurality of buckets into a set of evenly occupied buckets such that each bucket occupancy is less than a pre-defined threshold value.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising:
calculating the median values of each bucket in the plurality of buckets.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the pre-defined threshold value is a percentage of the total data points stored in the evenly occupied buckets.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein the mapping includes:
using intra-file parallelization by implementing a plurality of threads wherein each thread processes a part of the numerical data points and populates a respective set of buckets organized using logarithmic ranges; and
merging the respective sets of buckets to generate the plurality of buckets.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the partitioning includes:
using inter-file parallelization by assigning each file of dataset to a different set of threads to partition the dataset in parallel.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, further comprising:
receiving a query dataset including a first data point;
predicting the first data point to be within a first evenly occupied bucket; and
responding to the query based on the predicted first evenly occupied bucket.

### Claim 7

A computer program product comprising a computer-readable storage medium having a set of instructions stored therein which, when executed by a processor, causes the processor to perform a method comprising:
mapping numerical data points from a dataset into a plurality of buckets organized using logarithmic ranges;
redistributing the numerical data points among the plurality of buckets based on median values of the data points within each bucket; and
partitioning the plurality of buckets into a set of evenly occupied buckets such that each bucket occupancy is less than a pre-defined threshold value.

### Claim 8 (depends on 7)

The computer program product of claim 7, further comprising:
calculating the median values of each bucket in the plurality of buckets.

### Claim 9 (depends on 7)

The computer program product of claim 7, wherein the pre-defined threshold value is a percentage of the total data points stored in the evenly occupied buckets.

### Claim 10 (depends on 7)

The computer program product of claim 7, wherein the mapping includes:
using intra-file parallelization by implementing a plurality of threads wherein each thread processes a part of the numerical data points and populates a respective set of buckets organized using logarithmic ranges; and
merging the respective sets of buckets to generate the plurality of buckets.

### Claim 11 (depends on 7)

The computer program product of claim 7, wherein the partitioning includes:
using inter-file parallelization by assigning each file of dataset to a different set of threads to partition the dataset in parallel.

### Claim 12 (depends on 7)

The computer program product of claim 7, further comprising:
receiving a query dataset including a first data point;
predicting the first data point to be within a first evenly occupied bucket; and
responding to the query based on the predicted first evenly occupied bucket.

### Claim 13

A computer system comprising:
a processor set; and
a computer readable storage medium;
wherein:
the processor set is structured, located, connected, and/or programmed to run program instructions stored on the computer readable storage medium; and
the program instructions which, when executed by the processor set, cause the processor set to perform a method comprising:
mapping numerical data points from a dataset into a plurality of buckets organized using logarithmic ranges;
redistributing the numerical data points among the plurality of buckets based on median values of the data points within each bucket; and
partitioning the plurality of buckets into a set of evenly occupied buckets such that each bucket occupancy is less than a pre-defined threshold value.

### Claim 14 (depends on 13)

The computer system of claim 13, further comprising:
calculating the median values of each bucket in the plurality of buckets.

### Claim 15 (depends on 13)

The computer system of claim 13, wherein the pre-defined threshold value is a percentage of the total data points stored in the evenly occupied buckets.

### Claim 16 (depends on 13)

The computer system of claim 13, wherein the mapping includes:
using intra-file parallelization by implementing a plurality of threads wherein each thread processes a part of the numerical data points and populates a respective set of buckets organized using logarithmic ranges; and
merging the respective sets of buckets to generate the plurality of buckets.

### Claim 17 (depends on 13)

The computer system of claim 13, wherein the partitioning includes:
using inter-file parallelization by assigning each file of dataset to a different set of threads to partition the dataset in parallel.

### Claim 18 (depends on 13)

The computer system of claim 13, further comprising:
receiving a query dataset including a first data point;
predicting the first data point to be within a first evenly occupied bucket; and
responding to the query based on the predicted first evenly occupied bucket.
