P-top-k queries in a probabilistic framework from information extraction models

DOI10.1016/J.CAMWA.2011.06.064MaRDI QIDQ660968zbMATH OpenOpenAlexFDO

Authors Ming He, Yong-Ping Du

Publication date 5 February 2012

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2011.06.064

zbMATH Keywords

uncertain dataconditional random fieldsprobabilistic databasesinformation extraction

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Probabilistic top-\(k\) and ranking query algorithms in uncertain databases
• Probabilistic top-\(k\) range query processing for uncertain databases
• Supporting various top-\(k\) queries over uncertain datasets
• Probabilistic top-\(k\) dominating queries in uncertain databases
• On the semantics of top-\(k\) ranking for objects with uncertain data

Cites work

• Answering queries using views: A survey
• Incomplete Information in Relational Databases
• Learning to parse natural language with maximum entropy models
• Managing and mining uncertain data
• On the hardness of approximate reasoning
• Optimal aggregation algorithms for middleware.
• The problem of incomplete information in relational databases

Cited in

(4)

• Top-\(k\) querying of unknown values under order constraints
• HCRF-UBM approach for text-independent speaker identification
• Mining frequent items in data stream using time fading model
• Analysis of a probabilistic model of redundancy in unsupervised information extraction

This page was built for publication: \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660968)