查詢結果分析
相關文獻
- Constructing the Bivariate Tukey Median
- Generalized Gray Codes with Applications
- Distributed Broadcasting Algorithms in Rotator Graphs
- 新預算法的主要特色及修正重點
- 非常態性資料下中位數管制圖之研究
- Fractal Image Coding Using Projection-Based Classification and Variable Shape Matching
- 以類神經網絡模式分析颱風降雨與半分布並聯式水庫概念模式模擬颱洪歷線之串聯應用
- 線性軸幅路網接駁系統最適整合區位、路線與排班模式之研究
- 都市計畫草圖替選方案分析模式之實例研究
- MUSCL Type Algorithm for Acoustic Wave Equations in Heterogeneous Media
頁籤選單縮合
題 名 | Constructing the Bivariate Tukey Median |
---|---|
作 者 | Rousseeuw,Peter J.; Ruts,Ida; | 書刊名 | Statistica Sinica |
卷 期 | 8:3 1998.07[民87.07] |
頁 次 | 頁827-839 |
分類號 | 319.5 |
關鍵詞 | 中位數; 算法; Algorithm; Halfplane depth; Robustness; Tukey depth; |
語 文 | 英文(English) |
英文摘要 | The halfplane location depth of a point □ □ □ relative to a bivariate data set X = {□,…,Xn} is the minimal number of observations in any closed halfplane that contains □ (Tukey (1975)). The halfplane median or Tukey median is the □ with maximal depth □ (Donoho and Gasko (1992)). If this □ is not unique, the Tukey median is defined as the center of gravity of the set of points with depth □. In this paper we construct two algorithms for computing the Tukey median. The first one is relatively straightforward but quite slow, whereas the second (called HALFMED) is much faster. A small simulation study is performed, and some examples are given. |
本系統中英文摘要資訊取自各篇刊載內容。