Statistical K-means Clustering
AssigneeInternational Business Machines Corporation
InventorsRahul M. Rao, Naiju Karim Abdul, Anay K. Desai, Suriya T Skariah
Life of this patent
Estimating the term…
Abstract
In a computer-implemented method for improving a k-means clustering algorithm, a processor modifies a first data point of a data set to include a first distribution boundary. A processor calculates a first effective distance between the first distribution boundary and a first centroid of a cluster. A processor assigns the first data point to the first cluster. A processor recomputes the first centroid based on the first data point and the first distribution boundary.
Claims20
A computer-implemented method for improving a k-means clustering algorithm, comprising:
- modifying, by one or more processors, a first data point of a data set to include a first distribution boundary, wherein the first distribution boundary comprises a space in which the first data point may exist without changing the representation of the first data point within the data set;
- calculating, by one or more processors, a first effective distance between the first distribution boundary and a first centroid of a cluster;
- assigning, by one or more processors, the first data point to the first cluster;
- recomputing, by one or more processors, the first centroid based on the first data point and the first distribution boundary.
A computer program product for improving a k-means clustering algorithm, comprising:
- one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions comprising:
- program instructions to modify a first data point of a data set to include a first distribution boundary, wherein the first distribution boundary comprises a space in which the first data point may exist without changing the representation of the first data point within the data set;
- program instructions to calculate a first effective distance between the first distribution boundary and a first centroid of a cluster;
- program instructions to assign the first data point to the first cluster;
- program instructions to recompute the first centroid based on the first data point and the first distribution boundary.
A computer system for improving a k-means clustering algorithm, comprising:
- one or more computer processors, one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:
- program instructions to modify a first data point of a data set to include a first distribution boundary, wherein the first distribution boundary comprises a space in which the first data point may exist without changing the representation of the first data point within the data set;
- program instructions to calculate a first effective distance between the first distribution boundary and a first centroid of a cluster;
- program instructions to assign the first data point to the first cluster;
- program instructions to recompute the first centroid based on the first data point and the first distribution boundary.
Dependencies are inferred from the claim text.