US6584220B2 — Three-dimensional display of document set

Claim 1

Independent Claim 111 words

A method for presenting information by relative relationships of content and context of a plurality of documents, wherein the relative relationships are presented in a three-dimensional landscape with the relative size and height of a peak in the landscape representing the relative significance of a relationship of a topic attribute and each one of the documents, comprising the steps of: (a) representing each document as a high dimensional vector; (b) producing a partition set on the plurality of documents, said partition set resulting in a cluster centroid for each of the documents; and (c) projecting each said high dimensional vector and at least one said cluster centroid into a 2-dimensional representation.

Claim 2

Independent Claim 111 words

A method for presenting information by relative relationships of content and context of a plurality of documents, wherein the relative relationships are presented in a three-dimensional landscape with the relative size and height of a peak in the landscape representing the relative significance of a relationship of a topic attribute and each one of the documents, comprising the steps of: (a) representing each document as a high dimensional vector; (b) producing a partition set on the plurality of documents, said partition set resulting in a cluster centroid for each of the documents; and (c) projecting each said high dimensional vector and at least one said cluster centroid into a 2-dimensional representation.

Claim 3

Dependent Claim 36 words

The method of claim 1 , further comprising the steps of: (d) producing a coordinate pair for each document; and (e) displaying coordinate pairs for each document in a scatter plot yielding a Galaxies two-dimensional visualization.

Claim 4

Dependent Claim 28 words

The method of claim 2 , further comprising the step of: (f) producing a three-dimensional representation of said coordinate pairs, said three-dimensional representation resulting in a thematic landscape.

Claim 5

Dependent Claim 55 words

The method of claim 3 , wherein step (f) comprises the steps of: (1) receiving an n-dimensional context vector for each document from a text engine; (2) clustering each document in n-dimensional space, thereby producing a cluster for each document; and (3) receiving from a text engine, for said cluster, associated gisting terms or topics.

Claim 6

Dependent Claim 22 words

The method of claim 1 , further comprising the step of: (d) initially inputting each of the documents into a text engine.

Claim 7

Dependent Claim 33 words

The method of claim 1 , wherein stop (b) comprises the step of creating a cluster centroid by grouping said high dimensionality vectors for a plurality of documents in a high dimensional space.

Claim 8

Dependent Claim 32 words

The method of claim 1 , wherein step (b) comprises the step of applying a clustering algorithm with primary emphasis on k-means and complete linkage hierarchical clustering to create a cluster centroid.

Claim 9

Dependent Claim 100 words

The method of claim 7 , wherein said step of creating said cluster centroid is known as Fast Divisive Clustering and comprises the steps of: (i) selecting a number of seeds; (ii) placing said seeds in hyperspace by sampling regions to ensure a specified distribution of seeds; (iii) identifying non-overlapping hyperspheres for each cluster and assigning each document to said each cluster based on which hypersphere said document is located; (iv) calculating a centroid coordinate, representing the center of the mass for each cluster; and (v) repeating steps (iii) and (iv) until centroid movement is less than a specified threshold.

Claim 10

Dependent Claim 67 words

The method of claim 1 , wherein step (c) comprises, for small data sets, the steps of: (1) applying a Multi-dimensional Scaling Algorithm to cluster centroid coordinates in hyperspace; (2) producing a vector for each document with distance measures from said document to each cluster centroid; and (3) constructing an operator matrix and multiplying said matrix by said vector to produce two-dimensional coordinates for said each document.

Claim 11

Dependent Claim 68 words

The method of claim 1 , wherein step (c) comprises, for large data sets, the steps of: (1) applying an Anchored Least Stress Algorithm to cluster centroid coordinates in hyperspace; (2) producing a vector for each document with distance measures from said document to each cluster centroid; and (3) constructing an operator matrix and multiplying said matrix by said vector to produce two-dimensional coordinates for said each document.

Claim 12

Independent Claim 93 words

A method for representing human comprehensible information in a low-dimensionality space based on a high dimensionality analysis thereof, the information comprising sets of semantic information, comprising the steps of: (a) representing the sets of semantic information as a vector in a high-dimensional information space; (b) segmenting the information space into a plurality or bounded continuous sub-spaces, each having a centroid; (c) projecting the segmented bounded continuous subspaces of the high-dimensional information space onto a low dimensional space, in a manner sensitive to a relation of each set of semantic information to each centroid.

Claim 13

Independent Claim 93 words

A method for representing human comprehensible information in a low-dimensionality space based on a high dimensionality analysis thereof, the information comprising sets of semantic information, comprising the steps of: (a) representing the sets of semantic information as a vector in a high-dimensional information space; (b) segmenting the information space into a plurality or bounded continuous sub-spaces, each having a centroid; (c) projecting the segmented bounded continuous subspaces of the high-dimensional information space onto a low dimensional space, in a manner sensitive to a relation of each set of semantic information to each centroid.

Claim 14

Dependent Claim 29 words

The method of claim 11 , further comprising the steps of producing a low dimensionality coordinate for each document and outputting the low dimensionality coordinate as a graphic image.

Claim 15

Dependent Claim 24 words

The method according to claim 11 , wherein said projection is presented as a two dimensional image representing a third dimension as a landscape.

Claim 16

Dependent Claim 28 words

The method according to claim 11 , wherein said high dimensionality is defined by a semantic analysis and said low dimensionality is defined by a human perceptual analysis.

Claim 17

Dependent Claim 16 words

The method according to claim 11 , wherein each bounded continuous sub-space is a non-overlapping hypersphere.

Claim 18

Dependent Claim 22 words

The method according to claim 11 , wherein said plurality of bounded continuous sub-space are defined iteratively to approach an optimum condition.

Claim 19

Dependent Claim 28 words

The method according to claim 11 , wherein said plurality of bounded continuous sub-space are defined iteratively to approach an optimum condition using an Anchored Least Stress Algorithm.

Claim 20

Dependent Claim 35 words

The method according to claim 11 , wherein said projecting comprises producing a vector relationship of each set of semantic information with a respective centroid and multiplying an operator matrix by said respective vector relationships.

Claim 21

Dependent Claim 41 words

The method according to claim 11 , further comprising the steps of receiving a user input semantically defining said sets of semantic information and producing a graphic output representing a relationship of said sets of semantic information and said user input.

Claim 22

Dependent Claim 41 words

The method according to claim 11 , further comprising the steps of receiving a natural language query defining said sets of semantic information; producing a visual graphic output representing a relationship of said sets of semantic information and said user input.

Claim 23

Dependent Claim 45 words

The method according to claim 11 , further comprising the step of producing a visual graphic output representing a relationship of said sets of semantic information and said centroids, and inferring a content of a set of semantic information in dependence on said graphic output.

Claim 24

Dependent Claim 60 words

The method according to claim 11 , further comprising the step of producing a visual graphic output representing a relationship of said sets of semantic information and said centroids, wherein sets of semantic information are represented on a surface, an elevation of said surface representing a density of said sets of semantic information in a local region of said surface.

Claim 25

Dependent Claim 109 words

A computer readable medium storing program instructions for programming a general purpose computer to perform a method for representing human comprehensible information in a low-dimensionality space based on a high dimensionality analysis thereof, the information comprising sets of semantic information, comprising the steps of: (a) representing the sets of semantic information as a vector in a high-dimensional information space; (b) segmenting the information space into a plurality of bounded continuous sub-spaces, each having a centroid; (c) projecting the segmented bounded continuous subspaces of the high-dimensional information space onto a low dimensional space, wherein said projection is sensitive to a relation of each set of semantic information to each centroid.

Claim 26

Dependent Claim 109 words

A computer readable medium storing program instructions for programming a general purpose computer to perform a method for representing human comprehensible information in a low-dimensionality space based on a high dimensionality analysis thereof, the information comprising sets of semantic information, comprising the steps of: (a) representing the sets of semantic information as a vector in a high-dimensional information space; (b) segmenting the information space into a plurality of bounded continuous sub-spaces, each having a centroid; (c) projecting the segmented bounded continuous subspaces of the high-dimensional information space onto a low dimensional space, wherein said projection is sensitive to a relation of each set of semantic information to each centroid.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2006-06-23	2006-12-23	2007-06-24	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2010-06-23	2010-12-23	2011-06-24	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2014-06-23	2014-12-23	2015-06-24	$7700.00	Window Closed / Lapsed

Three-dimensional display of document set

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag