US2014176556A1PendingUtilityA1

Computer-Implemented System and Method For Correcting A Rendering Of Clusters

55
Assignee: FTI TECHNOLOGY LLCPriority: Aug 31, 2001Filed: Dec 16, 2013Published: Jun 26, 2014
Est. expiryAug 31, 2021(expired)· nominal 20-yr term from priority
Inventors:Dan Gallivan
G06T 11/26G06T 11/20G06T 17/00G06T 11/206
55
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A computer-implemented system and method for correcting a rendering of clusters is provided. A pair of clusters is selected within a representation. A span between centers of the clusters is determined. Radii for each of the clusters in the pair is identified. The radii are summed and at least one of the clusters in the pair is moved within the representation when the span exceeds the sum.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A computer-implemented system for correcting a rendering of clusters, comprising:
 a selection module to select a pair of clusters within a representation;   a determination module to determine a span between centers of the clusters;   an identification module to identify radii for each of the clusters in the pair and summing the radii;   an orientation module to move at least one of the clusters in the pair within the representation when the span exceeds the sum; and   a processor to execute the modules.   
     
     
         2 . A system according to  claim 1 , wherein each of the clusters is oriented within the representation at a distance from a common origin. 
     
     
         3 . A system according to  claim 2 , further comprising:
 a representation module to further orient each cluster in the representation at a fixed angle along a common axis drawn through the common origin.   
     
     
         4 . A system according to  claim 2 , wherein the orientation module increases the distance of the at least one cluster by multiplying the distance of that cluster by a variable coefficient. 
     
     
         5 . A system according to  claim 2 , further comprising:
 a coefficient module to identify a fixed coefficient;   a distance determination module to determine a further distance for each of the clusters in the pair by multiplying the identified fixed coefficient by the distance of that cluster from the common origin; and   the orientation module to reorient each of the clusters away from the common origin based on the further determined distance.   
     
     
         6 . A system according to  claim 2 , wherein the span is proportionately increased relative to the reorientation of the clusters. 
     
     
         7 . A system according to  claim 2 , further comprising:
 a representation module to increase the distance of the clusters as a similarity of concepts represented by each cluster decreases.   
     
     
         8 . A system according to  claim 1 , wherein the clusters each comprise a non-circular shape having a convex volume and the center comprises a center of mass. 
     
     
         9 . A system according to  claim 8 , further comprising:
 a segment module to determine a segment from the center of mass to a point along the span drawn between the centers of mass for the pair as the radii for each of the non-circular clusters in the pair.   
     
     
         10 . A system according to  claim 1 , wherein the radii of each cluster signifies a number of documents attracted to that cluster. 
     
     
         11 . A computer-implemented method for correcting a rendering of clusters, comprising the steps of:
 selecting a pair of clusters within a representation;   determining a span between centers of the clusters;   identifying radii for each of the clusters in the pair;   summing the radii; and   moving at least one of the clusters in the pair within the representation when the span exceeds the sum,   wherein the steps are performed on a suitably-programmed computer.   
     
     
         12 . A method according to  claim 11 , wherein each of the clusters is oriented within the representation at a distance from a common origin. 
     
     
         13 . A method according to  claim 12 , further comprising:
 further orienting each cluster in the representation at a fixed angle along a common axis drawn through the common origin.   
     
     
         14 . A method according to  claim 12 , further comprising:
 increasing the distance of the at least one cluster by multiplying the distance of that cluster by a variable coefficient.   
     
     
         15 . A method according to  claim 12 , further comprising:
 identifying a fixed coefficient;   determining a further distance for each of the clusters in the pair by multiplying the identified fixed coefficient by the distance of that cluster from the common origin; and   reorienting each of the clusters away from the common origin based on the further determined distance.   
     
     
         16 . A method according to  claim 12 , further comprising:
 proportionately increasing the span relative to the reorientation of the clusters.   
     
     
         17 . A method according to  claim 12 , further comprising:
 increasing the distance of the clusters as a similarity of concepts represented by each cluster decreases.   
     
     
         18 . A method according to  claim 11 , wherein the clusters each comprise a non-circular shape having a convex volume and the center comprises a center of mass. 
     
     
         19 . A method according to  claim 18 , further comprising:
 determining a segment from the center of mass to a point along the span drawn between the centers of mass for the pair as the radii for each of the non-circular clusters in the pair.   
     
     
         20 . A method according to  claim 11 , wherein the radii of each cluster signifies a number of documents attracted to that cluster.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.