Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/102758
DC FieldValue
dc.titleA simple and competitive estimator of location
dc.contributor.authorChan, Y.M.
dc.contributor.authorHe, X.
dc.date.accessioned2014-10-28T02:29:22Z
dc.date.available2014-10-28T02:29:22Z
dc.date.issued1994-01-27
dc.identifier.citationChan, Y.M., He, X. (1994-01-27). A simple and competitive estimator of location. Statistics and Probability Letters 19 (2) : 137-142. ScholarBank@NUS Repository.
dc.identifier.issn01677152
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/102758
dc.description.abstractWe propose a location estimator based on a convex linear combination of the sample mean and median. The main attraction is the conceptual simplicity and transparency, but it remains very competitive in performance for a wide range of distributions. The estimator aims at minimizing the asymptotic variance in the class of all linear combinations of mean and median. Comparisons with some of the best location estimators, the maximum likelihood, Huber's and the Hodges-Lehmann M-estimators, are given based on asymptotic relative efficiency and Monte Carlo simulations. Computationally, the new estimator has an explicit expression and requires no iteration. Robustness is assessed by calculation of breakdown point. © 1994.
dc.sourceScopus
dc.subjectBreakdown point
dc.subjectefficiency
dc.subjectHodges-Lehmann estimator
dc.subjectHuber's M-estimator
dc.subjectlocation
dc.subjectmean
dc.subjectmedian
dc.subjectrobust estimator
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.sourcetitleStatistics and Probability Letters
dc.description.volume19
dc.description.issue2
dc.description.page137-142
dc.description.codenSPLTD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

131
checked on Mar 16, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.