Data plot processing

• US 10,121,278 B2
• Filed: 03/21/2018
• Issued: 11/06/2018
• Est. Priority Date: 08/15/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Baudel, Thomas, Broeksema, Albertus H. J.
• Primary Examiner(s): Le, Sarah
• Application Number:
  US15/927,535
• Publication Number:
  US 20180211437A1
• Time in Patent Office: 230 Days
• Field of Search: None
• CPC Class Codes: G06F 18/213 Feature extraction, e.g. by transforming the feature space; Summarisation; Mappings, e.g. subspace methods
• CPC Class Codes: G06F 18/2413 based on distances to training or reference patterns
• CPC Class Codes: G06T 11/00 2D [Two Dimensional] image generation
• CPC Class Codes: G06T 15/10 Geometric effects
• CPC Class Codes: G06T 19/00 Manipulating 3D models or images for computer graphics
• CPC Class Codes: G06T 2219/004 Annotating, labelling

Abstract

A method, system, and/or computer program product processes a data plot comprising a plurality of data points for inclusion of additional information content. A space of the data plot is divided into subspaces, where each subspace contains at least one data point of the data plot. An available area on a display for each subspace is computed, and then a compressed information representation for each subspace is computed based on information about at least one data point contained in each subspace and a computed available area for each subspace. An available area of each subspace is computed based on a maximum size of a shape that can fit within each subspace, where the shape is centered on a barycenter of each subspace. The data plot is displayed, where each unit of compressed information is displayed adjacent to a corresponding group of data points from the data plot.

Claims

1. A method of processing a data plot comprising a plurality of data points for inclusion of additional information content, the method comprising:

dividing, by one or more processors, a space of the data plot into subspaces, wherein each subspace contains at least one data point of the data plot;

computing, by one or more processors, an available area on a display for each subspace;

computing, by one or more processors, a compressed information representation for each subspace based on information about said at least one data point contained in said each subspace and a computed available area for said each subspace;

computing, by one or more processors, an available area of said each subspace based on a maximum size of a shape that can fit within said each subspace, wherein the shape is centered on a barycenter of said each subspace; and

displaying, by one or more processors, the data plot with the compressed information representation for said each subspace, wherein each unit of compressed information is displayed on the display adjacent to a corresponding group of data points from the data plot.

2. The method of claim 1, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell, and wherein the method further comprises:

determining, by one or more processors, a maximum size of the label that can be fitted within a circle that is bound by the particular Voronoi cell on the display; and

in response to determining that the label for the multiple data points in the particular Voronoi cell cannot be fitted within the circle, compressing, by one or more processors, the label to create a lossy label that does not describe all information found in the compressed information representation.

3. The method of claim 1, further comprising:

in response to a size of a smaller subspace from said subspaces being smaller than a predetermined value, merging, by one or more processors, said smaller subspace with a neighboring subspace.

4. The method of claim 3, further comprising:

identifying, by one or more processors, subspaces that have a size smaller than the predetermined value; and

merging, by one or more processors, the subspaces determined to have the size smaller than the predetermined value with neighboring subspaces, wherein an order of merging subspaces is based on a size of the subspaces to be merged.

5. The method of claim 4, wherein the subspaces are merged in order of ascending size.

6. The method of claim 1, further comprising:

in response to a separation of two data points in the data plot being less than a predetermined value, merging, by one or more processors, the two data points into a new merged data point; and

defining and displaying, by one or more processors, a merged data point subspace in the space, wherein the merged data point subspace contains the new merged data point.

7. The method of claim 1, further comprising:

generating, by one or more processors, a compressed information representation from the information about said multiple data points contained in said each subspace;

determining, by one or more processors, if a size of the compressed information representation fits within a computed available area for said each subspace; and

in response to the compressed information representation failing to fit within the computed available area for said each subspace, further compressing, by one or more processors, the compressed information representation to generate a new compressed information representation.

8. The method of claim 7, further comprising:

determining, by one or more processors, if repetition exists within the information about the multiple data points contained in said each subspace and, if repetition is determined to exist, representing the repeated information with a single object in the compressed information representation, the single object indicating the number of repetitions of the repeated information.

9. The method of claim 7, further comprising:

determining, by one or more processors, if information within the information about said multiple data points contained in said each subspace shares a common attribute; and

in response to determining that information within the information about said multiple data points contained in said each subspace shares the common attribute, representing, by one or more processors, the information that shares the common attribute in the compressed information representation.

10. The method of claim 7, further comprising:

editing, by one or more processors, the compressed information representation to be smaller in size by reducing an amount of information displayed by the compressed information representation.

11. The method of claim 7, further comprising:

determining, by one or more processors, a quantity of data points contained in said each subspace; and

editing, by one or more processors, the compressed information representation so that said compressed information representation represents a determined number of data points contained in said each subspace.

12. A computer program product for processing a data plot comprising a plurality of data points for inclusion of additional information content, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:

dividing a space of the data plot into subspaces, wherein each subspace contains at least one data point of the data plot;

computing an available area on a display for each subspace;

computing a compressed information representation for each subspace based on information about said at least one data point contained in said each subspace and a computed available area for said each subspace;

computing an available area of said each subspace based on a maximum size of a shape that can fit within said each subspace, wherein the shape is centered on a barycenter of said each subspace; and

displaying the data plot with the compressed information representation for said each subspace, wherein each unit of compressed information is displayed on the display adjacent to a corresponding group of data points from the data plot.

13. The computer program product of claim 12, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell, and wherein the method further comprises:

determining a maximum size of the label that can be fitted within a circle that is bound by the particular Voronoi cell on the display; and

in response to determining that the label for the multiple data points in the particular Voronoi cell cannot be fitted within the circle, compressing the label to create a lossy label that does not describe all information found in the compressed information representation.

14. The computer program product of claim 12, wherein the method further comprises:

in response to a size of a smaller subspace from said subspaces being smaller than a predetermined value, merging said smaller subspace with a neighboring subspace.

15. The computer program product of claim 12, wherein the method further comprises:

in response to a separation of two data points in the data plot being less than a predetermined value, merging the two data points.

16. The computer program product of claim 12, wherein the method further comprises:

generating the compressed information representation from the information about said multiple data points contained said each subspace;

determining if a size of the compressed information representation fits within a computed available area for said each subspace; and

in response to the compressed information representation failing to fit within the computed available area for said each subspace, further compressing the compressed information representation to generate a new compressed information representation.

17. A computer system comprising:

a processor, a computer readable memory, and a non-transitory computer readable storage medium;

first program instructions to divide a space of the data plot into subspaces, wherein each subspace contains at least one data point of the data plot;

second program instructions to compute an available area on a display for each subspace;

third program instructions to compute a compressed information representation for each subspace based on information about said at least one data point contained in said each subspace and a computed available area for said each subspace;

fourth program instructions to compute an available area of said each subspace based on a maximum size of a shape that can fit within said each subspace, wherein the shape is centered on a barycenter of said each subspace; and

fifth program instructions to display the data plot with the compressed information representation for said each subspace, wherein each unit of compressed information is displayed on the display adjacent to a corresponding group of data points from the data plot; and

wherein said first, second, third, fourth, and fifth program instructions are stored on said non-transitory computer readable storage medium for execution by said processor via said computer readable memory.

18. The computer system of claim 17, wherein the compressed information representation is a label that describes multiple data points within a particular Voronoi cell, and wherein the computer system further comprises:

sixth program instructions to determine a maximum size of the label that can be fitted within a circle that is bound by the particular Voronoi cell on the display; and

seventh program instructions to, in response to determining that the label for the multiple data points in the particular Voronoi cell cannot be fitted within the circle, compress the label to create a lossy label that does not describe all information found in the compressed information representation; and

wherein

said sixth and seventh program instructions are stored on said non-transitory computer readable storage medium for execution by said processor via said computer readable memory.

19. The computer system of claim 17, further comprising:

sixth program instructions to, in response to a size of a smaller subspace from said subspaces being smaller than a predetermined value, merge said smaller subspace with a neighboring subspace; and

wherein

said sixth program instructions are stored on said non-transitory computer readable storage medium for execution by said processor via said computer readable memory.

20. The computer system of claim 19, further comprising:

seventh program instructions to identify subspaces that have a size smaller than the predetermined value; and

eighth program instructions to merge the subspaces determined to have the size smaller than the predetermined value with neighboring subspaces, wherein an order of merging subspaces is based on a size of the subspaces to be merged; and

wherein

said seventh and eighth program instructions are stored on said non-transitory computer readable storage medium for execution by said processor via said computer readable memory.