{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:53:06Z","timestamp":1778226786079,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T00:00:00Z","timestamp":1658361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T00:00:00Z","timestamp":1658361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"project of Interface system software design, development, and test of accelerator physics control system PACS","award":["IMPJFCG20358"],"award-info":[{"award-number":["IMPJFCG20358"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>Methods for the multiview clustering and integration of multi-omics data have been developed recently to solve problems caused by data noise or limited sample size and to integrate multi-omics data with consistent (common) and differential cluster patterns. However, the integration of such data still suffers from limited performance and low accuracy.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>In this study, a computational framework for the multiview clustering method based on the penalty model is presented to overcome the challenges of low accuracy and limited performance in the case of integrating multi-omics data with consistent (common) and differential cluster patterns. The performance of the proposed method was evaluated on synthetic data and four real multi-omics data and then compared with approaches presented in the literature under different scenarios. Result implies that our method exhibits competitive performance compared with recently developed techniques when the underlying clusters are consistent with synthetic data. In the case of the differential clusters, the proposed method also presents an enhanced performance. In addition, with regards to real omics data, the developed method exhibits better performance, demonstrating its ability to provide more detailed information within each data type and working better to integrate multi-omics data with consistent (common) and differential cluster patterns. This study shows that the proposed method offers more significant differences in survival times across all types of cancer.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusions<\/jats:title>\n                <jats:p>A new multiview clustering method is proposed in this study based on synthetic and real data. This method performs better than other techniques previously presented in the literature in terms of integrating multi-omics data with consistent and differential cluster patterns and determining the significance of difference in survival times.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12859-022-04826-4","type":"journal-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T12:03:48Z","timestamp":1658405028000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multiview clustering of multi-omics data integration by using a penalty model"],"prefix":"10.1186","volume":"23","author":[{"given":"Hamas A.","family":"AL-kuhali","sequence":"first","affiliation":[]},{"given":"Ma","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Mohanned Abduljabbar","family":"Hael","sequence":"additional","affiliation":[]},{"given":"Eman A.","family":"Al-Hada","sequence":"additional","affiliation":[]},{"given":"Shamsan A.","family":"Al-Murisi","sequence":"additional","affiliation":[]},{"given":"Ahmed A.","family":"Al-kuhali","sequence":"additional","affiliation":[]},{"given":"Ammar A. Q.","family":"Aldaifl","sequence":"additional","affiliation":[]},{"given":"Mohammed Elmustafa","family":"Amin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"issue":"4","key":"4826_CR1","doi-asserted-by":"publisher","first-page":"1007677","DOI":"10.1371\/journal.pcbi.1007677","volume":"16","author":"ND Nguyen","year":"2020","unstructured":"Nguyen ND, Wang D. Multiview learning for understanding functional multiomics. PLoS Comput Biol. 2020;16(4):1007677.","journal-title":"PLoS Comput Biol"},{"issue":"7","key":"4826_CR2","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.4103\/ijo.IJO_313_21","volume":"69","author":"CL Shields","year":"2021","unstructured":"Shields CL, Mayro EL, Bas Z, Dockery PW, Yaghy A, Lally SE, Ganguly A, Shields JA. Ten-year outcomes of uveal melanoma based on the cancer genome atlas (TCGA) classification in 1001 cases. Indian J Ophthalmol. 2021;69(7):1839\u201345.","journal-title":"Indian J Ophthalmol"},{"issue":"4","key":"4826_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U. A tutorial on spectral clustering. Stat Comput. 2007;17(4):395\u2013416.","journal-title":"Stat Comput"},{"issue":"20","key":"4826_CR4","doi-asserted-by":"publisher","first-page":"11462","DOI":"10.1073\/pnas.201162998","volume":"98","author":"M West","year":"2001","unstructured":"West M, Blanchette C, Dressman H, Huang E, Ishida S, Spang R, Zuzan H, Olson JA, Marks JR, Nevins JR. Predicting the clinical status of human breast cancer by using gene expression profiles. Proc Natl Acad Sci. 2001;98(20):11462\u20137. https:\/\/doi.org\/10.1073\/pnas.201162998.","journal-title":"Proc Natl Acad Sci"},{"issue":"9369","key":"4826_CR5","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1016\/S0140-6736(03)13308-9","volume":"361","author":"E Huang","year":"2003","unstructured":"Huang E, Cheng SH, Dressman H, Pittman J, Tsou MH, Horng CF, Bild A, Iversen ES, Liao M, Chen CM, et al. Gene expression predictors of breast cancer outcomes. Lancet. 2003;361(9369):1590\u20136.","journal-title":"Lancet"},{"issue":"10","key":"4826_CR6","doi-asserted-by":"publisher","first-page":"3738","DOI":"10.1073\/pnas.0409462102","volume":"102","author":"HY Chang","year":"2005","unstructured":"Chang HY, Nuyten DS, Sneddon JB, Hastie T, Tibshirani R, S\u00f8rlie T, Dai H, He YD, van\u2019t Veer LJ, Bartelink H, et al. Robustness, scalability, and integration of a wound-response gene expression signature in predicting breast cancer survival. Proc Natl Acad Sci. 2005;102(10):3738\u201343.","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"4826_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1093\/bioinformatics\/17.2.126","volume":"17","author":"J Herrero","year":"2001","unstructured":"Herrero J, Valencia A, Dopazo J. A hierarchical unsupervised growing neural network for clustering gene expression patterns. Bioinformatics. 2001;17(2):126\u201336.","journal-title":"Bioinformatics"},{"issue":"12","key":"4826_CR8","doi-asserted-by":"publisher","first-page":"1896","DOI":"10.1093\/bioinformatics\/bth176","volume":"20","author":"KD Siegmund","year":"2004","unstructured":"Siegmund KD, Laird PW, Laird-Offringa IA. A comparison of cluster analysis methods using DNA methylation data. Bioinformatics. 2004;20(12):1896\u2013904.","journal-title":"Bioinformatics"},{"issue":"6","key":"4826_CR9","doi-asserted-by":"publisher","first-page":"1001106","DOI":"10.1371\/journal.pcbi.1001106","volume":"7","author":"W Li","year":"2011","unstructured":"Li W, Liu C-C, Zhang T, Li H, Waterman MS, Zhou XJ. Integrative analysis of many weighted co-expression networks using tensor computation. PLoS Comput Biol. 2011;7(6):1001106.","journal-title":"PLoS Comput Biol"},{"issue":"22","key":"4826_CR10","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1093\/bioinformatics\/btp543","volume":"25","author":"R Shen","year":"2009","unstructured":"Shen R, Olshen AB, Ladanyi M. Integrative clustering of multiple genomic data types using a joint latent variable model with application to breast and lung cancer subtype analysis. Bioinformatics. 2009;25(22):2906\u201312.","journal-title":"Bioinformatics"},{"issue":"4","key":"4826_CR11","doi-asserted-by":"publisher","first-page":"35236","DOI":"10.1371\/journal.pone.0035236","volume":"7","author":"R Shen","year":"2012","unstructured":"Shen R, Mo Q, Schultz N, Seshan VE, Olshen AB, Huse J, Ladanyi M, Sander C. Integrative subtype discovery in glioblastoma using iCluster. PLoS One. 2012;7(4):35236.","journal-title":"PLoS One"},{"issue":"12","key":"4826_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1093\/bioinformatics\/btv244","volume":"31","author":"NK Speicher","year":"2015","unstructured":"Speicher NK, Pfeifer N. Integrating different data types by regularized unsupervised multiple kernel learning with application to cancer subtype discovery. Bioinformatics. 2015;31(12):268\u201375.","journal-title":"Bioinformatics"},{"issue":"18","key":"4826_CR13","doi-asserted-by":"publisher","first-page":"3348","DOI":"10.1093\/bioinformatics\/btz058","volume":"35","author":"N Rappoport","year":"2019","unstructured":"Rappoport N, Shamir R. Nemo: cancer subtyping by integration of partial multi-omic data. Bioinformatics. 2019;35(18):3348\u201356.","journal-title":"Bioinformatics"},{"issue":"10","key":"4826_CR14","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1093\/bioinformatics\/bty866","volume":"35","author":"H Ding","year":"2019","unstructured":"Ding H, Sharpnack M, Wang C, Huang K, Machiraju R. Integrative cancer patient stratification via subspace merging. Bioinformatics. 2019;35(10):1653\u20139.","journal-title":"Bioinformatics"},{"issue":"1","key":"4826_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"Y-H Dai","year":"2005","unstructured":"Dai Y-H, Fletcher R. Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer Math. 2005;100(1):21\u201347.","journal-title":"Numer Math"},{"issue":"3","key":"4826_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1038\/nmeth.2810","volume":"11","author":"B Wang","year":"2014","unstructured":"Wang B, Mezlini AM, Demir F, Fiume M, Tu Z, Brudno M, Haibe-Kains B, Goldenberg A. Similarity network fusion for aggregating data types on a genomic scale. Nature Methods. 2014;11(3):333\u20137.","journal-title":"Nature Methods"},{"issue":"3","key":"4826_CR17","doi-asserted-by":"publisher","first-page":"1002955","DOI":"10.1371\/journal.pcbi.1002955","volume":"9","author":"D Amar","year":"2013","unstructured":"Amar D, Safer H, Shamir R. Dissection of regulatory networks that are altered in disease via differential co-expression. PLoS Comput Biol. 2013;9(3):1002955.","journal-title":"PLoS Comput Biol"},{"key":"4826_CR18","doi-asserted-by":"crossref","unstructured":"Li D, Brown JB, Orsini L, Pan Z, Hu G, He S. Moda: Module differential analysis for weighted gene co-expression network; 2016. arXiv preprint arXiv:1605.04739","DOI":"10.1101\/053496"},{"issue":"21","key":"4826_CR19","doi-asserted-by":"publisher","first-page":"3413","DOI":"10.1093\/bioinformatics\/btv406","volume":"31","author":"MJ Ha","year":"2015","unstructured":"Ha MJ, Baladandayuthapani V, Do K-A. Dingo: differential network analysis in genomics. Bioinformatics. 2015;31(21):3413\u201320.","journal-title":"Bioinformatics"},{"issue":"8","key":"4826_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11864-017-0492-y","volume":"18","author":"R Maxwell","year":"2017","unstructured":"Maxwell R, Jackson CM, Lim M. Clinical trials investigating immune checkpoint blockade in glioblastoma. Curr Treat Options Oncol. 2017;18(8):1\u201322.","journal-title":"Curr Treat Options Oncol"},{"issue":"5","key":"4826_CR21","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/TCBB.2015.2396073","volume":"12","author":"S Zhang","year":"2015","unstructured":"Zhang S, Zhao H, Ng MK. Functional module analysis for gene coexpression networks with network integration. IEEE\/ACM Trans Comput Biol Bioinform. 2015;12(5):1146\u201360.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"4826_CR22","first-page":"1413","volume":"24","author":"A Kumar","year":"2011","unstructured":"Kumar A, Rai P, Daume H. Co-regularized multi-view spectral clustering. Adv Neural Inf Process Syst. 2011;24:1413\u201321.","journal-title":"Adv Neural Inf Process Syst"},{"issue":"20","key":"4826_CR23","doi-asserted-by":"publisher","first-page":"4029","DOI":"10.1093\/bioinformatics\/btz217","volume":"35","author":"Y Yu","year":"2019","unstructured":"Yu Y, Zhang L-H, Zhang S. Simultaneous clustering of multiview biomedical data using manifold optimization. Bioinformatics. 2019;35(20):4029\u201337.","journal-title":"Bioinformatics"},{"issue":"3","key":"4826_CR24","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1109\/TSP.2007.908999","volume":"56","author":"TE Abrudan","year":"2008","unstructured":"Abrudan TE, Eriksson J, Koivunen V. Steepest descent algorithms for optimization under unitary matrix constraint. IEEE Trans Signal Process. 2008;56(3):1134\u201347.","journal-title":"IEEE Trans Signal Process"},{"issue":"3","key":"4826_CR25","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/78.984753","volume":"50","author":"JH Manton","year":"2002","unstructured":"Manton JH. Optimization algorithms exploiting unitary constraints. IEEE Trans Signal Process. 2002;50(3):635\u201350.","journal-title":"IEEE Trans Signal Process"},{"key":"4826_CR26","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.neucom.2004.11.035","volume":"67","author":"Y Nishimori","year":"2005","unstructured":"Nishimori Y, Akaho S. Learning algorithms utilizing quasi-geodesic flows on the Stiefel manifold. Neurocomputing. 2005;67:106\u201335.","journal-title":"Neurocomputing"},{"issue":"9","key":"4826_CR27","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1016\/j.sigpro.2009.03.015","volume":"89","author":"T Abrudan","year":"2009","unstructured":"Abrudan T, Eriksson J, Koivunen V. Conjugate gradient algorithm for optimization under unitary matrix constraint. Signal Process. 2009;89(9):1704\u201314.","journal-title":"Signal Process"},{"key":"4826_CR28","unstructured":"Dai X, Zhang L, Zhou A. Adaptive step size strategy for orthogonality constrained line search methods; 2019. arXiv preprint arXiv:1906.02883"},{"key":"4826_CR29","volume-title":"Optimization algorithms on matrix manifolds","author":"P-A Absil","year":"2009","unstructured":"Absil P-A, Mahony R, Sepulchre R. Optimization algorithms on matrix manifolds. Princeton: Princeton University Press; 2009."},{"issue":"2","key":"4826_CR30","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10107-014-0816-7","volume":"153","author":"B Jiang","year":"2015","unstructured":"Jiang B, Dai Y-H. A framework of constraint preserving update schemes for optimization on Stiefel manifold. Math Program. 2015;153(2):535\u201375.","journal-title":"Math Program"},{"issue":"1","key":"4826_CR31","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen Z, Yin W. A feasible method for optimization with orthogonality constraints. Math Program. 2013;142(1):397\u2013434.","journal-title":"Math Program"},{"issue":"1","key":"4826_CR32","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/16M1098759","volume":"28","author":"B Gao","year":"2018","unstructured":"Gao B, Liu X, Chen X, Yuan Y-X. A new first-order algorithmic framework for optimization problems with orthogonality constraints. SIAM J Optim. 2018;28(1):302\u201332.","journal-title":"SIAM J Optim"},{"key":"4826_CR33","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1852236","author":"N Xiao","year":"2020","unstructured":"Xiao N, Liu X, Yuan Y-X. A class of smooth exact penalty function methods for optimization problems with orthogonality constraints. Optim Methods Softw. 2020. https:\/\/doi.org\/10.1080\/10556788.2020.1852236.","journal-title":"Optim Methods Softw"},{"key":"4826_CR34","unstructured":"Huang H-C, Chuang Y-Y, Chen C-S. Affinity aggregation for spectral clustering. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, IEEE; 2012. p. 773\u2013780"},{"issue":"1","key":"4826_CR35","doi-asserted-by":"publisher","first-page":"2075","DOI":"10.1002\/nla.2075","volume":"24","author":"C Chen","year":"2017","unstructured":"Chen C, Ng MK, Zhang S. Block spectral clustering methods for multiple graphs. Numer Linear Algebra Appl. 2017;24(1):2075.","journal-title":"Numer Linear Algebra Appl"},{"issue":"3","key":"4826_CR36","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1137\/18M1221679","volume":"41","author":"B Gao","year":"2019","unstructured":"Gao B, Liu X, Yuan Y-X. Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J Sci Comput. 2019;41(3):1949\u201383.","journal-title":"SIAM J Sci Comput"},{"key":"4826_CR37","first-page":"849","volume":"14","author":"AY Ng","year":"2002","unstructured":"Ng AY, Jordan MI, Weiss Y. On spectral clustering: analysis and an algorithm. Adv Neural Inf Process Syst. 2002;14:849\u201356.","journal-title":"Adv Neural Inf Process Syst"},{"key":"4826_CR38","doi-asserted-by":"crossref","unstructured":"Veenstra P, Cooper C, Phelps S. Spectral clustering using the kNN-MST similarity graph. In2016 8th Computer Science and Electronic Engineering (CEEC), IEEE; 2016. pp. 222\u2013227.","DOI":"10.1109\/CEEC.2016.7835917"},{"issue":"50","key":"4826_CR39","doi-asserted-by":"publisher","first-page":"21068","DOI":"10.1073\/pnas.0907096106","volume":"106","author":"PJ Bickel","year":"2009","unstructured":"Bickel PJ, Chen A. A nonparametric view of network models and Newman\u2013Girvan and other modularities. Proc Natl Acad Sci. 2009;106(50):21068\u201373.","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"4826_CR40","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM. Two-point step size gradient methods. IMA J Numer Anal. 1988;8(1):141\u20138.","journal-title":"IMA J Numer Anal"},{"key":"4826_CR41","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw PJ. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math. 1987;20:53\u201365.","journal-title":"J Comput Appl Math"},{"key":"4826_CR42","unstructured":"Lemeshow S, May S, Hosmer DW. Applied survival Analysis: regression modeling of time-to-event data. In: Hosmer DW, Lemeshow S, May S, editors. Wiley in probability and statistics. Wiley; 2011. https:\/\/books.google.com\/books?id=IvvOopIqzWsC"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-022-04826-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-022-04826-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-022-04826-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T16:02:59Z","timestamp":1658678579000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-022-04826-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,21]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4826"],"URL":"https:\/\/doi.org\/10.1186\/s12859-022-04826-4","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,21]]},"assertion":[{"value":"18 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Only published data that are publicly available online were used in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"288"}}