ARRANGING CONCEPT CLUSTERS IN THEMATIC NEIGHBORHOOD RELATIONSHIPS IN A TWO-DIMENSIONAL DISPLAY

摘要

A set of clusters (50) is selected from a concept space including clusters(50) with concepts (53) extracted to visualize document content (49). A themeis identified in each of the clusters (50). Each theme includes a conceptranked within the cluster (50). Unique candidate spines (55) includingclusters (50) sharing at least one common theme are logically formed. Theclusters (50) are assigned to one such candidate spine (55) having asubstantially best fit. Each best fit candidate spine (56) sufficiently uniquefrom other best fit candidate spines (56) are identified, and placed in avisual display space (43). A similarity between each non-identified candidatespine (56) and each placed candidate spine (56) is evaluated. Each non-identified candidate spine (56) is placed in the display (43) relative to ananchor cluster (60) on the placed candidate spine (56) that is sufficientlysimilar to the non-identified candidate spine (56).