Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberWO2011017152 A4
Publication typeApplication
Application numberPCT/US2010/043506
Publication date3 Jun 2011
Filing date28 Jul 2010
Priority date28 Jul 2009
Also published asCA2773159A1, CA2773159C, CA2773194A1, CA2773194C, CA2773198A1, CA2773198C, CA2773219A1, CA2773219C, CA2773220A1, CA2773220C, CA2773263A1, CA2773263C, CA2773317A1, CA2773317C, CA2773319A1, CA2773319C, EP2460096A2, EP2460097A1, EP2460098A1, EP2460099A1, EP2460100A1, EP2460101A2, EP2460102A2, EP2460103A1, US8515957, US8515958, US8572084, US8635223, US8645378, US8700627, US8713018, US8909647, US9064008, US9165062, US9336303, US9477751, US9542483, US9679049, US20110029525, US20110029526, US20110029527, US20110029529, US20110029530, US20110029531, US20110029532, US20110029536, US20130339275, US20130339360, US20140059048, US20140136539, US20140156564, US20140229478, US20140236947, US20150095337, US20150286957, US20160253408, US20170046617, US20170116325, US20170277998, WO2011017064A2, WO2011017064A3, WO2011017065A1, WO2011017080A1, WO2011017098A1, WO2011017133A2, WO2011017133A3, WO2011017133A4, WO2011017134A1, WO2011017134A4, WO2011017152A2, WO2011017152A3, WO2011017155A1, WO2011017155A4
Publication numberPCT/2010/43506, PCT/US/10/043506, PCT/US/10/43506, PCT/US/2010/043506, PCT/US/2010/43506, PCT/US10/043506, PCT/US10/43506, PCT/US10043506, PCT/US1043506, PCT/US2010/043506, PCT/US2010/43506, PCT/US2010043506, PCT/US201043506, WO 2011/017152 A4, WO 2011017152 A4, WO 2011017152A4, WO-A4-2011017152, WO2011/017152A4, WO2011017152 A4, WO2011017152A4
InventorsWilliam C. Knight, Nicholas I. Nussbaum, John W. Conwell
ApplicantFti Technology Llc
Export CitationBiBTeX, EndNote, RefMan
External Links: Patentscope, Espacenet
Displaying relationships between concepts to provide classification suggestions via nearest neighbor
WO 2011017152 A4
Abstract
A system (11) and method (50) for displaying relationships between concepts (14c, 14d) to provide classification suggestions via nearest neighbor is provided. Reference concepts (14d) previously classified and a set of uncoded concepts (14c) are provided. At least one uncoded concept (14c) is compared with the reference concepts (14d). One or more of the reference concepts (14d) that are similar to the at least one uncoded concept (14c) are identified. Relationships between the at least one uncoded concept (14c) and the similar reference concept (14d) are depicted on a display for classifying the at least one uncoded concept (14c).
Amended Claims  (OCR text may contain errors)
AMENDED CLAIMS
received by the International Bureau on
22 March 2011. 1. A method (50) for displaying relationships between concepts (14c, 14d) to provide classification suggestions via nearest neighbor, comprising:
providing reference concepts (14d) each associated with a
classification code (96) and a set of uncoded concepts (14c), wherein each of the reference concepts (14d) and the uncoded concepts (14c) comprises one or more nouns extracted from a plurality of documents (14a, 17, 20, 26, 29); comparing at least one uncoded concept (14c) with the reference concepts (14d) and identifying one or more of the reference concepts (14d) that are similar to the at least one uncoded concept (14c); and
depicting relationships between the at least one uncoded concept (14c) and the similar reference concepts (14d) for classifying the at least one uncoded concept (14c),
wherein the steps are performed on a suitably programmed computer. 2. A method (50) according to Claim 1, further comprising: classifying the at least one uncoded concept by assigning a classification code (96) based on the relationships between the at least one uncoded concept and the similar reference concepts (14d).
3. A method (50) according to Claim 2, further comprising: adding the classified at least one uncoded concept to the reference concepts (14d).
4. A method (50) according to Claim 2, further comprising: providing a confidence level for the classification code (96) of the at least one uncoded concept.
5. A method (50) according to Claim 2, further comprising: identifying those documents (14a, 17, 20, 26, 29) associated with the classified at least one uncoded concept; and
assigning the classification code (96) for the classified at least one uncoded concept to one or more of the associated documents (14a, 17, 20, 26,
6. A method (50) according to Claim 5, wherein the documents (14a, 17, 20, 26, 29) are identified using a matrix comprising a mapping of concepts and related documents (14a, 17, 20, 26, 29).
7. A method (50) according to Claim 1 , further comprising: generating the reference concepts (14d) 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 (96) to each of the dissimilar concepts, as the reference concepts (14d); and
grouping the set of concepts into clusters (92), selecting one or more of the concepts in at least one cluster, and assigning the classification code (96) to each of the selected concepts, as the reference concepts (14d).
8. A method (50) according to Claim 1 , further comprising: determining the similar reference concepts (14d), 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 (14d); and
selecting the reference concepts (14d) with the highest similarity metrics as the similar reference concepts (14d).
9. A method (50) according to Claim 1 , further comprising: determining the similar reference concepts (14d), comprising:
determining a measure of similarity between the at least one uncoded concept and each of the reference concepts ( 14d) based on the comparison;
applying a threshold to the measures of similarity; and selecting those reference concepts (14d) that satisfy the threshold as the similar reference concepts (14d).
10. A method (50) according to Claim 1 , further comprising: clustering the uncoded concepts (14c) and displaying the clusters (92); and
displaying the similar reference concepts (14d) in a list adjacent to the clusters (92).
11. A system (10) for displaying relationships between concepts to provide classification suggestions via nearest neighbor, comprising:
a database to maintain reference concepts (14d) each associated with a classification code (96) and a set of uncoded concepts (14c), wherein each of the reference concepts (14d) and the uncoded concepts (14c) comprises one or more nouns extracted from a plurality of documents (14a, 17, 20, 26, 29); a similarity module to compare at least one uncoded concept with the reference concepts (14d) and to identify one or more of the reference concepts (1 d) that are similar to the at least one uncoded concept; and
a display to depict relationships between the at least one uncoded concept and the similar reference concepts (14d) for classifying the at least one uncoded concept.
12. A system (10) according to Claim 11, further comprising: a classification module to classify the at least one uncoded concept by assigning a classification code (96) based on the relationships between the at least one uncoded concept and the similar reference concepts (14d).
13. A system (10) according to Claim 12, further comprising: a reference module to add the classified at least one uncoded concept to the reference concepts (14d).
14. A system (10) according to Claim 12, wherein the classification module provides a confidence level for the classification code (96) of the at least one uncoded concept.
15. A system (10) according to Claim 12, further comprising: a document classification module to identify those documents (14a, 17, 20, 26, 29) associated with the classified at least one uncoded concept and to assign the classification code (96) for the classified at least one uncoded concept to one or more of the associated documents (14a, 17, 20, 26, 29).
16. A system (10) according to Claim 15, wherein the documents (14a, 17, 20, 26, 29) are identified using a matrix comprising a mapping of concepts and related documents (14a, 17, 20, 26, 29).
17. A system (10) according to Claim 11, further comprising: a reference set module to generate the reference concepts (14d) 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 (96) to each of the dissimilar concepts, as the reference concepts (14d); and
a reference clustering module to group the set of concepts into one or more clusters (92), to select one or more of the concepts in at least one cluster, and to assign the classification code (96) to each of the selected concepts, as the reference concepts (14d).
18. A system (10) according to Claim 11, further comprising: a concept similarity module to determine the similar reference concepts (14d), 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 (14d) and to select the reference concepts (14d) with the highest similarity metrics as the similar reference concepts (14d).
19. A system (10) according to Claim 11, further comprising: a concept similarity module to determine the similar reference concepts (14d), comprising:
a similarity measurement module to determine a measure of similarity between the at least one uncoded concept and each of the reference concepts (14d) based on the comparison; and a threshold module to apply a threshold to the measures of similarity and to select those reference concepts ( 14d) that satisfy the threshold as the similar reference concepts (14d).
20. A system (10) according to Claim 1 1, further comprising: a clustering module to cluster the uncoded concepts (14c); and the display to present the clusters (92) and the similar reference concepts (14d) in a list adjacent to the clusters (92).
Classifications
International ClassificationG06F17/30
Cooperative ClassificationG06N5/02, G06F17/30601, G06F17/30713, G06F17/30011, G06N5/047, G06F17/30675, G06F17/3064, G06N99/005, G06F17/30707, G06F17/30705, G06N7/005, G06F17/30873, G06F17/3071
European ClassificationG06F17/30T4V
Legal Events
DateCodeEventDescription
30 Mar 2011121Ep: the epo has been informed by wipo that ep was designated in this application
Ref document number: 10740803
Country of ref document: EP
Kind code of ref document: A2
26 Jan 2012WWEWipo information: entry into national phase
Ref document number: 2773319
Country of ref document: CA
26 Jan 2012ENPEntry into the national phase in:
Ref document number: 2773319
Country of ref document: CA
30 Jan 2012NENPNon-entry into the national phase in:
Ref country code: DE