Real-time distributed in memory search architecture
US-2015154297-A1 · Jun 4, 2015 · US
US9626623B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9626623-B2 |
| Application number | US-201514919631-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 21, 2015 |
| Priority date | Dec 2, 2013 |
| Publication date | Apr 18, 2017 |
| Grant date | Apr 18, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
The present disclosure relates to a method for performing automated discovery of new topics from unlimited documents related to any subject domain, employing a multi-component extension of Latent Dirichlet Allocation (MC-LDA) topic models, to discover related topics in a corpus. The resulting data may contain millions of term vectors from any subject domain identifying the most distinguished co-occurring topics that users may be interested in, for periodically building new topic ID models using new content, which may be employed to compare one by one with existing model to measure the significance of changes, using term vectors differences with no correlation with a Periodic New Model, for periodic updates of automated discovery of new topics, which may be used to build a new topic ID model in-memory database to allow query-time linking on massive data-set for automated discovery of new topics.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method comprising: identifying, by a computer, in one or more document corpora of a data source, a topic of interest based upon one or more concurring topics identified in the one or more document corpora; automatically extracting, by the computer, from a document corpus, data associated with a plurality of co-occurring topics based on the topic of interest; in response to automatically extracting the data associated with the plurality of co-occurring topics, extracting, by the computer, a plurality of topic identifiers from the plurality of co-occurring topics; generating, by the computer, a periodic topic model comprising a set of one or more term vectors by comparing topic significance among the plurality of topic identifiers; periodically creating, by the computer, new topic ID models using data content in the periodic topic model by identifying a similarity of topics, wherein the new topic ID models are stored in an in-memory database; and linking, by the computer, data in the in-memory database for automated discovery of new topics. 2. The method of claim 1 , further comprising determining, by the computer, a relationship of corresponding term vectors from the plurality of co-occurring topics, each co-occurring topic of the plurality of co-occurring topics containing one or more term vectors. 3. The method of claim 2 , further comprising generating, by the computer, a master topic computer model comprising a first set of one or more term vectors identified in text of the document corpus upon determining the relationship of the corresponding term vectors from the plurality of co-occurring topics. 4. The method of claim 3 , further comprising selecting, by the computer, one or more new topics by identifying one or more term vectors from the set of the one or more term vectors in the periodic topic computer model that has no correlation with the first set of one or more term vectors in the master topic computer model. 5. The method of claim 3 , further comprising adding, via the computer, one or more new topics to the master topic computer model. 6. The method of claim 1 , wherein comparing the topic significance among the plurality of topic identifiers is based on a predetermined significance threshold. 7. The method of claim 3 , wherein the master topic computer model is a multi-component extension of a Latent Dirichlet Allocation (MC-LDA) topic model. 8. The method of claim 1 , wherein the periodic topic computer model is a multi-component extension of a Latent Dirichlet Allocation (MC-LDA) topic model. 9. The method of claim 1 , wherein the set of the one or more term vectors in the periodic topic computer model corresponds to a second set of the one or more term vectors. 10. A system comprising: a database source computer module configured to extract data associated with a plurality of co-occurring topics in a document corpus; and one or more computers comprising one or more processors configured to: identify, in the document corpus stored in the database source, an indication of a topic of interest; automatically extract from a document corpus, data associated with a plurality of co-occurring topics based on the topic of interest; extract a plurality of topic identifiers from the plurality of co-occurring topics in response to the extracting of the data associated with the plurality of co-occurring topics; create a periodic topic model comprising a set of one or more term vectors by comparing topic significance among the plurality of topic identifiers; periodically create new topic ID models using data content in the periodic topic model by identifying a similarity of topics, wherein the new topic ID models are stored in an in-memory database; and link data in the in-memory database for automated discovery of new topics. 11. The system of claim 10 , wherein the one or more computers are further configured to determine a relationship of corresponding term vectors from the plurality of co-occurring topics where each co-occurring topic of the plurality of co-occurring topics containing one or more term vectors. 12. The system of claim 11 , wherein the one or more computers are further configured to generate a master topic computer model comprising a first set of one or more term vectors identified in text of the document corpus upon determining the relationship of the corresponding term vectors from the plurality of co-occurring topics. 13. The system of claim 12 , wherein the one or more computers are further configured to select one or more new topics by identifying one or more term vectors from the set of the one or more term vectors in the periodic topic model that has no correlation with the first set of one or more term vectors in the master topic computer model. 14. The system of claim 12 , wherein the one or more computers are further configured to add one or more new topics to the master topic computer model. 15. The system of claim 10 , wherein comparing the topic significance among the plurality of topic identifiers is based on a predetermined significance threshold. 16. The system of claim 12 , wherein the master topic computer model is a multi-component extension of a Latent Dirichlet Allocation (MC-LDA) topic model. 17. The system of claim 10 , wherein the periodic topic computer model is a multi-component extension of a Latent Dirichlet Allocation (MC-LDA) topic model. 18. The system of claim 10 , wherein the set of the one or more term vectors in the periodic topic computer model corresponds to a second set of the one or more term vectors.
Document management systems · CPC title
Parsing · CPC title
Machine learning · CPC title
Handling natural language data (speech analysis or synthesis, speech recognition G10L) · CPC title
Clustering or classification · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.