Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
label / enlabel / en
 
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ESA.2019.40 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CIFAR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Sampling for k-Means Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing of Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of data science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better streaming algorithms for clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative \((p,\varepsilon )\)-approximations in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search approximation algorithm for k-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the sample complexity of learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing the embedding / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2978778643 / rank
 
Normal rank
Property / title
 
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (English)
Property / title: Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ESA.2019.40 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:49, 30 December 2024

scientific article; zbMATH DE number 7525477
Language Label Description Also known as
English
Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
scientific article; zbMATH DE number 7525477

    Statements

    0 references
    0 references
    0 references
    11 May 2022
    0 references
    \(k\)-center clustering
    0 references
    outliers
    0 references
    coreset
    0 references
    doubling metrics
    0 references
    random sampling
    0 references
    Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (English)
    0 references

    Identifiers