IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v99y2016icp171-188.html
   My bibliography  Save this article

SMILE: A novel dissimilarity-based procedure for detecting sparse-specific profiles in sparse contingency tables

Author

Listed:
  • Emily, Mathieu
  • Hitte, Christophe
  • Mom, Alain

Abstract

A novel statistical procedure for clustering individuals characterized by sparse-specific profiles is introduced in the context of data summarized in sparse contingency tables. The proposed procedure relies on a single-linkage clustering based on a new dissimilarity measure designed to give equal influence to sparsity and specificity of profiles. Theoretical properties of the new dissimilarity are derived by characterizing single-linkage clustering using Minimum Spanning Trees. Such characterization allows the description of situations for which the proposed dissimilarity outperforms competing dissimilarities. Simulation examples are performed to demonstrate the strength of the new dissimilarity compared to 11 other methods. The analysis of a genomic dataset dedicated to the study of molecular signatures of selection is used to illustrate the efficiency of the proposed method in a real situation.

Suggested Citation

  • Emily, Mathieu & Hitte, Christophe & Mom, Alain, 2016. "SMILE: A novel dissimilarity-based procedure for detecting sparse-specific profiles in sparse contingency tables," Computational Statistics & Data Analysis, Elsevier, vol. 99(C), pages 171-188.
    • Handle: RePEc:eee:csdana:v:99:y:2016:i:c:p:171-188
    DOI: 10.1016/j.csda.2016.01.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947316300032
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2016.01.017?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. Goslee, Sarah C. & Urban, Dean L., 2007. "The ecodist Package for Dissimilarity-based Analysis of Ecological Data," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 22(i07).
    2. J. C. Gower & G. J. S. Ross, 1969. "Minimum Spanning Trees and Single Linkage Cluster Analysis," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 18(1), pages 54-64, March.
    3. Witten, Daniela M. & Tibshirani, Robert, 2010. "A Framework for Feature Selection in Clustering," Journal of the American Statistical Association, American Statistical Association, vol. 105(490), pages 713-726.
    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. Yaeji Lim & Hee-Seok Oh & Ying Kuen Cheung, 2019. "Multiscale Clustering for Functional Data," Journal of Classification, Springer;The Classification Society, vol. 36(2), pages 368-391, July.
    2. Yujia Li & Xiangrui Zeng & Chien‐Wei Lin & George C. Tseng, 2022. "Simultaneous estimation of cluster number and feature sparsity in high‐dimensional cluster analysis," Biometrics, The International Biometric Society, vol. 78(2), pages 574-585, June.
    3. Dong Liu & Changwei Zhao & Yong He & Lei Liu & Ying Guo & Xinsheng Zhang, 2023. "Simultaneous cluster structure learning and estimation of heterogeneous graphs for matrix‐variate fMRI data," Biometrics, The International Biometric Society, vol. 79(3), pages 2246-2259, September.
    4. Jeffrey Andrews & Paul McNicholas, 2014. "Variable Selection for Clustering and Classification," Journal of Classification, Springer;The Classification Society, vol. 31(2), pages 136-153, July.
    5. Beibei Zhang & Rong Chen, 2018. "Nonlinear Time Series Clustering Based on Kolmogorov-Smirnov 2D Statistic," Journal of Classification, Springer;The Classification Society, vol. 35(3), pages 394-421, October.
    6. Davide Rassati & Massimo Faccoli & Robert A Haack & Robert J Rabaglia & Edoardo Petrucco Toffolo & Andrea Battisti & Lorenzo Marini, 2016. "Bark and Ambrosia Beetles Show Different Invasion Patterns in the USA," PLOS ONE, Public Library of Science, vol. 11(7), pages 1-17, July.
    7. Sung-Soo Kim & W. Krzanowski, 2007. "Detecting multiple outliers in linear regression using a cluster method combined with graphical visualization," Computational Statistics, Springer, vol. 22(1), pages 109-119, April.
    8. J. Fernando Vera & Rodrigo Macías, 2021. "On the Behaviour of K-Means Clustering of a Dissimilarity Matrix by Means of Full Multidimensional Scaling," Psychometrika, Springer;The Psychometric Society, vol. 86(2), pages 489-513, June.
    9. Kirschstein, Thomas & Liebscher, Steffen & Becker, Claudia, 2013. "Robust estimation of location and scatter by pruning the minimum spanning tree," Journal of Multivariate Analysis, Elsevier, vol. 120(C), pages 173-184.
    10. repec:jss:jstsof:22:i01 is not listed on IDEAS
    11. Zhiguang Huo & Li Zhu & Tianzhou Ma & Hongcheng Liu & Song Han & Daiqing Liao & Jinying Zhao & George Tseng, 2020. "Two-Way Horizontal and Vertical Omics Integration for Disease Subtype Discovery," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 12(1), pages 1-22, April.
    12. Jean-Pierre Barthélemy & Bruno Leclerc & Bernard Monjardet, 1986. "On the use of ordered sets in problems of comparison and consensus of classifications," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 187-224, September.
    13. Charles Bouveyron & Camille Brunet-Saumard, 2014. "Discriminative variable selection for clustering with the sparse Fisher-EM algorithm," Computational Statistics, Springer, vol. 29(3), pages 489-513, June.
    14. Corinna Kleinert & Alexander Vosseler & Uwe Blien, 2018. "Classifying vocational training markets," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 61(1), pages 31-48, July.
    15. Sergio Scippacercola, 2011. "The Factorial Minimum Spanning Tree as a Reference for a Synthetic Index of Complex Phenomena," Journal of Classification, Springer;The Classification Society, vol. 28(1), pages 21-37, April.
    16. Hosik Choi & Seokho Lee, 2019. "Convex clustering for binary data," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 13(4), pages 991-1018, December.
    17. Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
    18. Bruno Leclerc, 1995. "Minimum spanning trees for tree metrics: abridgements and adjustments," Journal of Classification, Springer;The Classification Society, vol. 12(2), pages 207-241, September.
    19. Pi, J. & Wang, Honggang & Pardalos, Panos M., 2021. "A dual reformulation and solution framework for regularized convex clustering problems," European Journal of Operational Research, Elsevier, vol. 290(3), pages 844-856.
    20. Zhimei Lei & Kuo-Jui Wu & Li Cui & Ming K Lim, 2018. "A Hybrid Approach to Explore the Risk Dependency Structure among Agribusiness Firms," Sustainability, MDPI, vol. 10(2), pages 1-17, February.
    21. Wilson Lara & Stella Bogino & Felipe Bravo, 2018. "Multilevel analysis of dendroclimatic series with the R-package BIOdry," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-23, May.

    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:eee:csdana:v:99:y:2016:i:c:p:171-188. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.