Finding global optimum for truth discovery: entropy based geometric variance

DOI10.4230/LIPICS.SOCG.2016.34MaRDI QIDQ3132868zbMATH OpenOpenAlexFDO

Authors Hu Ding, Jing Gao, Jinhui Xu

Publication date 30 January 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.SoCG.2016.34

zbMATH Keywords

data miningentropygeometric optimizationhigh dimension

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Applications of mathematical programming (90C90)

Recommendations

• Learning the truth vector in high dimensions
• Approximating global optimum for probabilistic truth discovery
• Approximating global optimum for probabilistic truth discovery
• A faster algorithm for truth discovery via range cover
• Faster algorithm for truth discovery via range cover

Cited in

(9)

• A unified framework for clustering constrained data without locality property
• Learning the truth vector in high dimensions
• A faster algorithm for truth discovery via range cover
• Faster algorithm for truth discovery via range cover
• Inferring ground truth from crowdsourced data under local attribute differential privacy
• A high-efficiency incremental truth discovery algorithm in big data
• Approximating global optimum for probabilistic truth discovery
• Approximating global optimum for probabilistic truth discovery
• Generalizing truth discovery by incorporating multi-truth features

This page was built for publication: Finding global optimum for truth discovery: entropy based geometric variance

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