IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i17p3785-d1232072.html
   My bibliography  Save this article

SCM Enables Improved Single-Cell Clustering by Scoring Consensus Matrices

Author

Listed:
  • Yilin Yu

    (School of Mathematics and Statistics, Shandong University, Weihai 264209, China)

  • Juntao Liu

    (School of Mathematics and Statistics, Shandong University, Weihai 264209, China)

Abstract

Single-cell clustering facilitates the identification of different cell types, especially the identification of rare cells. Preprocessing and dimensionality reduction are the two most commonly used data-processing methods and are very important for single-cell clustering. However, we found that different preprocessing and dimensionality reduction methods have very different effects on single-cell clustering. In addition, there seems to be no specific combination of preprocessing and dimensionality reduction methods that is applicable to all datasets. In this study, we developed a new algorithm for improving single-cell clustering results, called SCM. It first automatically searched for an optimal combination that corresponds to the best cell type clustering of a given dataset. It then defined a flexible cell-to-cell distance measure with data specificity for cell-type clustering. Experiments on ten benchmark datasets showed that SCM performed better than almost all the other seven popular clustering algorithms. For example, the average ARI improvement of SCM over the second best method SC3 even reached 29.31% on the ten datasets, which demonstrated its great potential in revealing cellular heterogeneity, identifying cell types, depicting cell functional states, inferring cellular dynamics, and other related research areas.

Suggested Citation

  • Yilin Yu & Juntao Liu, 2023. "SCM Enables Improved Single-Cell Clustering by Scoring Consensus Matrices," Mathematics, MDPI, vol. 11(17), pages 1-15, September.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:17:p:3785-:d:1232072
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/17/3785/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/17/3785/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Daniel D. Lee & H. Sebastian Seung, 1999. "Learning the parts of objects by non-negative matrix factorization," Nature, Nature, vol. 401(6755), pages 788-791, October.
    2. Warren Torgerson, 1952. "Multidimensional scaling: I. Theory and method," Psychometrika, Springer;The Psychometric Society, vol. 17(4), pages 401-419, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yu Kang & Erwei Liu & Kaichi Zou & Xiuyun Wang & Huaqing Zhang, 2024. "Sparse Clustering Algorithm Based on Multi-Domain Dimensionality Reduction Autoencoder," Mathematics, MDPI, vol. 12(10), pages 1-16, May.

    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. Rafael Teixeira & Mário Antunes & Diogo Gomes & Rui L. Aguiar, 2024. "Comparison of Semantic Similarity Models on Constrained Scenarios," Information Systems Frontiers, Springer, vol. 26(4), pages 1307-1330, August.
    2. Del Corso, Gianna M. & Romani, Francesco, 2019. "Adaptive nonnegative matrix factorization and measure comparisons for recommender systems," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 164-179.
    3. P Fogel & C Geissler & P Cotte & G Luta, 2022. "Applying separative non-negative matrix factorization to extra-financial data," Working Papers hal-03689774, HAL.
    4. Alexander Strehl & Joydeep Ghosh, 2003. "Relationship-Based Clustering and Visualization for High-Dimensional Data Mining," INFORMS Journal on Computing, INFORMS, vol. 15(2), pages 208-230, May.
    5. Spelta, A. & Pecora, N. & Rovira Kaltwasser, P., 2019. "Identifying Systemically Important Banks: A temporal approach for macroprudential policies," Journal of Policy Modeling, Elsevier, vol. 41(1), pages 197-218.
    6. Paul Fogel & Yann Gaston-Mathé & Douglas Hawkins & Fajwel Fogel & George Luta & S. Stanley Young, 2016. "Applications of a Novel Clustering Approach Using Non-Negative Matrix Factorization to Environmental Research in Public Health," IJERPH, MDPI, vol. 13(5), pages 1-14, May.
    7. Le Thi Khanh Hien & Duy Nhat Phan & Nicolas Gillis, 2022. "Inertial alternating direction method of multipliers for non-convex non-smooth optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 247-285, September.
    8. Jingfeng Guo & Chao Zheng & Shanshan Li & Yutong Jia & Bin Liu, 2022. "BiInfGCN: Bilateral Information Augmentation of Graph Convolutional Networks for Recommendation," Mathematics, MDPI, vol. 10(17), pages 1-16, August.
    9. Jianfei Cao & Han Yang & Jianshu Lv & Quanyuan Wu & Baolei Zhang, 2023. "Estimating Soil Salinity with Different Levels of Vegetation Cover by Using Hyperspectral and Non-Negative Matrix Factorization Algorithm," IJERPH, MDPI, vol. 20(4), pages 1-15, February.
    10. Zhang, Lifeng & Chao, Xiangrui & Qian, Qian & Jing, Fuying, 2022. "Credit evaluation solutions for social groups with poor services in financial inclusion: A technical forecasting method," Technological Forecasting and Social Change, Elsevier, vol. 183(C).
    11. Yi Yu & Jaeseung Baek & Ali Tosyali & Myong K. Jeong, 2024. "Robust asymmetric non-negative matrix factorization for clustering nodes in directed networks," Annals of Operations Research, Springer, vol. 341(1), pages 245-265, October.
    12. Wentao Qu & Xianchao Xiu & Huangyue Chen & Lingchen Kong, 2023. "A Survey on High-Dimensional Subspace Clustering," Mathematics, MDPI, vol. 11(2), pages 1-39, January.
    13. Anna Luiza Silva Almeida Vicente & Alexei Novoloaca & Vincent Cahais & Zainab Awada & Cyrille Cuenin & Natália Spitz & André Lopes Carvalho & Adriane Feijó Evangelista & Camila Souza Crovador & Rui Ma, 2022. "Cutaneous and acral melanoma cross-OMICs reveals prognostic cancer drivers associated with pathobiology and ultraviolet exposure," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    14. Takehiro Sano & Tsuyoshi Migita & Norikazu Takahashi, 2022. "A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence," Journal of Global Optimization, Springer, vol. 84(3), pages 755-781, November.
    15. Walesiak Marek & Dudek Andrzej, 2017. "Selecting the Optimal Multidimensional Scaling Procedure for Metric Data With R Environment," Statistics in Transition New Series, Statistics Poland, vol. 18(3), pages 521-540, September.
    16. Adam R. Pines & Bart Larsen & Zaixu Cui & Valerie J. Sydnor & Maxwell A. Bertolero & Azeez Adebimpe & Aaron F. Alexander-Bloch & Christos Davatzikos & Damien A. Fair & Ruben C. Gur & Raquel E. Gur & H, 2022. "Dissociable multi-scale patterns of development in personalized brain networks," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    17. Xiangli Li & Hongwei Liu & Xiuyun Zheng, 2012. "Non-monotone projection gradient method for non-negative matrix factorization," Computational Optimization and Applications, Springer, vol. 51(3), pages 1163-1171, April.
    18. Ding, Chris & Li, Tao & Peng, Wei, 2008. "On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing," Computational Statistics & Data Analysis, Elsevier, vol. 52(8), pages 3913-3927, April.
    19. Dominik P. Koller & Michael Schirner & Petra Ritter, 2024. "Human connectome topology directs cortical traveling waves and shapes frequency gradients," Nature Communications, Nature, vol. 15(1), pages 1-20, December.
    20. Morales José F. & Song Tingting & Auerbach Arleen D. & Wittkowski Knut M., 2008. "Phenotyping Genetic Diseases Using an Extension of µ-Scores for Multivariate Data," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 7(1), pages 1-20, June.

    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:gam:jmathe:v:11:y:2023:i:17:p:3785-:d:1232072. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.