Computer-implemented system and method for grafting cluster spines

• US 9,342,909 B2
• Filed: 01/12/2015
• Issued: 05/17/2016
• Est. Priority Date: 02/13/2004
• Status: Expired due to Term

• Current Assignee: Nuix North America Inc. (Nuix Ltd.)
• Original Assignee: FTI Consulting Technology LLC (FTI Consulting Incorporated)
• Inventors: Evans, Lynne Marie
• Primary Examiner(s): LEROUX, ETIENNE PIERRE
• Application Number:
  US14/595,144
• Publication Number:
  US 20150127651A1
• Time in Patent Office: 491 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/287 Visualization; Browsing
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/35 Clustering; Classification
• CPC Class Codes: G06F 16/355 Class or cluster creation or modification
• CPC Class Codes: G06F 16/358 Browsing; Visualisation therefor
• CPC Class Codes: G06F 16/93 Document management systems
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 18/00 Pattern recognition
• CPC Class Codes: G06F 18/23 Clustering techniques
• CPC Class Codes: G06T 11/20 Drawing from basic elements, e.g. lines or circles
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs
• CPC Class Codes: G06T 11/60 Editing figures and text; Combining figures or text
• CPC Class Codes: G06T 2200/32 involving image mosaicing
• CPC Class Codes: G06V 30/416 Extracting the logical structure, e.g. chapters, sections or page numbers; Identifying elements of the document, e.g. authors
• CPC Class Codes: H05K 999/99 dummy group
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

A computer-implemented system and method for grafting cluster spines is provided. Cluster spines, each having two or more clusters of documents, are obtained. A score vector is generated for each of the cluster spines based on the documents within the clusters for that spine. The score vectors of the cluster spines are compared. Those cluster spines that are sufficiently dissimilar from the other cluster spines based on the comparison are placed into a display. At least one remaining cluster spine is grafted onto one of the displayed spines such that no overlap of the placed spine and the remaining spine occurs.

Claims

1. A computer-implemented system for grafting cluster spines, comprising:

a spine module to obtain cluster spines, each cluster spine comprising two or more clusters of documents;

a vector module to generate a score vector for each of the cluster spines based on the documents within the clusters for that spine;

a comparison module to compare the score vectors of the cluster spines;

a placement module to place in a display those cluster spines that are sufficiently dissimilar from the other cluster spines based on the comparison; and

a grafting module to graft at least one remaining cluster spine onto one of the displayed spines such that no overlap of the placed spine and the remaining spine occurs.

2. A system according to claim 1, further comprising:

an anchor point module to identify an anchor point on the displayed spine and to place the remaining cluster spine on the displayed spine at the anchor point.

3. A system according to claim 1, wherein the anchor point is formed along an open edge of the displayed spine at an intersection of a vector drawn from a center of the displayed spine.

4. A system according to claim 1, further comprising:

an angle determination module to determine one or more angles from the displayed spine and to identify one of the angles as a primary angle; and

an spine placement module to place the remaining cluster spine along the primary angle.

5. A system according to claim 4, further comprising:

an overlap module to determine that overlap occurs between the remaining cluster spine and the displayed spine and to move the remaining cluster spine away from the display spine along the primary angle.

6. A system according to claim 5, wherein the remaining cluster spine is moved a distance equal to a diameter of an end cluster on the placed remaining cluster spine.

7. A system according to claim 5, wherein the overlap comprises more than 10% overlap between the placed remaining cluster spine and the displayed spine.

8. A system according to claim 1, further comprising:

a spine formation module to form each cluster spine, comprising;

a concept selection module to select a cluster concept from a set of concepts; and

a spine designation module to identify as the formed cluster spine, the clusters of documents that include the selected cluster concept.

9. A system according to claim 8, wherein the set of concepts comprises at least one of concepts identified from the clusters of documents and concepts provided by one or more users.

10. A system according to claim 9, further comprising:

a concept determination module to determine the concepts, comprising;

a document scoring module to determine document scores for each document within each cluster of documents;

a score summation module to sum the document scores for each cluster of documents;

a concept removal module to remove all concepts that are not contained in a minimum of two documents; and

a concept designation module to designate all remaining concepts as the set of concepts.

11. A computer-implemented method for grafting cluster spines, comprising:

obtaining cluster spines, each cluster spine comprising two or more clusters of documents;

generating a score vector for each of the cluster spines based on the documents within the clusters for that spine;

comparing the score vectors of the cluster spines;

placing in a display those cluster spines that are sufficiently dissimilar from the other cluster spines based on the comparison; and

grafting at least one remaining cluster spine onto one of the displayed spines such that no overlap of the placed spine and the remaining spine occurs.

12. A method according to claim 11, further comprising:

identifying an anchor point on the displayed spine; and

placing the remaining cluster spine on the displayed spine at the anchor point.

13. A method according to claim 11, wherein the anchor point is formed along an open edge of the displayed spine at an intersection of a vector drawn from a center of the displayed spine.

14. A method according to claim 11, further comprising:

determining one or more angles from the displayed spine;

identifying one of the angles as a primary angle; and

placing the remaining cluster spine along the primary angle.

15. A method according to claim 14, further comprising:

determining that overlap occurs between the remaining cluster spine and the displayed spine; and

moving the remaining cluster spine away from the display spine along the primary angle.

16. A method according to claim 15, wherein the remaining cluster spine is moved a distance equal to a diameter of an end cluster on the placed remaining cluster spine.

17. A method according to claim 15, wherein the overlap comprises more than 10% overlap between the placed remaining cluster spine and the displayed spine.

18. A method according to claim 11, further comprising:

forming each cluster spine, comprising;

selecting a cluster concept from a set of concepts; and

identifying as the formed cluster spine, the clusters of documents that include the selected cluster concept.

19. A method according to claim 18, wherein the set of concepts comprises at least one of concepts identified from the clusters of documents and concepts provided by one or more users.

20. A method according to claim 19, further comprising:

determining the concepts, comprising;

determining document scores for each document within each cluster of documents;

summing the document scores for each cluster of documents;

removing all concepts that are not contained in a minimum of two documents; and

designating all remaining concepts as the set of concepts.