| US 7,542,953 B1 | ||
| Data classification by kernel density shape interpolation of clusters | ||
| Tanveer Syeda-Mahmood, Cupertino, Calif. (US); Peter J. Haas, San Jose, Calif. (US); John M. Lake, Cary, N.C. (US); and Guy M. Lohman, San Jose, Calif. (US) | ||
| Assigned to International Business Machines Corporation, Armonk, N.Y. (US) | ||
| Filed on Jun. 20, 2008, as Appl. No. 12/142,949. | ||
| Application 12/142949 is a continuation of application No. 11/940739, filed on Nov. 15, 2007, granted, now 7,412,429. | ||
| This patent is subject to a terminal disclaimer. | ||
| Int. Cl. G06F 17/00 (2006.01); G06F 15/00 (2006.01); G06F 15/18 (2006.01); G06N 5/00 (2006.01) | ||
| U.S. Cl. 706—45 [706/62] | 5 Claims |
| 1. A data processing system comprising:
a processor;
a random access memory for storing data and programs for execution by the processor; and
computer readable instructions stored in the random access memory for execution by the processor to perform a method for obtaining
a shape interpolated representation of shapes of one or more clusters in an image of a dataset that has been clustered, the
method comprising:
generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution
for each cluster in the image using a kernel density function;
evaluating the density estimate value of each grid point for each cluster to identify a maximum density estimate value of
each grid point and a cluster associated with the maximum density estimate value of each grid point; and
adding each grid point for which the maximum density estimate value exceeds a specified threshold to the cluster associated
with the maximum density estimate value for the grid point to form a shape interpolated representation of the one or more
clusters.
|