A lower bound for computing Oja depth (Q1044726): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2005.05.014 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085492198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for computing statistical depth. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a notion of data depth based on random simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive statistics for multivariate distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm AS 307: Bivariate Location Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117205 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2005.05.014 / rank
 
Normal rank

Latest revision as of 14:47, 10 December 2024

scientific article
Language Label Description Also known as
English
A lower bound for computing Oja depth
scientific article

    Statements

    A lower bound for computing Oja depth (English)
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    algorithms
    0 references
    computational geometry
    0 references
    computational statistics
    0 references
    data depth
    0 references
    bivariate medians
    0 references

    Identifiers