English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 55222/89520 (62%)
造访人次 : 10722239      在线人数 : 24
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/75182


    题名: A Note on Frequency Polygon Based on Weighted Sum of Binned Data
    作者: Deng, Wen-Shuenn;Wu, Jyh-Shyang;Cheng, Li-Ching;Ke, Shun-Jie
    贡献者: 淡江大學統計學系;淡江大學數學系
    关键词: midpoint frequency polygon;edge frequency polygon;kernel-based weights;uniform weights;mixture weights;minimum variance weights
    日期: 2012
    上传时间: 2012-03-13 14:42:25 (UTC+8)
    出版者: Philadelphia: Taylor & Francis Inc.
    摘要: We revisit the generalized midpoint frequency polygon if Scott(1985), and the edge frequency polygon of Jones et all. (1998) and Dong and Zheng (2001). Their estimators are liner interpolants of the appropriate values above the bin centers or edges, those values being weighted averages of the heights of r, r∈N, neighboring histogram bins.We propose kernel evaluation method to genrate weights for binned values. The proposed kernel method can provide near-optimal weights in the sense of minimizing asymptotic mean integrated square error. In addition, we prove that the discrete uniform weights minimize the variance of the generalized frequency polygon under some mild conditions. Analogous results are obtained for the generalized frequency polygon based on linearly prebinned data. Finally, we use two examples and a simulation study yo compare the generalized midpoint and edge frequency polygons.
    關聯: Communications in Statistics - Theory and Methods(In Press)
    DOI: 10.1080/03610926.2012.673675
    显示于类别:[統計學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A Note on Frequency Polygon Based on Weighted Sum of Binned Data.pdf643KbAdobe PDF0检视/开启
    index.html0KbHTML0检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈