Efficient processing of similarity search on uncertain set-valued data

DOI10.3724/SP.J.1001.2012.04110MaRDI QIDQ4901407zbMATH OpenFDO

Authors Ke Chen, Yinjie Hong, Gang Chen

Publication date 24 January 2013

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1001.2012.04110

zbMATH Keywords

dynamic programmingexpected similaritysimilarity searchuncertain set

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Efficient processing of probabilistic set-containment queries on uncertain set-valued data
• Similarity processing in multi-observation data
• Set similarity search beyond MinHash
• An effective similarity measurement under epistemic uncertainty
• Large-scale similarity joins with guarantees (invited talk)

Cited in

(4)

• Similarity search in medical data.
• Efficient processing of probabilistic set-containment queries on uncertain set-valued data
• Similarity processing in multi-observation data
• World-set decompositions: Expressiveness and efficient algorithms

This page was built for publication: Efficient processing of similarity search on uncertain set-valued data

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