\(P\)-top-\(k\) queries in a probabilistic framework from information extraction models (Q660968): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Managing and mining uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximate reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Information in Relational Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal aggregation algorithms for middleware. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answering queries using views: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of incomplete information in relational databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to parse natural language with maximum entropy models / rank
 
Normal rank

Revision as of 20:55, 4 July 2024

scientific article
Language Label Description Also known as
English
\(P\)-top-\(k\) queries in a probabilistic framework from information extraction models
scientific article

    Statements

    \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models (English)
    0 references
    0 references
    0 references
    5 February 2012
    0 references
    probabilistic databases
    0 references
    uncertain data
    0 references
    information extraction
    0 references
    conditional random fields
    0 references

    Identifiers