# US 2019/0156529 A1 · User interface and method based on sliding-scale cluster groups for precise look-alike modeling

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

- Number: US 2019/0156529 A1
- Document ID: US20190156529A1
- Status: Published application
- Kind: A1
- Application number: 15/817,215
- Filed: 2017-11-19
- Published: 2019-05-23
- Earliest claimed: 2017-11-19
- Assignees: Cadreon LLC
- Applicants: Cadreon LLC
- Inventors: Bhupendra Mohanlal Patel; Nilesh Kuchekar; Tushar Patel
- Web page: https://patentgrep.com/patent/US20190156529A1

## CPC

- G06T 11/26: Drawing of charts or graphs
- G06F 3/0481: based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
- G06F 3/04845: for image manipulation, e.g. dragging, rotation, expansion or change of colour
- G06F 3/04847: Interaction techniques to control parameter settings, e.g. interaction with sliders or dials
- G06F 7/026: {Magnitude comparison, i.e. determining the relative order of operands based on their numerical value, e.g. window comparator}
- G06F 7/08: Sorting, i.e. grouping record carriers in numerical or other ordered sequence according to the classification of at least some of the information they carry (by merging two or more sets of carriers in ordered sequence G06F7/16)
- G06F 7/20: Comparing separate sets of record carriers arranged in the same sequence to determine whether at least some of the data in one set is identical with that in the other set or sets
- G06T 11/10: Texturing; Colouring; Generation of textures or colours (retouching, inpainting or scratch removal G06T5/77)
- G06T 2200/24: involving graphical user interfaces [GUIs]
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A graphical user interface showing relevant sliding scale cluster groups having a processor generating a ranking of Top N1 features of the seed dataset in order of frequency of their occurrence. The processor generates another ranking of Top N2 features of the seed dataset in order of frequency of their occurrence in correlation with their equivalent percentage in total dataset. The Top M co-related features is identified for each of the Top N (N1+N2) features that are present for the seed dataset. The processor, for each one in M×N set, generates a sliding scale cluster via permutation of Top M features. The processor sorts each permutation based on closest occurrence match. The Seed Group Meta Bitmap Index is generated for the seed audience segment. For each cluster, the processor calculates the available amplification count from the Total Audience Bitmap Index, until the desired amplification is achieved.

## Claims

### Claim at position 1

1: A computerized method for generating dynamic look-alike data points of seed dataset on a graphical user interface (GUI) comprising:
defining a seed dataset from a collection of data, said collection of data comprising features associated with data;
generating a first ranking of a first set of top features of the seed dataset;
generating a second ranking of a second set of top features of the seed dataset;
identifying a M set of co-related features for each of a combined set N from the first set and the second set that are present for the seed dataset;
for each one in M×N set, generating a sliding scale cluster via permutation of the M set of co-related features to be displayed on the GUI;
generating a seed group meta bitmap index for the seed audience segment;
generating a total audience bitmap index based on the generated seed group meta index; and
for each cluster, generating an available amplification count from the total audience bitmap index for display on the GUI in response to a user instructions received from the GUI until a desired amplification in the available amplification is achieved.

### Claim at position 2 (depends on 1)

2: The computerized method of claim 1, wherein generating the ranking of the first set of top features of the seed dataset based on an order of frequency of their occurrences.

### Claim at position 3 (depends on 1)

3: The computerized method of claim 1, wherein generating the ranking of the second set of top features of the seed dataset based on an order of frequency of their occurrence in correlation with their equivalent percentage in entire collection of data.

### Claim at position 4 (depends on 1)

4: The computerized method of claim 1, wherein generating the sliding scale comprises sorting each permutation based on a closest occurrence match within the seed dataset.

### Claim at position 5 (depends on 1)

5: The computerized method of claim 1, further comprising displaying on the GUI each permutation as one cluster of data.

### Claim at position 6 (depends on 1)

6: The computerized method of claim 1, further comprising identifying intersection counts across each cluster based on the seed map meta bitmap index to be displayed on the GUI.

### Claim at position 7 (depends on 1)

7: The computerized method of claim 1, further comprising displaying each of the clusters with different colors or different shading of colors.

### Claim at position 8

8: A computerized system for generating dynamic look-alike data points of seed dataset on a graphical user interface (GUI) comprising:
a database system for storing a collection of data, said collection of data comprising features associated with data;
wherein the database system defines a seed dataset from a collection of data in response to a user instruction;
a processor configured to execute computer-executable instructions to generate a first ranking of a first set of top features of the seed dataset;
wherein the processor generates a second ranking of a second set of top features of the seed dataset;
wherein the processor identifies a M set of co-related features for each of a combined set N from the first set and the second set that are present for the seed dataset;
for each one in M×N set, wherein the processor generates a sliding scale cluster via permutation of the M set of co-related features to be displayed on the GUI;
wherein the processor generates a seed group meta bitmap index for the seed audience segment;
wherein the processor generates a total audience bitmap index based on the generated seed group meta index;
for each cluster, wherein the processor generates an available amplification count from the total audience bitmap index; and
a display for displaying the available amplification count on the GUI, in response to a user instructions received from the GUI, until a desired amplification in the available amplification is achieved.

### Claim at position 9 (depends on 8)

9: The computerized system of claim 8, wherein the processor generates the first ranking of the first set of top features of the seed dataset based on an order of frequency of their occurrences.

### Claim at position 10 (depends on 8)

10: The computerized system of claim 8, wherein the processor generates the second ranking of the second set of top features of the seed dataset based on an order of frequency of their occurrence in correlation with their equivalent percentage in entire collection of data.

### Claim at position 11 (depends on 8)

11: The computerized system of claim 8, wherein the processor generates the sliding scale comprises wherein the processor sorts each permutation based on a closest occurrence match within the seed dataset.

### Claim at position 12 (depends on 8)

12: The computerized system of claim 8, wherein the display displays on the GUI each permutation as one cluster of data.

### Claim at position 13 (depends on 8)

13: The computerized system of claim 8, wherein the processor identifies intersection counts across each cluster based on the seed map meta bitmap index to be displayed on the GUI.

### Claim at position 14 (depends on 8)

14: The computerized system of claim 8, wherein the display displays each of the clusters with different colors or different shading of colors.

### Claim at position 15

15: A computerized system for generating dynamic look-alike data points of seed dataset on a graphical user interface (GUI) comprising:
a database system for storing a collection of data, said collection of data comprising features associated with data;
wherein the database system defines a seed dataset from a collection of data in response to a user instruction;
a processor configured to execute computer-executable instructions to generate a first ranking of a first set of top features of the seed dataset;
wherein the processor generates a second ranking of a second set of top features of the seed dataset;
wherein the processor identifies a M set of co-related features for each of a combined set N from the first set and the second set that are present for the seed dataset;
for each one in M×N set, wherein the processor generates a sliding scale cluster via permutation of the M set of co-related features to be displayed on the GUI, wherein the GUI defines a first data fields for displaying data values for the sliding scale cluster and wherein the GUI defines a second graphical display area for graphically representing the sliding scale cluster;
wherein the processor generates a seed group meta bitmap index for the seed audience segment;
wherein the processor generates a total audience bitmap index based on the generated seed group meta index;
for each cluster, wherein the processor generates an available amplification count from the total audience bitmap index; and
a display for displaying the available amplification count on the GUI, in response to a user instructions received from the GUI, until a desired amplification in the available amplification is achieved, wherein the display defines a graphical element and a corresponding text element of the available amplification count on the GUI.

### Claim at position 16 (depends on 15)

16: The computerized system of claim 15, wherein the processor generates the first ranking of the first set of top features of the seed dataset based on an order of frequency of their occurrences.

### Claim at position 17 (depends on 15)

17: The computerized system of claim 15, wherein the processor generates the second ranking of the second set of top features of the seed dataset based on an order of frequency of their occurrence in correlation with their equivalent percentage in entire collection of data.

### Claim at position 18 (depends on 15)

18: The computerized system of claim 15, wherein the processor generates the sliding scale comprises wherein the processor sorts each permutation based on a closest occurrence match within the seed dataset.

### Claim at position 19 (depends on 15)

19: The computerized system of claim 15, wherein the display displays on the GUI each permutation as one cluster of data.

### Claim at position 20 (depends on 15)

20: The computerized system of claim 15, wherein the processor identifies intersection counts across each cluster based on the seed map meta bitmap index to be displayed on the GUI.
