Granted Patent B1

US 10,311,087 · App. 15/072,384 · Granted Jun 4, 2019

Abstract

Claims (74)

1. A computer-implemented method for determining topics of data artifacts, at least a portion of the method being performed by a computing device comprising at least one processor, the method comprising:

extracting at least one initial keyword from a data artifact with an unknown topic;

creating a set of keywords by generating a plurality of contextually relevant keywords

related to the initial keyword and combining the initial keyword with the contextually relevant keywords to form the set of keywords;

retrieving, from a topic processor, a plurality of lists of topics, wherein each list of topics describes each keyword within the set of keywords, wherein each list of topics has a corresponding frequency in a topic frequency table;

generating a frequency distribution graph from the retrieved topic lists based on the topic frequency table; and

generating, based on the frequency, an ordered list of probable topics of the data artifact by selecting topics in the topic lists falling within the middle of the graph such that the topic with the highest frequency and the topic with the lowest frequency are not included in the ordered list of probable topics.

2. The computer-implemented method of claim 1 , further comprising generating, at the topic processor, the list of topics by:

identifying a topic hierarchy for a topic;

creating a suffix index for the topic by, for each element in the topic hierarchy: designating the element as a key;

copying each element that is above the element in the topic hierarchy into a topic space indexed on the key;

retrieving a subset of the elements in the topic space of at least one key in the suffix index;

designating the retrieved subset as the list of topics.

3. The computer-implemented method of claim 2 , wherein:

creating the suffix index comprises designating, for each element in the topic space of each key, a depth level of the element;

retrieving the subset of the elements in the topic space of the at least one key in the suffix index comprises:

receiving a requested depth level as input;

composing the subset exclusively of elements with a depth level equal to the requested depth level.

4. The computer-implemented method of claim 1 , wherein generating the plurality of contextually relevant keywords comprises retrieving at least one keyword from at least one predetermined external source of contextually relevant keywords.

5. The computer-implemented method of claim 1 , wherein:

the data artifact comprises a plurality of documents;

extracting the least one initial keyword from the data artifact comprises:

summarizing the plurality of documents into a concise summary that is smaller in length than the total length of the plurality of documents;

extracting the at least one initial keyword from the concise summary.

6. A system for determining topics of data artifacts, the system comprising:

an extraction module, stored in memory, that extracts at least one initial keyword from a data artifact with an unknown topic;

a creation module, stored in memory, that creates a set of keywords by generating a plurality of contextually relevant keywords related to the initial keyword and combining the initial keyword with the contextually relevant keywords to form the set of keywords;

a retrieval module, stored in memory, that retrieves, from a topic processor, a plurality of lists of topics, wherein each list of topics describes each keyword within the set of keywords, wherein each list of topics has a corresponding frequency in a topic frequency table;

a generation module, stored in memory, that:

generates a frequency distribution graph from the retrieved topic lists based on the topic frequency table; and

generates, based on the frequency, an ordered list of probable topics of the data artifact by selecting topics in the topic lists falling within the middle of the graph such that the topic with the highest frequency and the topic with the lowest frequency are not included in the ordered list of probable topics; and

at least one physical processor configured to execute the extraction module, the creation module, the retrieval module, and the generation module.

7. The system of claim 6 , wherein the generation module generates, at the topic processor, the list of topics by:

identifying a topic hierarchy for a topic;

creating a suffix index for the topic by, for each element in the topic hierarchy:

designating the element as a key;

copying each element that is above the element in the topic hierarchy into a topic space indexed on the key;

retrieving a subset of the elements in the topic space of at least one key in the suffix index;

designating the retrieved subset as the list of topics.

8. The system of claim 7 , wherein generation module:

creates the suffix index by designating, for each element in the topic space of each key, a depth level of the element;

retrieves the subset of the elements in the topic space of the at least one key in the suffix index by:

receiving a requested depth level as input;

composing the subset exclusively of elements with a depth level equal to the requested depth level.

9. The system of claim 6 , wherein the generation module generates the plurality of contextually relevant keywords by retrieving at least one keyword from at least one predetermined external source of contextually relevant keywords.

10. The system of claim 6 , wherein:

the data artifact comprises a plurality of documents;

the extraction module extracts the least one initial keyword from the data artifact by:

summarizing the plurality of documents into a concise summary that is smaller in length than the total length of the plurality of documents;

extracting the at least one initial keyword from the concise summary.

11. A non-transitory computer-readable medium comprising one or more computer-readable instructions that, when executed by at least one processor of a computing device, cause the computing device to:

extract at least one initial keyword from a data artifact with an unknown topic;

create a set of keywords by generating a plurality of contextually relevant keywords related to the initial keyword and combine the initial keyword with the contextually relevant keywords to form the set of keywords;

retrieve, from a topic processor, a plurality of lists of topics, wherein each list of topics describes each keyword within the set of keywords, wherein each list of topics has a corresponding frequency in a topic frequency table;

generate a frequency distribution graph from the retrieved topic lists based on the topic frequency table; and

generate, based on the frequency, an ordered list of probable topics of the data artifact by selecting topics in the topic lists falling within the middle of the graph such that the topic with the highest frequency and the topic with the lowest frequency are not included in the ordered list of probable topics.

12. The non-transitory computer-readable medium of claim 11 , wherein the one or more computer-readable instructions cause the computing device to generate, at the topic processor, the list of topics by:

identifying a topic hierarchy for a topic;

creating a suffix index for the topic by, for each element in the topic hierarchy:

designating the element as a key;

copying each element that is above the element in the topic hierarchy into a topic space indexed on the key;

retrieving a subset of the elements in the topic space of at least one key in the suffix index;

designating the retrieved subset as the list of topics.

13. The non-transitory computer-readable medium of claim 12 , wherein the one or more computer-readable instructions cause the computing device to:

create the suffix index by designating, for each element in the topic space of each key, a depth level of the element;

retrieve the subset of the elements in the topic space of the at least one key in the suffix index by:

receiving a requested depth level as input;

composing the subset exclusively of elements with a depth level equal to the requested depth level.

14. The non-transitory computer-readable medium of claim 11 , wherein the one or more computer-readable instructions cause the computing device to generate the plurality of contextually relevant keywords by retrieving at least one keyword from at least one predetermined external source of contextually relevant keywords.

15. The non-transitory computer-readable medium of claim 11 , wherein:

the data artifact comprises a plurality of documents;

extracting the least one initial keyword from the data artifact comprises:

summarizing the plurality of documents into a concise summary that is smaller in length than the total length of the plurality of documents;

extracting the at least one initial keyword from the concise summary.

Assignments (14)

Cited By (2)

US 12,664,377 US 12,711,152