The top-K tau-path screen for monotone association in subpopulations

被引:2
|
作者
Sampath, Srinath [1 ]
Caloiaro, Adriano [2 ]
Johnson, Wayne [3 ]
Verducci, Joseph S. [4 ]
机构
[1] Hamilton Capital Management, Columbus, OH 43220 USA
[2] Greenhouse Software Inc, New York, NY USA
[3] Myatt & Johnson Inc, Miami Beach, FL USA
[4] Ohio State Univ, Columbus, OH 43210 USA
关键词
algorithmic complexity; big data; mixtures of copulas; nonparametric correlation; ranking models; unsupervised classification;
D O I
10.1002/wics.1382
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
A pair of variables that tend to rise and fall either together or in opposition are said to be monotonically associated. For certain phenomena, this tendency is causally restricted to a subpopulation, as, e.g., the severity of an allergic reaction trending with the concentration of an air pollutant. Previously, Yu et al. (Stat Methodol 2011, 8:97-111) devised a method of rearranging observations to test paired data to see if such an association might be present in a subpopulation. However, the computational intensity of the method limited its application to relatively small samples of data, and the test itself only judges if association is present in some subpopulation; it does not clearly identify the subsample that came from this subpopulation, especially when the whole sample tests positive. The present study adds a 'top-K' feature (Sampath S, Verducci JS. Stat Anal Data Min 2013, 6:458-471) based on a multistage ranking model, that identifies a concise subsample that is likely to contain a high proportion of observations from the subpopulation in which the association is supported. Computational improvements incorporated into this top-K tau-path algorithm now allow the method to be extended to thousands of pairs of variables measured on sample sizes in the thousands. A description of the new algorithm along with measures of computational complexity and practical efficiency help to gauge its potential use in different settings. Simulation studies catalog its accuracy in various settings, and an example from finance illustrates its step-by-step use. (C) 2016 Wiley Periodicals, Inc.
引用
收藏
页码:206 / 218
页数:13
相关论文
共 38 条
  • [31] P4KP: QoS-Aware Top-K Best Path Using Programmable Switch
    Das Robin, Debobroto
    Khan, Javed, I
    IEEE ACCESS, 2021, 9 : 109115 - 109129
  • [32] Node Similarity Top-k Query of the Large-Scale Dynamic Graph With Weak Repeated Path Constraint
    Wang Junlu
    Song Yulong
    Song Baoyan
    IEEE ACCESS, 2019, 7 : 64431 - 64441
  • [33] Integrating Meta-Path Selection with User-Preference for Top-k Relevant Search in Heterogeneous Information Networks
    Bu, Shaoli
    Hong, Xiaoguang
    Peng, Zhaohui
    Li, Qingzhong
    PROCEEDINGS OF THE 2014 IEEE 18TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN (CSCWD), 2014, : 301 - 306
  • [34] A sliding window method for finding top-k path traversal patterns over streaming Web click-sequences
    Li, Hua-Fu
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) : 4382 - 4386
  • [35] Mining Effective Patterns of Chinese Medicinal Formulae Using Top-k Weighted Association Rules for the Internet of Medical Things
    Zhu, Xiaolin
    Liu, Yongguo
    Li, Qiaoqin
    Zhang, Yi
    Wen, Chuanbiao
    IEEE ACCESS, 2018, 6 : 57840 - 57855
  • [36] Discovery of Traditional Chinese Medicine Prescription Patterns Containing Herbal Dosage Based on Multilevel Top-K Weighted Association Rules
    Zhu, Xiaolin
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
  • [37] Discovery of Traditional Chinese Medicine Prescription Patterns Containing Herbal Dosage Based on Multilevel Top-K Weighted Association Rules
    Zhu, Xiaolin
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
  • [38] A Novel EEMD-Based Privacy Preserving Approach for Top-k SNPs Query in Genome-Wide Association Studies
    He Xiaoyun
    Guo Hao
    Chen Hongsong
    2020 IEEE 6TH INTERNATIONAL CONFERENCE ON CONTROL SCIENCE AND SYSTEMS ENGINEERING (ICCSSE), 2019, : 72 - 76