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

DOI10.1016/j.camwa.2011.06.064zbMath1231.68117OpenAlexW2091346112MaRDI QIDQ660968

Yong-Ping Du, Ming He

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)

Related Items (2)

Mining frequent items in data stream using time fading model ⋮ HCRF-UBM approach for text-independent speaker identification

Cites Work

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

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