Table scan predicate with integrated semi-join filter
US-2024419650-A1 · Dec 19, 2024 · US
US9547679B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9547679-B2 |
| Application number | US-201313849167-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 22, 2013 |
| Priority date | Mar 29, 2012 |
| Publication date | Jan 17, 2017 |
| Grant date | Jan 17, 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.
Methods, systems and computer program products are provided for predicting data. A name or title is obtained from a taste profile. There is an index into a data set based on the name or title, and a set of terms and corresponding term weights associated with the name or title are retrieved. A sparse vector is constructed based on the set of terms and term weights. The sparse vector is input to a training model including target data. The target data includes a subset of test data which has a correspondence to a predetermined target metric of data. A respective binary value and confidence level is output for each term, corresponding to an association between the term and the target metric.
Opening claim text (preview).
What is claimed is: 1. A system for predicting data, comprising: a processor configured to: obtain a name or title from a taste profile; index a database containing a plurality of records as inverted indices having terms that are indexes into a data set based on the name or the title, and retrieve a set of descriptive terms which assign a subjective quality to the name or the title, and corresponding term weights associated with the name or the title; construct a sparse vector based on the set of terms and term weights wherein the sparse vector represents an identity of an entity; input the sparse vector to a training model including target data, wherein the target data includes a subset of test data having a correspondence to a predetermined target metric of data, and output a respective binary value and confidence level for each term above a threshold, corresponding to an association between the term and the target metric and classify the name or title based on the output. 2. The system according to claim 1 , wherein the taste profile further includes one or more of the following: length of listening activity for a song, length of listening activity for an album, and user actions taken during song or album play. 3. The system according to claim 1 , wherein the data set is at least one of a musical data set, a book data set, a movie data set, a game data set, or a combination thereof. 4. The system according to claim 1 , wherein the processor is further configured to evaluate the name or a title as a classifier based on the output. 5. The system according to claim 1 , wherein the taste profile includes multiple names or titles, and wherein the sparse vector is constructed from terms in the data set corresponding to all names or titles in the taste profile. 6. The system according to claim 1 , wherein the processor is further configured to filter the output to only those terms with a confidence level above a set threshold. 7. The system according to claim 1 , wherein the test data comprises a set of data determined to be associated with the target metric, as a ground truth for the learning model. 8. The system according to claim 1 , wherein the processor is further configured to resolve a name or title from multiple different textual representations. 9. The system according to claim 1 , wherein one entity can have multiple taste profiles, or multiple entities can share a single taste profile. 10. A method for predicting data, comprising: obtaining a name or title from a taste profile; indexing a database containing a plurality of records as inverted indices having terms that are indexes into a data set based on the name or the title, and retrieving a set of descriptive terms which assign a subjective quality to the name or the title, and corresponding term weights associated with the name or the title; constructing a sparse vector based on the set of terms and term weights wherein the sparse vector represents an identity of an entity; inputting the sparse vector to a training model including target data, wherein the target data includes a subset of test data having a correspondence to a predetermined target metric of data, and outputting a respective binary value and confidence level for each term above a threshold, corresponding to an association between the term and the target metric and classify the name or title based on the output. 11. The method according to claim 10 , wherein the taste profile further includes one or more of the following: length of listening activity for a song, length of listening activity for an album, and user actions taken during song or album play. 12. The method according to claim 10 , wherein the data set is at least one of a musical data set, a book data set, a movie data set, a game data set, or a combination thereof. 13. The method according to claim 10 , wherein the method further includes evaluating the name or a title as a classifier based on the output. 14. The method according to claim 10 , wherein the taste profile includes multiple names or titles, and wherein the sparse vector is constructed from terms in the data set corresponding to all names or titles in the taste profile. 15. The method according to claim 10 , wherein the method further includes filtering the output to only those terms with a confidence level above a set threshold. 16. The method according to claim 10 , wherein the test data comprises a set of data determined to be associated with the target metric, as a ground truth for the learning model. 17. The method according to claim 10 , wherein the method further includes resolving a name or title from multiple different textual representations. 18. The method according to claim 10 , wherein one entity can have multiple taste profiles, or multiple entities can share a single taste profile. 19. A non-transitory computer-readable medium having stored thereon sequences of instructions, the sequences of instructions including instructions which when executed by a computer system causes the computer system to perform a method for predicting data, the method comprising: obtaining a name or title from a taste profile; indexing a database containing a plurality of records as inverted indices having terms that are indexes into a data set based on the name or the title, and retrieve a set of descriptive terms which assign a subjective quality to the name or the title, and corresponding term weights associated with the name or the title; constructing a sparse vector based on the set of terms and term weights wherein the sparse vector represents an identity of an entity; inputting the sparse vector to a training model including target data, wherein the target data includes a subset of test data having a correspondence to a predetermined target metric of data, and outputting a respective binary value and confidence level for each term above a threshold, corresponding to an association between the term and the target metric and classify the name or title based on the output.
Search customisation based on user profiles and personalisation · CPC title
Filtering based on additional data, e.g. user or group profiles · CPC title
Vectors, bitmaps or matrices · CPC title
Marketing; Price estimation or determination; Fundraising · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.