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


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


    题名: Resolution dependence of the maximal information coefficient for noiseless relationship
    作者: Lee, S.-C.;Pang, N.-N.;Tzeng, W.-J.
    贡献者: 淡江大學物理學系
    关键词: Maximal information coefficient;Pearson’s correlation coefficient;Greedy algorithm
    日期: 2014-09-01
    上传时间: 2015-01-28 11:04:47 (UTC+8)
    出版者: New York: Springer New York LLC
    摘要: Reshef et al. (Science 334:1518–1523, 2011) introduce the maximal information coefficient, or MIC, which captures a wide range of relationships between pairs of variables. We derive a useful property which can be employed either to substantially reduce the computer time to determine MIC, or to obtain a series of MIC values for different resolutions. Through studying the dependence of the MIC scores on the maximal resolution, employed to partition the data, we show that relationships of different natures can be discerned more clearly. We also provide an iterative greedy algorithm, as an alternative to the ApproxMaxMI proposed by Reshef et al., to determine the value of MIC through iterative optimization, which can be conducted parallelly.
    關聯: Statistics and Computing 24(5), pp.845-852
    DOI: 10.1007/s11222-013-9405-5
    显示于类别:[物理學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML268检视/开启
    Resolution dependence of the maximal information coefficient for noiseless relationship.pdf431KbAdobe PDF0检视/开启

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

    TAIR相关文章

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