Learning the truth vector in high dimensions
From MaRDI portal
Recommendations
- Finding global optimum for truth discovery: entropy based geometric variance
- 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
Cites work
- A unified framework for clustering constrained data without locality property
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Extensions of Lipschitz mappings into a Hilbert space
- Faster algorithm for truth discovery via range cover
- Finding global optimum for truth discovery: entropy based geometric variance
- scientific article; zbMATH DE number 1305437 (Why is no real title available?)
- Linear-time approximation schemes for clustering problems in any dimensions
- Low-rank matrix completion using alternating minimization
- Spectral methods meet EM: a provably optimal algorithm for crowdsourcing
- Sublinear estimation of entropy and information distances
- The Mailman algorithm: a note on matrix-vector multiplication
- Theory and use of the EM algorithm
Cited in
(6)- A faster algorithm for truth discovery via range cover
- Faster algorithm for truth discovery via range cover
- Finding global optimum for truth discovery: entropy based geometric variance
- A high-efficiency incremental truth discovery algorithm in big data
- Approximating global optimum for probabilistic truth discovery
- Generalizing truth discovery by incorporating multi-truth features
This page was built for publication: Learning the truth vector in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301361)