{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:27:08Z","timestamp":1771705628442,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007103","name":"Semnan University","doi-asserted-by":"publisher","award":["CS1396-4-33"],"award-info":[{"award-number":["CS1396-4-33"]}],"id":[{"id":"10.13039\/501100007103","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11227-020-03429-1","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T10:02:53Z","timestamp":1600077773000},"page":"4107-4134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Ensemble-based clustering of large probabilistic graphs using neighborhood and distance metric learning"],"prefix":"10.1007","volume":"77","author":[{"given":"Malihe","family":"Danesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2273-2830","authenticated-orcid":false,"given":"Morteza","family":"Dorrigiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farzin","family":"Yaghmaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"key":"3429_CR1","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","volume":"22","author":"Z Zou","year":"2010","unstructured":"Zou Z, Li J, Gao H et al (2010) Mining frequent subgraph patterns from uncertain graph data. IEEE Trans Knowl Data Eng 22:1203\u20131218","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3429_CR2","doi-asserted-by":"crossref","unstructured":"Papapetrou O, Ioannou E, Skoutas D (2011) Efficient discovery of frequent subgraph patterns in uncertain graph databases. In: EDBT\/ICDT\u201911, pp 355\u2013366","DOI":"10.1145\/1951365.1951408"},{"issue":"1","key":"3429_CR3","doi-asserted-by":"publisher","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias M, Bonchi F, Gionis A et al (2010) k-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1):997\u20131008","journal-title":"Proc VLDB Endow"},{"key":"3429_CR4","first-page":"583","volume":"3","author":"A Strehl","year":"2003","unstructured":"Strehl A, Ghosh J (2003) Cluster ensembles\u2014A knowledge reuse framework for combining partitions. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"issue":"12","key":"3429_CR5","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TPAMI.2005.237","volume":"27","author":"A Topchy","year":"2005","unstructured":"Topchy A, Jain AK, Punch W (2005) Clustering ensembles: models of consensus and weak partitions. IEEE Trans Pattern Anal Mach Intell 27(12):1866\u20131881","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3429_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2018.12.007","volume":"273","author":"F Li","year":"2019","unstructured":"Li F, Qian Y, Wang J et al (2019) Clustering ensemble based on sample\u2019s stability. Artif Intell 273:37\u201355","journal-title":"Artif Intell"},{"key":"3429_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2018.01.003","volume":"28","author":"T Boongoen","year":"2018","unstructured":"Boongoen T, Iam-On N (2018) Cluster ensembles: a survey of approaches with recent extensions and applications. Comput Sci Rev 28:1\u201325","journal-title":"Comput Sci Rev"},{"key":"3429_CR8","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/s13042-017-0756-7","volume":"10","author":"T Alqurashi","year":"2019","unstructured":"Alqurashi T, Wang W (2019) Clustering ensemble method. Int J Mach Learn Cyb 10:1227\u20131246","journal-title":"Int J Mach Learn Cyb"},{"issue":"03","key":"3429_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1142\/S0218001411008683","volume":"25","author":"S Vega-Pons","year":"2011","unstructured":"Vega-Pons S, Ruiz-Shulcloper J (2011) A survey of clustering ensemble algorithms. Int J Pattern Recogn Artif Intell 25(03):337\u2013372","journal-title":"Int J Pattern Recogn Artif Intell"},{"issue":"2","key":"3429_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TKDE.2011.243","volume":"25","author":"G Kollios","year":"2013","unstructured":"Kollios G, Potamias M, Terzi E (2013) Clustering large probabilistic graphs. IEEE Trans Knowl Data Eng 25(2):325\u2013336","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3429_CR11","doi-asserted-by":"crossref","unstructured":"Ailon N, Charikar M, Newman A (2005) Aggregating Inconsistent Information: Ranking and Clustering. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp 684\u2013693","DOI":"10.1145\/1060590.1060692"},{"key":"3429_CR12","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2015.04.043","volume":"317","author":"Z Halim","year":"2015","unstructured":"Halim Z, Waqas M, Hussain SF (2015) Clustering large probabilistic graphs using multi-population evolutionary algorithm. Inf Sci 317:78\u201395","journal-title":"Inf Sci"},{"issue":"5","key":"3429_CR13","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1109\/TKDE.2013.123","volume":"26","author":"Y Gu","year":"2014","unstructured":"Gu Y, Gao C, Cong G et al (2014) Effective and efficient clustering methods for correlated probabilistic graphs. IEEE Trans Knowl Data Eng 26(5):1117\u20131130","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"3429_CR14","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1145\/3186728.3164143","volume":"11","author":"M Ceccarello","year":"2017","unstructured":"Ceccarello M, Fantozzi C, Pietracaprina A et al (2017) Clustering uncertain graphs. Proc VLDB Endowment 11(4):472\u2013544","journal-title":"Proc VLDB Endowment"},{"issue":"3","key":"3429_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12530-018-9223-2","volume":"10","author":"Z Halim","year":"2019","unstructured":"Halim Z, Khattak JH (2019) Density-based clustering of big probabilistic graphs. Evolv Syst 10(3):333\u2013350","journal-title":"Evolv Syst"},{"issue":"10","key":"3429_CR16","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1109\/TKDE.2018.2872553","volume":"31","author":"YX Qiu","year":"2018","unstructured":"Qiu YX, Li RH, Li J, Qiao S et al (2018) Efficient structural clustering on probabilistic graphs. IEEE Trans Knowl Data Eng 31(10):1954\u20131968","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1\u20132","key":"3429_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10994-013-5342-y","volume":"98","author":"N Iam-On","year":"2015","unstructured":"Iam-On N, Boongoen T (2015) Comparative study of matrix refinement approaches for ensemble clustering. Mach Learn 98(1\u20132):269\u2013300","journal-title":"Mach Learn"},{"issue":"6","key":"3429_CR18","first-page":"1212","volume":"32","author":"D Huang","year":"2019","unstructured":"Huang D, Wang CD, Wu JS et al (2019) Ultra-scalable spectral clustering and ensemble clustering. IEEE TKDE 32(6):1212\u20131226","journal-title":"IEEE TKDE"},{"issue":"12","key":"3429_CR19","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1109\/TPAMI.2011.84","volume":"33","author":"N Iam-On","year":"2011","unstructured":"Iam-On N, Boongoen T, Garrett S et al (2011) A link-based approach to the cluster ensemble problem. IEEE Trans Pattern Anal Mach Intell 33(12):2396\u20132409","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3429_CR20","doi-asserted-by":"crossref","unstructured":"Yi J, Yang T, Jin R et al (2012) Robust ensemble clustering by matrix completion. In: Proceedings of IEEE International Conference on Data Mining (ICDM)","DOI":"10.1109\/ICDM.2012.123"},{"issue":"6","key":"3429_CR21","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TPAMI.2005.113","volume":"27","author":"AN Fred","year":"2005","unstructured":"Fred AN, Jain AK (2005) Combining multiple clusterings using evidence accumulation. IEEE Trans Pattern Anal Mach Intell 27(6):835\u2013850","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1\u20132","key":"3429_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10994-013-5339-6","volume":"98","author":"A Louren\u00e7o","year":"2015","unstructured":"Louren\u00e7o A, Bul\u00f2 SR, Rebagliati N et al (2015) Probabilistic consensus clustering using evidence accumulation. Mach Learn 98(1\u20132):331\u2013357","journal-title":"Mach Learn"},{"key":"3429_CR23","doi-asserted-by":"crossref","unstructured":"Fern XZ, Brodley CE (2004) Solving cluster ensemble problems by bipartite graph partitioning. In: Proceedings of International Conference on Machine Learning (ICML)","DOI":"10.1145\/1015330.1015414"},{"issue":"5","key":"3429_CR24","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TKDE.2015.2503753","volume":"28","author":"D Huang","year":"2016","unstructured":"Huang D, Lai JH, Wang CD (2016) Robust ensemble clustering using probability trajectories. IEEE Trans Knowl Data Eng 28(5):1312\u20131326","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"3429_CR25","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1109\/TCYB.2017.2702343","volume":"48","author":"D Huang","year":"2018","unstructured":"Huang D, Wang CD, Lai JH (2018) Locally weighted ensemble clustering. IEEE Trans Cybern 48(5):1460\u20131473","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"3429_CR26","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"3429_CR27","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.patcog.2015.08.015","volume":"50","author":"D Huang","year":"2016","unstructured":"Huang D, Lai J, Wang CD (2016) Ensemble clustering using factor graph. Pattern Recogn 50:131\u2013142","journal-title":"Pattern Recogn"},{"issue":"2","key":"3429_CR28","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.patcog.2013.08.019","volume":"47","author":"L Franek","year":"2014","unstructured":"Franek L, Jiang X (2014) Ensemble clustering by means of clustering embedding in vector spaces. Pattern Recogn 47(2):833\u2013842","journal-title":"Pattern Recogn"},{"issue":"1","key":"3429_CR29","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10479-008-0352-z","volume":"167","author":"E Weiszfeld","year":"2009","unstructured":"Weiszfeld E, Plastria F (2009) On the point for which the sum of the distances to n given points is minimum. Ann Oper Res 167(1):7\u201341","journal-title":"Ann Oper Res"},{"key":"3429_CR30","unstructured":"Benjelloun O, Sarma AD, Halevy A et al (2006) ULDBs: databases with uncertainty and lineage. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), pp 953\u2013964"},{"key":"3429_CR31","doi-asserted-by":"crossref","unstructured":"Dalvi NN, Suciu D (2004) Efficient Query Evaluation on Probabilistic Databases. In: Proceedings of the 30th International Conference on Very Large Databases, Toronto, Canada.","DOI":"10.1016\/B978-012088469-8.50076-0"},{"issue":"1","key":"3429_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1217299.1217300","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Tsaparas P (2007) Clustering aggregation. ACM Trans Knowl Discov Data (TKDD) 1(1):1\u201330","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"6","key":"3429_CR33","doi-asserted-by":"publisher","first-page":"667","DOI":"10.14778\/3311880.3311884","volume":"12","author":"K Han","year":"2019","unstructured":"Han K, Gui F, Xiao X et al (2019) Efficient and effective algorithms for clustering uncertain graphs. Proc VLDB Endow 12(6):667\u2013680","journal-title":"Proc VLDB Endow"},{"issue":"1\u20132","key":"3429_CR34","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir R, Sharan R, Tsur D (2004) Cluster graph modification problems. Discrete Appl Math 144(1\u20132):173\u2013182","journal-title":"Discrete Appl Math"},{"key":"3429_CR35","unstructured":"Bian W, Tao D (2011) Learning a distance metric by empirical loss minimization. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp 1186\u20131191, Barcelona, Spain"},{"key":"3429_CR36","unstructured":"Luo Y, Wen Y, Tao D (2016) On combining side information and unlabeled data for heterogeneous multi-task metric learning. In: The 25th International Joint Conference on Artificial Intelligence, pp 1809\u20131815, New York"},{"issue":"12","key":"3429_CR37","doi-asserted-by":"publisher","first-page":"3600","DOI":"10.1016\/j.patcog.2008.05.018","volume":"41","author":"S Xiang","year":"2008","unstructured":"Xiang S, Nie F, Zhang C (2008) Learning a mahalanobis distance metric for data clustering and classification. Pattern Recogn 41(12):3600\u20133612","journal-title":"Pattern Recogn"},{"key":"3429_CR38","unstructured":"Xing EP, Ng AY, Jordan MI et al (2003) Distance metric learning with application to clustering with side-information. In: Proceedings of the 15th International Conference on Neural Information Processing Systems, pp 521\u2013528. Cambridge"},{"key":"3429_CR39","doi-asserted-by":"crossref","unstructured":"Law MT, Yu Y, Cord M et al (2016) Closed-form training of mahalanobis distance for supervised clustering. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 3909\u20133917, Las Vegas, NV","DOI":"10.1109\/CVPR.2016.424"},{"key":"3429_CR40","unstructured":"McFee B, Lanckriet GR (2010) Metric learning to rank. In: Proceedings of the 27th International Conference on Machine Learning, pp 775\u2013782, Haifa, Israel."},{"key":"3429_CR41","unstructured":"Mahalanobis PC (1936) On the generalized distance in statistics. In: Proceedings of the National Institute of Science, Calcutta, India"},{"key":"3429_CR42","volume-title":"Metric learning. Synthesis lectures on artificial intelligence and machine learning","author":"A Bellet","year":"2015","unstructured":"Bellet A, Habrard A, Sebban M (2015) Metric learning. Synthesis lectures on artificial intelligence and machine learning. Morgan & Claypool Publishers, San Rafael"},{"issue":"4","key":"3429_CR43","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1561\/2200000019","volume":"5","author":"B Kulis","year":"2012","unstructured":"Kulis B (2012) Metric learning: a survey. Found Trends Mach Learn 5(4):287\u2013364","journal-title":"Found Trends Mach Learn"},{"issue":"7084","key":"3429_CR44","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1038\/nature04670","volume":"440","author":"NJ Krogan","year":"2006","unstructured":"Krogan NJ et al (2006) Global landscape of protein complexes in the yeast saccharomyces cerevisiae. Nature 440(7084):637\u2013643","journal-title":"Nature"},{"key":"3429_CR45","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.compeleceng.2018.05.005","volume":"68","author":"X Wu","year":"2018","unstructured":"Wu X, Ma T, Cao J et al (2018) A comparative study of clustering ensemble algorithms. Comput & Electr Eng 68:603\u2013615","journal-title":"Comput & Electr Eng"},{"key":"3429_CR46","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/qj.3387","volume":"145","author":"M Leutbecher","year":"2018","unstructured":"Leutbecher M (2018) Ensemble size: how suboptimal is less than infinity? Q J R Meteorol Soc 145:107\u2013128","journal-title":"Q J R Meteorol Soc"},{"key":"3429_CR47","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1175\/1520-0493(1998)126<2503:IOESOE>2.0.CO;2","volume":"126","author":"R Buizza","year":"1998","unstructured":"Buizza R, Palmer TN (1998) Impact of ensemble size on ensemble prediction. Mon Weather Rev 126:2503\u20132518","journal-title":"Mon Weather Rev"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03429-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03429-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03429-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T01:03:19Z","timestamp":1631581399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03429-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,14]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["3429"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03429-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,14]]},"assertion":[{"value":"3 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}