{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:58:21Z","timestamp":1781225901809,"version":"3.54.1"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.knosys.2026.115999","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T06:16:51Z","timestamp":1776233811000},"page":"115999","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Clustering structure identification with ordering graph"],"prefix":"10.1016","volume":"343","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9710-082X","authenticated-orcid":false,"given":"Zheng","family":"Xing","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2819-990X","authenticated-orcid":false,"given":"Weibing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.115999_b1","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Von Luxburg","year":"2007","journal-title":"Stat. Comput."},{"key":"10.1016\/j.knosys.2026.115999_b2","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2026.115999_b3","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","article-title":"New spectral methods for ratio cut partitioning and clustering","volume":"11","author":"Hagen","year":"1992","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.knosys.2026.115999_b4","series-title":"The Thirty Seventh Annual Conference on Learning Theory","first-page":"498","article-title":"Metric clustering and mst with strong and weak distance oracles","author":"Bateni","year":"2024"},{"key":"10.1016\/j.knosys.2026.115999_b5","series-title":"Fusion of operators of computational graphs via greedy clustering: The xnnc experience","author":"Canesche","year":"2025"},{"key":"10.1016\/j.knosys.2026.115999_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.129054","article-title":"A fast sparse graph based clustering technique using dispersion of data points","volume":"618","author":"Akhter","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.knosys.2026.115999_b7","doi-asserted-by":"crossref","unstructured":"C. Ding, X. He, H.D. Simon, On the equivalence of nonnegative matrix factorization and spectral clustering, in: Proceedings of the 2005 SIAM International Conference on Data Mining, 2005, pp. 606\u2013610.","DOI":"10.1137\/1.9781611972757.70"},{"key":"10.1016\/j.knosys.2026.115999_b8","doi-asserted-by":"crossref","unstructured":"C. Ding, T. Li, W. Peng, H. Park, Orthogonal nonnegative matrix t-factorizations for clustering, in: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006, pp. 126\u2013135.","DOI":"10.1145\/1150402.1150420"},{"key":"10.1016\/j.knosys.2026.115999_b9","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.6717","article-title":"Minimum spanning tree-based cluster analysis: A new algorithm for determining inconsistent edges","volume":"34","author":"\u015eaar","year":"2022","journal-title":"Concurr. Comput.: Pr. Exp."},{"key":"10.1016\/j.knosys.2026.115999_b10","article-title":"Design and research of a new clustering algorithm for wireless sensor network","volume":"vol. 769","author":"Zhu","year":"2021"},{"key":"10.1016\/j.knosys.2026.115999_b11","first-page":"1","article-title":"A parameter-less algorithm for tensor co-clustering","author":"Battaglia","year":"2021","journal-title":"Mach. Learn."},{"key":"10.1016\/j.knosys.2026.115999_b12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/13658816.2021.1899184","article-title":"Snn_flow: a shared nearest-neighbor-based clustering method for inhomogeneous origin-destination flows","volume":"36","author":"Liu","year":"2022","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"10.1016\/j.knosys.2026.115999_b13","doi-asserted-by":"crossref","first-page":"2106","DOI":"10.1016\/j.aej.2021.08.009","article-title":"Algorithm optimization and anomaly detection simulation based on extended jarvis-patrick clustering and outlier detection","volume":"61","author":"Wang","year":"2022","journal-title":"Alex. Eng. J."},{"key":"10.1016\/j.knosys.2026.115999_b14","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1007\/s10489-020-01926-7","article-title":"Chameleon algorithm based on mutual k-nearest neighbors","volume":"51","author":"Zhang","year":"2021","journal-title":"Appl. Intell."},{"key":"10.1016\/j.knosys.2026.115999_b15","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.ins.2020.08.080","article-title":"Multi-view spectral clustering for uncertain objects","volume":"547","author":"Sharma","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.115999_b16","doi-asserted-by":"crossref","unstructured":"A. Beer, A. Draganov, E. Hohma, P. Jahn, C.M. Frey, I. Assent, Connecting the dots\u2013density-connectivity distance unifies dbscan, k-center and spectral clustering, in: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023, pp. 80\u201392.","DOI":"10.1145\/3580305.3599283"},{"key":"10.1016\/j.knosys.2026.115999_b17","doi-asserted-by":"crossref","unstructured":"A. Azarmehr, S. Behnezhad, R. Jayaram, J. Lacki, V. Mirrokni, P. Zhong, Massively parallel minimum spanning tree in general metric spaces, in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2025, pp. 143\u2013174.","DOI":"10.1137\/1.9781611978322.5"},{"key":"10.1016\/j.knosys.2026.115999_b18","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.ins.2021.06.008","article-title":"Discriminative group-sparsity constrained broad learning system for visual recognition","volume":"576","author":"Jin","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.115999_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109306","article-title":"Regularized discriminative broad learning system for image classification","volume":"251","author":"Jin","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.115999_b20","doi-asserted-by":"crossref","first-page":"4959","DOI":"10.1109\/TKDE.2021.3049540","article-title":"Pattern classification with corrupted labeling via robust broad learning system","volume":"34","author":"Jin","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2026.115999_b21","doi-asserted-by":"crossref","first-page":"16076","DOI":"10.1109\/TNNLS.2023.3291793","article-title":"Flexible label-induced manifold broad learning system for multiclass recognition","volume":"35","author":"Jin","year":"2023","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"10.1016\/j.knosys.2026.115999_b22","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.procir.2014.01.143","article-title":"Generation of block diagonal forms using hierarchical clustering for cell formation problems","volume":"17","author":"Li","year":"2014","journal-title":"Procedia CIRP"},{"key":"10.1016\/j.knosys.2026.115999_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.bspc.2022.103835","article-title":"An evidence accumulation based block diagonal cluster model for intent recognition from eeg","volume":"77","author":"Fu","year":"2022","journal-title":"Biomed. Signal Process. Control."},{"key":"10.1016\/j.knosys.2026.115999_b24","doi-asserted-by":"crossref","first-page":"2623","DOI":"10.1080\/00207549308956887","article-title":"Cluster first-sequence last heuristics for generating block diagonal forms for a machine-part matrix","volume":"31","author":"Chen","year":"1993","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.knosys.2026.115999_b25","series-title":"UAI","article-title":"A generative block-diagonal model for clustering","author":"Chen","year":"2016"},{"key":"10.1016\/j.knosys.2026.115999_b26","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1007\/s10044-023-01183-7","article-title":"Multiple kernel k-means clustering with block diagonal property","volume":"26","author":"Chen","year":"2023","journal-title":"Pattern Anal. Appl."},{"key":"10.1016\/j.knosys.2026.115999_b27","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/s11063-024-11589-x","article-title":"Consensus affinity graph learning via structure graph fusion and block diagonal representation for multiview clustering","volume":"56","author":"Gui","year":"2024","journal-title":"Neural Process. Lett."},{"key":"10.1016\/j.knosys.2026.115999_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.jocs.2024.102348","article-title":"Block-diagonal idiosyncratic covariance estimation in high-dimensional factor models for financial time series","author":"\u017digni\u0107","year":"2024","journal-title":"J. Comput. Sci."},{"key":"10.1016\/j.knosys.2026.115999_b29","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1109\/TPAMI.2018.2794348","article-title":"Subspace clustering by block diagonal representation","volume":"41","author":"Lu","year":"2018","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2026.115999_b30","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"vol. 96","author":"Ester","year":"1996"},{"key":"10.1016\/j.knosys.2026.115999_b31","doi-asserted-by":"crossref","unstructured":"R.J. Campello, D. Moulavi, J. Sander, Density-based clustering based on hierarchical density estimates, in: Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2013, pp. 160\u2013172.","DOI":"10.1007\/978-3-642-37456-2_14"},{"key":"10.1016\/j.knosys.2026.115999_b32","article-title":"The infinite gaussian mixture model","volume":"12","author":"Rasmussen","year":"1999","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.knosys.2026.115999_b33","series-title":"European Conference on Computer Vision","first-page":"347","article-title":"Robust and efficient subspace segmentation via least squares regression","author":"Lu","year":"2012"},{"key":"10.1016\/j.knosys.2026.115999_b34","article-title":"Greedy subspace clustering","volume":"27","author":"Park","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.knosys.2026.115999_b35","doi-asserted-by":"crossref","unstructured":"H. Hu, Z. Lin, J. Feng, J. Zhou, Smooth representation clustering, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2014, pp. 3834\u20133841.","DOI":"10.1109\/CVPR.2014.484"},{"key":"10.1016\/j.knosys.2026.115999_b36","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.cviu.2015.04.003","article-title":"Reweighted sparse subspace clustering","volume":"138","author":"Xu","year":"2015","journal-title":"Comput. Vis. Image Underst."},{"key":"10.1016\/j.knosys.2026.115999_b37","doi-asserted-by":"crossref","unstructured":"C. You, C.-G. Li, D.P. Robinson, R. Vidal, Oracle based active set algorithm for scalable elastic net subspace clustering, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 3928\u20133937.","DOI":"10.1109\/CVPR.2016.426"},{"key":"10.1016\/j.knosys.2026.115999_b38","series-title":"International Conference on Machine Learning","first-page":"2874","article-title":"Innovation pursuit: A new approach to the subspace clustering problem","author":"Rahmani","year":"2017"},{"key":"10.1016\/j.knosys.2026.115999_b39","doi-asserted-by":"crossref","first-page":"1537","DOI":"10.1109\/TPAMI.2019.2913863","article-title":"Subspace clustering via good neighbors","volume":"42","author":"Yang","year":"2019","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2026.115999_b40","unstructured":"J. Xie, R. Girshick, A. Farhadi, Unsupervised deep embedding for clustering analysis, in: International Conference on Machine Learning, 2016, pp. 478\u2013487."},{"key":"10.1016\/j.knosys.2026.115999_b41","unstructured":"B. Yang, X. Fu, N.D. Sidiropoulos, M. Hong, Towards k-means-friendly spaces: Simultaneous deep learning and clustering, in: International Conference on Machine Learning, 2017, pp. 3861\u20133870."},{"key":"10.1016\/j.knosys.2026.115999_b42","series-title":"The ar face database: Cvc technical report, 24","author":"Martinez","year":"1998"},{"key":"10.1016\/j.knosys.2026.115999_b43","series-title":"Columbia object image library (coil-100)","author":"Nene","year":"1996"},{"key":"10.1016\/j.knosys.2026.115999_b44","volume":"vol. 2","author":"Hastie","year":"2009"},{"key":"10.1016\/j.knosys.2026.115999_b45","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/34.927464","article-title":"From few to many: Illumination cone models for face recognition under variable lighting and pose","volume":"23","author":"Georghiades","year":"2001","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.knosys.2026.115999_b46","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","article-title":"Gradient-based learning applied to document recognition","volume":"86","author":"LeCun","year":"1998","journal-title":"Proc. IEEE"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126007252?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126007252?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:10:33Z","timestamp":1781223033000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126007252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":46,"alternative-id":["S0950705126007252"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115999","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Clustering structure identification with ordering graph","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115999","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115999"}}