IP Library Granted Patent US 8,645,378
Granted Patent B2
US 8,645,378 · App. 12/844,813 · Granted Feb 4, 2014

System and method for displaying relationships between concepts to provide classification suggestions via nearest neighbor

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,645,378
App. No.
12/844,813
Granted
Feb 4, 2014
Kind
B2
Abstract

A system and method for displaying relationships between concepts to provide classification suggestions via nearest neighbor is provided. Reference concepts previously classified and a set of uncoded concepts are provided. At least one uncoded concept is compared with the reference concepts. One or more of the reference concepts that are similar to the at least one uncoded concept are identified. Relationships between the at least one uncoded concept and the similar reference concept are depicted on a display for classifying the at least one uncoded concept.

Claims (70)

1. A method for displaying relationships between concepts to provide classification suggestions via nearest neighbor, comprising the steps of:

providing reference concepts each associated with a classification code and a set of uncoded concepts, wherein each of the reference concepts and the uncoded concepts comprises one or more nouns extracted from a plurality of documents;

associating each reference concept with a symbol representing the classification code;

comparing at least one uncoded concept with the reference concepts and identifying one or more of the reference concepts that are similar to the at least one uncoded concept;

displaying relationships between the at least one uncoded concept and the similar reference concepts for classifying the at least one uncoded concept based on the classification symbols of the similar reference concepts comprising at least one of:

displaying one or more of a presence and absence of the similar reference concepts with different classification codes; and

displaying a quantity of the similar reference concepts for each of the different classification codes;

providing at least one visual classification suggestion based on the displayed relationships; and

receiving a classification code for the at least one uncoded concept from a human reviewer based on the at least one suggestion,

wherein the steps are performed on a suitably programmed computer.

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

classifying the at least one uncoded concept by assigning a classification code based on the relationships between the at least one uncoded concept and the similar reference concepts.

3. A method according to claim 2 , further comprising:

adding the classified at least one uncoded concept to the reference concepts.

4. A method according to claim 2 , further comprising:

providing a confidence level for the classification code of the at least one uncoded concept.

5. A method according to claim 2 , further comprising:

identifying the documents associated with the at least one classified concept; and

assigning the classification code for the at least one classified concept to one or more of the associated documents.

6. A method according to claim 5 , wherein the documents are identified using a matrix comprising a mapping of concepts and related documents.

7. A method according to claim 1 , further comprising:

generating the reference concepts from a set of concepts, comprising at least one of:

identifying the concepts that are dissimilar from each other concept in the set of concepts and assigning the classification code to each of the dissimilar concepts, as the reference concepts; and

grouping the set of concepts into clusters, selecting one or more of the concepts in at least one cluster, and assigning the classification code to each of the selected concepts, as the reference concepts.

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

determining the similar reference concepts, comprising:

forming a score vector for each uncoded concept and each reference concept; and

calculating a similarity metric by comparing the score vectors for the at least one uncoded concept and each of the reference concepts; and

selecting the reference concepts with the highest similarity metrics as the similar reference concepts.

9. A method according to claim 1 , further comprising:

determining the similar reference concepts, comprising:

determining a measure of similarity between the at least one uncoded concept and each of the reference concepts based on the comparison;

applying a threshold to the measures of similarity; and

selecting those reference concepts that satisfy the threshold as the similar reference concepts.

10. A method according to claim 1 , further comprising:

clustering the uncoded concepts and displaying the clusters; and

displaying the similar reference concepts in a list adjacent to the clusters.

11. A system for displaying relationships between concepts to provide classification suggestions via nearest neighbor, comprising:

a database to maintain reference concepts each associated with a classification code and a set of uncoded concepts, wherein each of the reference concepts and the uncoded concepts comprises one or more nouns extracted from a plurality of documents;

an association module to associate each reference concept with a symbol representing the classification code;

a similarity module to compare at least one uncoded concept with the reference concepts and to identify one or more of the reference concepts that are similar to the at least one uncoded concept;

a display to display relationships between the at least one uncoded concept and the similar reference concepts for classifying the at least one uncoded concept based on the classification symbols of the similar reference concepts comprising at least one of:

a presence module to display one or more of a presence and absence of the similar reference concepts with different classification codes; and

a quantity module to display a quantity of the similar reference concepts for each of the different classification codes;

a suggestion module to provide at least one visual classification suggestion based on the displayed relationships;

a classification module to receive a classification code for the at least one uncoded concept from a human reviewer based on the at least one suggestion; and

a computer processor to execute the modules.

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

a classification module to classify the at least one uncoded concept by assigning a classification code based on the relationships between the at least one uncoded concept and the similar reference concepts.

13. A system according to claim 12 , further comprising:

a reference module to add the classified at least one uncoded concept to the reference concepts.

14. A system according to claim 12 , wherein the classification module provides a confidence level for the classification code of the at least one uncoded concept.

15. A system according to claim 12 , further comprising:

a document classification module to identify the documents associated with the at least one classified concept and to assign the classification code for the at least one classified concept to one or more of the associated documents.

16. A system according to claim 15 , wherein the documents are identified using a matrix comprising a mapping of concepts and related documents.

17. A system according to claim 11 , further comprising:

a reference set module to generate the reference concepts from a set of concepts, comprising at least one of:

a comparison module to identify the concepts that are dissimilar from each other concept in the concept set and to assign the classification code to each of the dissimilar concepts, as the reference concepts; and

a reference clustering module to group the set of concepts into one or more clusters, to select one or more of the concepts in at least one cluster, and to assign the classification code to each of the selected concepts, as the reference concepts.

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

a concept similarity module to determine the similar reference concepts, comprising:

a vector module to form a score vector for each uncoded concept and each reference concept; and

a similarity measurement module to calculate a similarity metric by comparing the score vectors for the at least one uncoded concept and each of the reference concepts and to select the reference concepts with the highest similarity metrics as the similar reference concepts.

19. A system according to claim 11 , further comprising:

a concept similarity module to determine the similar reference concepts, comprising:

a similarity measurement module to determine a measure of similarity between the at least one uncoded concept and each of the reference concepts based on the comparison; and

a threshold module to apply a threshold to the measures of similarity and to select those reference concepts that satisfy the threshold as the similar reference concepts.

20. A system according to claim 11 , further comprising:

a clustering module to cluster the uncoded concepts; and

the display to present the clusters and the similar reference concepts in a list adjacent to the clusters.

Assignments (11)
SECURITY INTEREST Recorded Apr 4, 2024
From: NUIX NORTH AMERICA INC.
To: THE HONGKONG AND SHANGHAI BANKING CORPORATION LIMITED, SYDNEY BRANCH, AS SECURED PARTY
Reel/Frame 067005/0073 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 31, 2020
From: FTI CONSULTING TECHNOLOGY LLC
To: NUIX NORTH AMERICA INC.
Reel/Frame 051679/0287 →
CHANGE OF NAME Recorded Jan 31, 2020
From: FTI TECHNOLOGY LLC
To: FTI CONSULTING TECHNOLOGY LLC
Reel/Frame 051765/0048 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 15, 2018
From: FTI CONSULTING, INC.
To: NUIX NORTH AMERICA INC.
Reel/Frame 047163/0584 →
RELEASE OF SECURITY INTEREST IN PATENT RIGHTS AT REEL/FRAME 036031/0637 Recorded Sep 12, 2018
From: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
To: FTI CONSULTING, INC.
Reel/Frame 047060/0137 →
RELEASE OF SECURITY INTEREST IN PATENT RIGHTS Recorded Jun 29, 2015
From: BANK OF AMERICA, N.A.
To: FTI CONSULTING, INC.; FTI CONSULTING TECHNOLOGY LLC
Reel/Frame 036029/0233 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Jun 29, 2015
From: FTI CONSULTING, INC.; FTI CONSULTING TECHNOLOGY LLC; FTI CONSULTING TECHNOLOGY SOFTWARE CORP
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 036031/0637 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 16, 2014
From: KNIGHT, WILLIAM C.; NUSSBAUM, NICHOLAS I.; CONWELL, JOHN W.
To: FTI TECHNOLOGY LLC
Reel/Frame 032918/0341 →
RELEASE OF SECURITY INTEREST IN PATENTS Recorded Dec 11, 2012
From: BANK OF AMERICA, N.A.
To: FTI CONSULTING, INC.; FTI TECHNOLOGY LLC; ATTENEX CORPORATION
Reel/Frame 029449/0389 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Dec 10, 2012
From: FTI CONSULTING, INC.; FTI CONSULTING TECHNOLOGY LLC
To: BANK OF AMERICA, N.A.
Reel/Frame 029434/0087 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Mar 14, 2011
From: FTI CONSULTING, INC.; FTI TECHNOLOGY LLC; ATTENEX CORPORATION
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 025943/0038 →