Approximate Clustering with Same-Cluster Queries (Q4993306): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Approximate Clustering with Same-Cluster Queries
Property / cites work
 
Property / cites work: Adaptive Sampling for k-Means Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5502120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5361265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Center-based clustering under perturbation stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with Interactive Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering under approximation stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bound instances for \(k\)-means++ in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bad instance for \texttt{k-means++} / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PCP theorem by gap amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for k-means clustering based on weak coresets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems / 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: Linear-time approximation schemes for clustering problems in any dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved and simplified inapproximability for \(k\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar \(k\)-means problem is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of lloyd-type methods for the k-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-means requires exponentially many iterations even in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405114 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2613497313 / rank
 
Normal rank
Property / title
 
Approximate Clustering with Same-Cluster Queries (English)
Property / title: Approximate Clustering with Same-Cluster Queries (English) / rank
 
Normal rank

Revision as of 08:37, 30 July 2024

scientific article; zbMATH DE number 7359377
Language Label Description Also known as
English
Approximate Clustering with Same-Cluster Queries
scientific article; zbMATH DE number 7359377

    Statements

    0 references
    0 references
    0 references
    0 references
    15 June 2021
    0 references
    \(k\)-means
    0 references
    semi-supervised learning
    0 references
    query bounds
    0 references
    Approximate Clustering with Same-Cluster Queries (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references