Back to results
US 12,731,301 B2Granted
Stable and discernable mapping of categorical data to colors for graphical display
AssigneeCrowdStrike, Inc.
InventorSøren Skovsbøll
Life of this patent
Estimating the term…
Abstract
Data is received. Each datum therein has one of a plurality of categorical values associated with a categorical variable. Each datum is deterministically mapped to a respective one of a plurality of colors in a color space based on its categorical value. The color to which each datum is deterministically mapped is then transformed to yield a minimum threshold separation between the respective colors. A graphical representation comprising the color to which each datum is respectively deterministically mapped, and as transformed to yield the minimum threshold separation between the respective colors, is displayed.
Claims17
A computer-implemented method, comprising:
- repeatedly receiving data, in which each datum therein has one of a plurality of categorical values associated with a categorical variable;
- for each and every repetition of receiving data:
- always mapping the categorical value in each datum therein to a respective, same, unique one of a plurality of colors in a color space, hereinafter the “respective, same, unique color to which the categorical value in each datum is always mapped”, by:
- providing at least a portion of the categorical value in each datum as a hash key to a same hashing function that is used for the each and every repetition of receiving data;
- generating via the same hashing function a hash value based on the hash key;
- and
- mapping the hash value to a respective, unique, one of a plurality of colors in a color space;
- and
- transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors;
- and
- displaying a graphical representation of the data, the graphical representation comprising the respective, same, unique, color to which the categorical value in each datum is always mapped and as transformed to yield the minimum threshold separation between the respective colors.
8 more elements
A computing system, comprising:
- one or more processors;
- memory storing computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
- repeatedly receiving data, in which each datum therein has one of a plurality of categorical values associated with a categorical variable;
- for each and every repetition of receiving data:
- always mapping the categorical value in each datum therein to a respective, same, unique one of a plurality of colors in a color space, hereinafter the “respective, same, unique color to which the categorical value in each datum is always mapped”, by:
- providing at least a portion of the categorical value in each datum as a hash key to a same hashing function that is used for the each and every repetition of receiving data;
- generating via the same hashing function a hash value based on the hash key;
- and
- mapping the hash value to a respective, unique, one of a plurality of colors in a color space;
- and
- transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors;
- and
- displaying a graphical representation of the data, the graphical representation comprising the respective, same, unique color to which the categorical value in each datum is always mapped and as transformed to yield the minimum threshold separation between the respective colors.
10 more elements
One or more non-transitory computer-readable media storing computer-executable instructions for an event query host that, when executed by one or more processors, cause the one or more processors to perform operations comprising:
- repeatedly receiving data, in which each datum therein has one of a plurality of categorical values associated with a categorical variable;
- for each and every repetition of receiving data:
- always mapping the categorical value in each datum therein to a respective, same, unique one of a plurality of colors in a color space, hereinafter the “respective, same, unique color to which the categorical value is each datum is always mapped”, by:
- providing at least a portion of the categorical value in each datum as a hash key to a same hashing function that is used for the each and every repetition of receiving data;
- generating via the same hashing function a hash value based on the hash key;
- and
- mapping the hash value to a respective, unique, one of a plurality of colors in a color space;
- and
- transforming the respective, same, unique color to which the categorical value in each datum is always mapped to yield a minimum threshold separation between the respective colors;
- and
- displaying a graphical representation of the data, the graphical representation comprising the respective, same, unique color to which the categorical value in each datum is respectively always mapped and as transformed to yield the minimum threshold separation between the respective colors.
8 more elements
Dependencies are inferred from the claim text.