IDEAS home Printed from https://ideas.repec.org/a/spr/stabio/v9y2017i1d10.1007_s12561-016-9167-7.html
   My bibliography  Save this article

Testing for Associations of Opposite Directionality in a Heterogeneous Population

Author

Listed:
  • Fangyuan Zhang

    (Texas Tech University)

  • Jie Ding

    (Stanford University)

  • Shili Lin

    (The Ohio State University)

Abstract

In gene networks, it is possible that the patterns of gene co-expression may exist only in a subset of the sample. In studies of relationships between genotypes and expressions of genes over multiple tissues, there may be associations in some tissues but not in the others. Despite the importance of the problem in genomic applications, it is challenging to identify relationships between two variables when the correlation may only exist in a subset of the sample. The situation becomes even less tractable when there exist two subsets in which correlations are in opposite directions. By ranking subset relationships according to Kendall’s tau, a tau-path can be derived to facilitate the identification of correlated subsets, if such subsets exist. However, the current tau-path methodology only considers the situation in which there is association in a subsample; the more complex scenario depicting the existence of two subsets with opposite directionality of associations was not addressed. Further, existing algorithms for finding tau-paths may be suboptimal given their greedy nature. In this paper, we extend the tau-path methodology to accommodate the situation in which the sample may be drawn from a heterogeneous population composed of subpopulations portraying positive and negative associations. We also propose the use of a cross entropy Monte Carlo procedure to obtain an optimal tau-path, CEMC $$_{tp}$$ t p . The algorithm not only can provide simultaneous detection of positive and negative correlations in the same sample, but also can lead to the identification of subsamples that provide evidence for the detected associations. An extensive simulation study shows the aptness of CEMC $$_{tp}$$ t p for detecting associations under various scenarios. Compared with two standard tests for detecting associations, CEMC $$_{tp}$$ t p is seen to be more powerful when there are indeed complex subset associations with well-controlled type-I error rates. We applied CEMC $$_{tp}$$ t p to the NCI-60 gene expression data to illustrate its utility for uncovering network relationships that were missed with standard methods.

Suggested Citation

  • Fangyuan Zhang & Jie Ding & Shili Lin, 2017. "Testing for Associations of Opposite Directionality in a Heterogeneous Population," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 9(1), pages 137-159, June.
  • Handle: RePEc:spr:stabio:v:9:y:2017:i:1:d:10.1007_s12561-016-9167-7
    DOI: 10.1007/s12561-016-9167-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12561-016-9167-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12561-016-9167-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. L. Margolin, 2005. "On the Convergence of the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 201-214, February.
    2. Shili Lin & Jie Ding, 2009. "Integration of Ranked Lists via Cross Entropy Monte Carlo with Applications to mRNA and microRNA Studies," Biometrics, The International Biometric Society, vol. 65(1), pages 9-18, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhengsong Lin & Yuting Wang & Xinyue Ye & Yuxi Wan & Tianjun Lu & Yu Han, 2022. "Effects of Low-Carbon Visualizations in Landscape Design Based on Virtual Eye-Movement Behavior Preference," Land, MDPI, vol. 11(6), pages 1-17, May.
    2. Ali Eshragh & Jerzy Filar & Michael Haythorpe, 2011. "A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem," Annals of Operations Research, Springer, vol. 189(1), pages 103-125, September.
    3. Shili Lin & Jie Ding, 2009. "Integration of Ranked Lists via Cross Entropy Monte Carlo with Applications to mRNA and microRNA Studies," Biometrics, The International Biometric Society, vol. 65(1), pages 9-18, March.
    4. Antonio Jiménez-Martín & Eduardo Gallego & Alfonso Mateos & Juan A. Fernández Pozo, 2017. "Restoring a Radionuclide Contaminated Aquatic Ecosystem: A Group Decision Making Problem with Incomplete Information within MAUT Accounting for Veto," Group Decision and Negotiation, Springer, vol. 26(4), pages 653-675, July.
    5. Švendová, Vendula & Schimek, Michael G., 2017. "A novel method for estimating the common signals for consensus across multiple ranked lists," Computational Statistics & Data Analysis, Elsevier, vol. 115(C), pages 122-135.
    6. Schimek Michael G. & Budinská Eva & Kugler Karl G. & Švendová Vendula & Ding Jie & Lin Shili, 2015. "TopKLists: a comprehensive R package for statistical inference, stochastic aggregation, and visualization of multiple omics ranked lists," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 14(3), pages 311-316, June.
    7. Lin Shili, 2010. "Space Oriented Rank-Based Data Integration," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 9(1), pages 1-25, April.
    8. Nguyen, Hoa T.M. & Chow, Andy H.F. & Ying, Cheng-shuo, 2021. "Pareto routing and scheduling of dynamic urban rail transit services with multi-objective cross entropy method," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    9. Ding, Jiankun & Han, Deqiang & Yang, Yi, 2018. "Iterative ranking aggregation using quality improvement of subgroup ranking," European Journal of Operational Research, Elsevier, vol. 268(2), pages 596-612.
    10. Giuseppe Jurman & Samantha Riccadonna & Roberto Visintainer & Cesare Furlanello, 2012. "Algebraic Comparison of Partial Lists in Bioinformatics," PLOS ONE, Public Library of Science, vol. 7(5), pages 1-20, May.
    11. Antonio D’Ambrosio & Carmela Iorio & Michele Staiano & Roberta Siciliano, 2019. "Median constrained bucket order rank aggregation," Computational Statistics, Springer, vol. 34(2), pages 787-802, June.
    12. Dirk P. Kroese & Sergey Porotsky & Reuven Y. Rubinstein, 2006. "The Cross-Entropy Method for Continuous Multi-Extremal Optimization," Methodology and Computing in Applied Probability, Springer, vol. 8(3), pages 383-407, September.
    13. Luisa Cutillo & Annamaria Carissimo & Silvia Figini, 2012. "Network Selection: A Method for Ranked Lists Selection," PLOS ONE, Public Library of Science, vol. 7(8), pages 1-13, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:stabio:v:9:y:2017:i:1:d:10.1007_s12561-016-9167-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.