Hierarchical design of fast minimum disagreement algorithms
From MaRDI portal
Recommendations
- Hierarchical design of fast minimum disagreement algorithms
- Hierarchical minimization problems and applications
- Efficient algorithms for discrepancy minimization in convex sets
- Minimization of the disagreements in clustering aggregation
- Fast Consensus by the Alternating Direction Multipliers Method
- An explicit algorithm for solving the optimize hierarchical problems
- Deterministic discrepancy minimization
- Deterministic discrepancy minimization
- Parallel approximation of min-max problems
- A Faster Scaling Algorithm for Minimizing Submodular Functions
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- Bichromatic separability with two boxes: A general approach
- Computational geometry. Algorithms and applications.
- Computational limitations on learning from examples
- scientific article; zbMATH DE number 4166914 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Sharper bounds for Gaussian and empirical processes
- Toward efficient agnostic learning
- Understanding machine learning. From theory to algorithms
- Very simple classification rules perform well on most commonly used datasets
This page was built for publication: Hierarchical design of fast minimum disagreement algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704562)