Method and apparatus for interactive evolutionary optimization of concepts
First Claim
Patent Images
1. A method comprising:
- (i) determining, by executing an instruction with a processor, data points associated with components of a graphical user interface;
(ii) determining, by executing an instruction with the processor, a distance between respective ones of the data points and respective ones of the other data points;
(iii) identifying, by executing an instruction with the processor, a presentation format of respective ones of the components of the graphical user interface;
(iv) one of maintaining or modifying, by executing an instruction with the processor, the determination of the distance between the respective ones of the data points and respective ones of the other data points based on the presentation format of the respective components of the graphical user interface;
(v) choosing, by executing an instruction with the processor, a first one of the data points;
(vi) identifying, by executing an instruction with the processor, all of the other data points within a maximum distance of the chosen data point;
(vii) repeating, by executing an instruction with the processor, (v)-(vi) choosing a different one of the data points until all of the data points have been chosen;
(viii) reducing cluster identification bias by identifying, by executing an instruction with the processor, one or more clusters, respective ones of the one or more clusters having a predefined minimum number, K, of data points within a predefined search radius; and
(ix) preventing identification errors of the one or more clusters caused by outlier data points of the data points by analyzing the one or more clusters with respect to K linkages.
10 Assignments
0 Petitions
Accused Products
Abstract
A method includes determining a plurality of data points, determining a distance between each data point and each of the other plurality of data points, choosing a first one of the plurality of data points, identifying all of the other plurality of data points within a maximum distance of the chosen data point, repeating steps the previous steps to choose a different one of the plurality of data points until all of the data points have been chosen, identifying one or more clusters each having a predefined minimum number, K, of data points within a predefined search radius and analyzing the one or more clusters with respect to K linkages.
218 Citations
16 Claims
-
1. A method comprising:
-
(i) determining, by executing an instruction with a processor, data points associated with components of a graphical user interface; (ii) determining, by executing an instruction with the processor, a distance between respective ones of the data points and respective ones of the other data points; (iii) identifying, by executing an instruction with the processor, a presentation format of respective ones of the components of the graphical user interface; (iv) one of maintaining or modifying, by executing an instruction with the processor, the determination of the distance between the respective ones of the data points and respective ones of the other data points based on the presentation format of the respective components of the graphical user interface; (v) choosing, by executing an instruction with the processor, a first one of the data points; (vi) identifying, by executing an instruction with the processor, all of the other data points within a maximum distance of the chosen data point; (vii) repeating, by executing an instruction with the processor, (v)-(vi) choosing a different one of the data points until all of the data points have been chosen; (viii) reducing cluster identification bias by identifying, by executing an instruction with the processor, one or more clusters, respective ones of the one or more clusters having a predefined minimum number, K, of data points within a predefined search radius; and (ix) preventing identification errors of the one or more clusters caused by outlier data points of the data points by analyzing the one or more clusters with respect to K linkages. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A tangible computer readable storage device or storage disk comprising instructions which, when executed, cause a processor to, at least:
-
(i) determine data points associated with components of a graphical user interface; (ii) determine a distance between respective ones of the data points and respective ones of the other data points; (iii) identify a presentation format of respective ones of the components of the graphical user interface; (iv) one of maintain or modify the determination of the distance between the respective ones of the data points and respective ones of the other data points based on the presentation format of the respective components of the graphical user interface; (v) choose a first one of the data points; (vi) identify all of the other data points within a maximum distance of the chosen data point; (vii) repeat (v)-(vi) choosing a different one of the data points until all of the data points have been chosen; (viii) reduce cluster identification bias by identifying one or more clusters, each of the one or more clusters having a predefined minimum number, K, of data points within a predefined search radius; and (ix) analyze the one or more clusters with respect to K linkages to prevent identification errors of the one or more clusters caused by outlier data points of the data points. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
Specification