scientific article; zbMATH DE number 7375824

DOI10.4230/LIPIcs.APPROX-RANDOM.2017.19zbMath1467.68168MaRDI QIDQ5002622

Edo Liberty, M. I. Sviridenko

Publication date: 28 July 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

data miningmachine learninggreedy algorithmsweak supermodularity

Mathematics Subject Classification ID

Generalized linear models (logistic models) (62J12) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical methods for solving linear least squares problems
• Bi-criteria linear-time approximations for generalized k-mean/median/center
• Adaptive Sampling for k-Means Clustering
• Some Applications of the Rank Revealing QR Factorization
• An analysis of approximations for maximizing submodular set functions—I
• Sparse Approximate Solutions to Linear Systems
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• A unified framework for approximating and clustering data
• Near-Optimal Column-Based Matrix Reconstruction

This page was built for publication: