Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method (Q1382213): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The strong law of large numbers for k-means and best possible nets of Banach valued random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimmed \(k\)-means: An attempt to robustify quantizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best possible net and the best possible cross-section of a set in a normed space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximations to random variables based on trimming procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the breakdown point of multivariate location estimators based on trimming procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Groups in Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of stochastic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Median of Squares Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692741 / rank
 
Normal rank

Revision as of 11:47, 28 May 2024

scientific article
Language Label Description Also known as
English
Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method
scientific article

    Statements

    Trimmed best \(k\)-nets: A robustified version of an \(L_{\infty}\)-based clustering method (English)
    0 references
    6 May 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    best k-nets
    0 references
    trimmed k-means
    0 references
    trimmed best k-nets
    0 references
    k-means
    0 references
    clustering
    0 references
    robustness
    0 references
    bridging objects
    0 references
    0 references
    0 references