Latent semantic taxonomy generation

• US 20060242190A1
• Filed: 05/11/2006
• Published: 10/26/2006
• Est. Priority Date: 04/26/2005
• Status: Abandoned Application

• Current Assignee: Content Analyst Company, LLC (Relativity ODA LLC)
• Original Assignee: Content Analyst Company, LLC (Relativity ODA LLC)
• Inventors: Wnek, Janusz
• Application Number:
  US11/431,634
• Publication Number:
  US 20060242190A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/355 Class or cluster creation or modification
• CPC Class Codes: G06F 16/367 Ontology

Abstract

A method for automatically constructing a taxonomy for a collection of documents. For a given collection of documents, a method in accordance with an embodiment of the present invention creates document clusters, assigns taxons (titles) to the clusters, and organizes the clusters in a hierarchy. The clusters in the hierarchy are ordered from general to specific in the depth of the hierarchy, and from most similar to least similar in the breadth of the hierarchy. This method is capable of producing meaningful classifications in a short time.

Claims

1. A computer-based method for automatically constructing a taxonomy for a collection of documents, comprising:

(a) generating a representation of each document in the collection of documents in a conceptual representation space;

(b) identifying a set of document clusters in the collection of documents based on a conceptual similarity among the representations of the documents; and

(c) generating a taxon for a document cluster in the set of document clusters based on at least one of (i) a term in a document of at least one of the document clusters, or (ii) a term represented in the conceptual representation space.

2. The method of claim 1, wherein step (a) comprises:

generating a latent semantic indexing (LSI) space based on the collection of documents, wherein each document in the collection of documents has a vector representation in the LSI space.

3. The method of claim 1, wherein step (b) comprises:

identifying a set of exemplary documents in the collection of documents; and

identifying the set of document clusters based on the set of exemplary documents.

4. The method of claim 1, wherein step (b) comprises:

identifying a set of document clusters in the collection of documents based on a conceptual similarity among the representations of the documents, wherein the documents in each document cluster are sorted based on a similarity measurement, and wherein the document clusters are sorted based on a number of documents included in each document cluster.

5. The method of claim 1, wherein step (c) comprises:

(c1) identifying candidate terms for a document cluster in the set of document clusters;

(c2) selecting a subset of the candidate terms for the document cluster based on an evaluation scheme; and

(c3) generating a taxon for the document cluster based on the subset of candidate terms.

6. The method of claim 5, wherein step (c1) comprises:

identifying candidate terms for a document cluster in the set of document clusters based on a frequency of occurrence of distinct terms contained in at least one document of the document cluster.

7. The method of claim 5, wherein step (c1) comprises:

generating a representation for a document cluster in the set of document clusters in the conceptual representation space;

computing a similarity measure between the representation of the document cluster and the representation of each term represented in the conceptual representation space; and

identifying candidate terms for the document cluster based on the similarity measure.

8. The method of claim 5, wherein each document cluster includes distinct terms, and wherein step (c2) comprises:

selecting a candidate term as a member of the subset of the candidate terms of the document cluster if a similarity measure between a representation of the document cluster and a representation of the candidate term is above a similarity-threshold.

9. The method of claim 5, wherein step (c2) comprises:

selecting a subset of the candidate terms of the document cluster based on a number of generalized entities in the candidate terms of the document cluster.

10. The method of claim 5, wherein step (c2) comprises:

selecting a subset of the candidate terms for the document cluster based on a comparison of the frequency of occurrence of a candidate term in the document cluster to the frequency of occurrence of the candidate term in the other document clusters in the set of document clusters.

11. The method of claim 5, wherein step (c3) comprises:

generating a taxon for the document cluster based on an overlap between the candidate terms in the subset of candidate terms.

12. A computer program product comprising a computer usable medium having computer readable program code stored therein that causes an application program for automatically constructing a taxonomy for a collection of documents to execute on an operating system of a computer, the computer readable program code comprising:

computer readable first program code that causes the computer to generate a representation of each document in the collection of documents in a conceptual representation space;

computer readable second program code that causes the computer to identify a set of document clusters in the collection of documents based on a conceptual similarity among the representations of the documents; and

computer readable third program code that causes the computer to generate a taxon for a document cluster in the set of document clusters based on at least one of (i) a term in a document of at least one of the document clusters, or (ii) a term represented in the conceptual representation space.

13. The computer program product of claim 12, wherein the computer readable first program code comprises:

code that causes the computer to generate a latent semantic indexing (LSI) space based on the collection of documents, wherein each document in the collection of documents has a vector representation in the LSI space.

14. The computer program product of claim 12, wherein the computer readable second program code comprises:

code that causes the computer to identify a set of exemplary documents in the collection of documents; and

code that causes the computer to identify the set of document clusters based on the set of exemplary documents.

15. The computer program product of claim 12, wherein the computer readable second program code comprises:

code that causes the computer to identify a set of document clusters in the collection of documents based on a conceptual similarity among the representations of the documents, wherein the documents in each document cluster are sorted based on a similarity measurement, and wherein the document clusters are sorted based on a number of documents included in each document cluster.

16. The computer program product of claim 12, wherein the computer readable third program code comprises:

computer readable fourth program code that causes the computer to identify candidate terms for a document cluster in the set of document clusters;

computer readable fifth program code that causes the computer to select a subset of the candidate terms for the document cluster based on an evaluation scheme; and

computer readable sixth program code that causes the computer to generate a taxon for the document cluster based on the subset of candidate terms.

17. The computer program product of claim 16, wherein the computer readable fourth program code comprises:

code that causes the computer to identify candidate terms for a document cluster in the set of document clusters based on a frequency of occurrence of distinct terms contained in at least one document of the document cluster.

18. The computer program product of claim 16, wherein the computer readable fourth program code comprises:

code that causes the computer to generate a representation for a document cluster in the set of document clusters in the conceptual representation space;

code that causes the computer to compute a similarity measure between the representation of the document cluster and the representation of each term represented in the conceptual representation space; and

code that causes the computer to identify candidate terms for the document cluster based on the similarity measure.

19. The computer program product of claim 16, wherein each document cluster includes distinct terms, and wherein the computer readable fifth program code comprises:

code that causes the computer to select a candidate term as a member of the subset of the candidate terms of the document cluster if a similarity measure between a representation of the document cluster and a representation of the candidate term is above a similarity-threshold.

20. The computer program product of claim 16, wherein the computer readable fifth program code comprises:

code that causes the computer to select a subset of the candidate terms of the document cluster based on a number of generalized entities in the candidate terms of the document cluster.

21. The computer program product of claim 16, wherein the computer readable fifth program code comprises:

code that causes the computer to select a subset of the candidate terms for the document cluster based on a comparison of the frequency of occurrence of a candidate term in the document cluster to the frequency of occurrence of the candidate term in the other document clusters in the set of document clusters.

22. The computer program product of claim 16, wherein the computer readable sixth program code comprises:

code that causes the computer to generate a taxon for the document cluster based on an overlap between the candidate terms in the subset of candidate terms.