{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T06:16:27Z","timestamp":1774851387632,"version":"3.50.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:00:00Z","timestamp":1771977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:00:00Z","timestamp":1771977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10618-026-01194-y","type":"journal-article","created":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T14:12:44Z","timestamp":1772028764000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph pre-processing method for fairness in spectral clustering"],"prefix":"10.1007","volume":"40","author":[{"given":"Adithya K.","family":"Moorthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Vijaya","family":"Saradhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhanu","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,25]]},"reference":[{"key":"1194_CR1","first-page":"21050","volume":"33","author":"S Ahmadian","year":"2020","unstructured":"Ahmadian S, Epasto A, Knittel M et al (2020) Fair hierarchical clustering. Adv Neural Inf Process Syst 33:21050\u201321060","journal-title":"Adv Neural Inf Process Syst"},{"key":"1194_CR2","unstructured":"Angwin J (2016) Machine bias: Propublica. https:\/\/www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing"},{"key":"1194_CR3","unstructured":"Backurs A, Indyk P, Onak K, et al. (2019) Scalable fair clustering. In: International Conference on Machine Learning, PMLR, pp 405\u2013413"},{"key":"1194_CR4","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s10618-014-0386-6","volume":"29","author":"S Bandyopadhyay","year":"2015","unstructured":"Bandyopadhyay S, Wolfson J, Vock DM et al (2015) Data mining for censored time-to-event data: a bayesian network model for predicting cardiovascular risk from electronic health record data. Data Min Knowl Disc 29:1033\u20131069","journal-title":"Data Min Knowl Disc"},{"key":"1194_CR5","doi-asserted-by":"publisher","DOI":"10.24432\/C5XW20","author":"B Becker","year":"1996","unstructured":"Becker B, Kohavi R (1996) Adult. UCI Mach Learn Reposit. https:\/\/doi.org\/10.24432\/C5XW20","journal-title":"UCI Mach Learn Reposit"},{"key":"1194_CR6","unstructured":"Bera SK, Chakrabarty D, Flores NJ, et al. (2019) Fair algorithms for clustering. Advances in Neural Information Processing Systems 32(NeurIPS). arXiv:1901.02393"},{"key":"1194_CR7","unstructured":"Bercea IO, Gro\u00df M, Khuller S, et al. (2018) On the cost of essentially fair clusterings. arXiv preprint arXiv:1811.10319"},{"key":"1194_CR8","unstructured":"B\u00f6hm M, Fazzone A, Leonardi S, et al. (2020) Fair clustering with multiple colors. arXiv preprint arXiv:2002.07892"},{"key":"1194_CR9","doi-asserted-by":"publisher","unstructured":"Buet-Golfouse F, Utyagulov I (2022) Towards fair unsupervised learning. ACM international conference proceeding series p 1399\u20131409. https:\/\/doi.org\/10.1145\/3531146.3533197","DOI":"10.1145\/3531146.3533197"},{"key":"1194_CR10","unstructured":"Buolamwini J, Gebru T (2018) Gender shades: Intersectional accuracy disparities in commercial gender classification. In: Conference on fairness, accountability and transparency, PMLR, pp 77\u201391"},{"issue":"10","key":"1194_CR11","doi-asserted-by":"publisher","first-page":"7211","DOI":"10.1109\/TCOMM.2019.2927561","volume":"67","author":"A Celik","year":"2019","unstructured":"Celik A, Tsai MC, Radaydeh RM et al (2019) Distributed user clustering and resource allocation for imperfect noma in heterogeneous networks. IEEE Trans Commun 67(10):7211\u20137227","journal-title":"IEEE Trans Commun"},{"key":"1194_CR12","doi-asserted-by":"crossref","unstructured":"Chhabra A, Mohapatra P (2022) Fair algorithms for hierarchical agglomerative clustering. In: 2022 21st IEEE international conference on machine learning and applications (ICMLA), IEEE, pp 206\u2013211","DOI":"10.1109\/ICMLA55696.2022.00036"},{"key":"1194_CR13","doi-asserted-by":"publisher","first-page":"130698","DOI":"10.1109\/ACCESS.2021.3114099","volume":"9","author":"A Chhabra","year":"2021","unstructured":"Chhabra A, Masalkovaite K, Mohapatra P (2021) An overview of fairness in clustering. IEEE Access 9:130698\u2013130720. https:\/\/doi.org\/10.1109\/ACCESS.2021.3114099","journal-title":"IEEE Access"},{"key":"1194_CR14","unstructured":"Chierichetti F, Kumar R, Lattanzi S, et al. (2017) Fair clustering through fairlets. Advances in Neural Information Processing Systems 2017-Decem:5030\u20135038. ArXiv: 1802.05733"},{"issue":"2","key":"1194_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00012580","volume":"6","author":"F Chung","year":"2002","unstructured":"Chung F, Lu L (2002) Connected components in random graphs with given expected degree sequences. Ann Comb 6(2):125\u2013145","journal-title":"Ann Comb"},{"issue":"4","key":"1194_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3321386","volume":"66","author":"V Cohen-Addad","year":"2019","unstructured":"Cohen-Addad V, Kanade V, Mallmann-Trenn F et al (2019) Hierarchical clustering: objective functions and algorithms. J ACM (JACM) 66(4):1\u201342","journal-title":"J ACM (JACM)"},{"key":"1194_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.euroecorev.2016.03.011","volume":"90","author":"S Currarini","year":"2016","unstructured":"Currarini S, Matheson J, Vega-Redondo F (2016) A simple model of homophily in social networks. Eur Econ Rev 90:18\u201339","journal-title":"Eur Econ Rev"},{"key":"1194_CR18","doi-asserted-by":"publisher","unstructured":"Current S, He Y, Gurukar S, et al. (2022) Fairegm: Fair link prediction and recommendation via emulated graph modification. In: Equity and Access in Algorithms, Mechanisms, and Optimization, p 1\u201314, https:\/\/doi.org\/10.1145\/3551624.3555287, arXiv:2201.11596 [cs]","DOI":"10.1145\/3551624.3555287"},{"issue":"4","key":"1194_CR19","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1007\/s10618-022-00893-6","volume":"37","author":"I Davidson","year":"2023","unstructured":"Davidson I, Bai Z, Tran CM et al (2023) Making clusterings fairer by post-processing: algorithms, complexity results and experiments. Data Min Knowl Disc 37(4):1404\u20131440","journal-title":"Data Min Knowl Disc"},{"issue":"6","key":"1194_CR20","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1007\/s10618-022-00854-z","volume":"36","author":"A Fabris","year":"2022","unstructured":"Fabris A, Messina S, Silvello G et al (2022) Algorithmic fairness datasets: the story so far. Data Min Knowl Disc 36(6):2074\u20132152","journal-title":"Data Min Knowl Disc"},{"key":"1194_CR21","doi-asserted-by":"publisher","unstructured":"Feldman M, Friedler SA, Moeller J, et al. (2015) Certifying and removing disparate impact. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, KDD \u201915, p 259\u2013268, https:\/\/doi.org\/10.1145\/2783258.2783311","DOI":"10.1145\/2783258.2783311"},{"issue":"5","key":"1194_CR22","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1037\/a0020961","volume":"99","author":"FJ Flynn","year":"2010","unstructured":"Flynn FJ, Reagans RE, Guillory L (2010) Do you two know each other? transitivity, homophily, and the need for (network) closure. J Pers Soc Psychol 99(5):855","journal-title":"J Pers Soc Psychol"},{"issue":"3\u20135","key":"1194_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"1194_CR24","doi-asserted-by":"crossref","unstructured":"Foryciarz A, Pfohl SR, Patel B, et al. (2022) Evaluating algorithmic fairness in the presence of clinical guidelines: the case of atherosclerotic cardiovascular disease risk estimation. BMJ Health & Care Informatics 29(1). https:\/\/doi.org\/10.1136\/bmjhci-2021-100460, https:\/\/informatics.bmj.com\/content\/29\/1\/e100460, https:\/\/informatics.bmj.com\/content\/29\/1\/e100460.full.pdf","DOI":"10.1136\/bmjhci-2021-100460"},{"key":"1194_CR25","doi-asserted-by":"publisher","unstructured":"Gu M, Yang G, Zhou S, et al. (2023) Homophily-enhanced structure learning for graph clustering. In: Proceedings of the 32nd ACM International Conference on Information and Knowledge Management. Association for Computing Machinery, New York, NY, USA, CIKM \u201923, p 577\u2013586, https:\/\/doi.org\/10.1145\/3583780.3614915","DOI":"10.1145\/3583780.3614915"},{"key":"1194_CR26","first-page":"13527","volume":"35","author":"S Gupta","year":"2022","unstructured":"Gupta S, Dukkipati A (2022) Consistency of constrained spectral clustering under graph induced fair planted partitions. Adv Neural Inf Process Syst 35:13527\u201313540","journal-title":"Adv Neural Inf Process Syst"},{"key":"1194_CR27","doi-asserted-by":"crossref","unstructured":"Gupta S, Ghalme G, Krishnan NC, et al. (2023) Efficient algorithms for fair clustering with a new notion of fairness. Data Mining and Knowledge Discovery pp 1\u201339","DOI":"10.1007\/s10618-023-00928-6"},{"key":"1194_CR28","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1007\/s10618-014-0385-7","volume":"29","author":"R Henriques","year":"2015","unstructured":"Henriques R, Antunes C, Madeira SC (2015) Generative modeling of repositories of health records for predictive tasks. Data Min Knowl Disc 29:999\u20131032","journal-title":"Data Min Knowl Disc"},{"key":"1194_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2019.103291","volume":"99","author":"L Huang","year":"2019","unstructured":"Huang L, Shea AL, Qian H et al (2019) Patient clustering improves efficiency of federated machine learning to predict mortality and hospital stay time using distributed electronic medical records. J Biomed Inform 99:103291","journal-title":"J Biomed Inform"},{"key":"1194_CR30","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-540-92185-1_3","volume-title":"Internet and Network Economics Lecture Notes in Computer Science","author":"MO Jackson","year":"2008","unstructured":"Jackson MO (2008) Average distance, diameter, and clustering in social networks with homophily. In: Papadimitriou C, Zhang S (eds) Internet and Network Economics Lecture Notes in Computer Science. Springer, Berlin Heidelberg, pp 4\u201311. https:\/\/doi.org\/10.1007\/978-3-540-92185-1_3"},{"key":"1194_CR31","doi-asserted-by":"crossref","unstructured":"Kamani MM, Haddadpour F, Forsati R, et al. (2022) Efficient fair principal component analysis. Machine Learning pp 1\u201332","DOI":"10.1007\/s10994-021-06100-9"},{"issue":"5","key":"1194_CR32","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1109\/TCYB.2018.2887094","volume":"50","author":"Z Kang","year":"2020","unstructured":"Kang Z, Pan H, Hoi SCH et al (2020) Robust graph learning from noisy data. IEEE Trans Cybern 50(5):1833\u20131843. https:\/\/doi.org\/10.1109\/TCYB.2018.2887094","journal-title":"IEEE Trans Cybern"},{"issue":"9","key":"1194_CR33","doi-asserted-by":"publisher","first-page":"8976","DOI":"10.1109\/TCYB.2021.3061660","volume":"52","author":"Z Kang","year":"2022","unstructured":"Kang Z, Lin Z, Zhu X et al (2022) Structured graph learning for scalable subspace clustering: From single view to multiview. IEEE Trans Cybern 52(9):8976\u20138986. https:\/\/doi.org\/10.1109\/TCYB.2021.3061660","journal-title":"IEEE Trans Cybern"},{"key":"1194_CR34","doi-asserted-by":"publisher","unstructured":"Kang Z, Xie X, Li B, et al. (2024) Cdc: A simple framework for complex data clustering. IEEE Transactions on Neural Networks and Learning Systems pp 1\u201312. https:\/\/doi.org\/10.1109\/TNNLS.2024.3473618","DOI":"10.1109\/TNNLS.2024.3473618"},{"issue":"6","key":"1194_CR35","doi-asserted-by":"publisher","first-page":"8811","DOI":"10.1007\/s11042-021-11857-1","volume":"82","author":"KZ Khanam","year":"2023","unstructured":"Khanam KZ, Srivastava G, Mago V (2023) The homophily principle in social network analysis: a survey. Multim Tools Appl 82(6):8811\u20138854","journal-title":"Multim Tools Appl"},{"key":"1194_CR36","unstructured":"Kleindessner M, Samadi S, Awasthi P, et al. (2019) Guarantees for spectral clustering with fairness constraints. 36th International Conference on Machine Learning, ICML 2019 2019-June:6004\u20136030. ArXiv: 1901.08668"},{"key":"1194_CR37","unstructured":"Kurras S, Luxburg U, Blanchard G (2014) The f-adjusted graph laplacian: A diagonal modification with a geometric interpretation. In: International Conference on Machine Learning, PMLR, pp 1530\u20131538"},{"key":"1194_CR38","unstructured":"Li X, Zhu R, Cheng Y, et al. (2022) Finding global homophily in graph neural networks when meeting heterophily. In: International Conference on Machine Learning, PMLR, pp 13242\u201313256"},{"key":"1194_CR39","doi-asserted-by":"crossref","unstructured":"Liu S, Vicente LN (2022) A stochastic alternating balance k-means algorithm for fair clustering. In: International Conference on Learning and Intelligent Optimization, Springer, pp 77\u201392","DOI":"10.1007\/978-3-031-24866-5_6"},{"key":"1194_CR40","unstructured":"Maier M, Luxburg U, Hein M (2008) Influence of graph construction on graph-based clustering measures. Advances in neural information processing systems 21"},{"key":"1194_CR41","doi-asserted-by":"publisher","unstructured":"Manolis K, Pitoura E (2024) Modularity-based fairness in community detection. In: Proceedings of the 2023 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining. Association for Computing Machinery, New York, NY, USA, ASONAM \u201923, p 126\u2013130, https:\/\/doi.org\/10.1145\/3625007.3627518","DOI":"10.1145\/3625007.3627518"},{"key":"1194_CR42","doi-asserted-by":"publisher","unstructured":"Masrour F, Wilson T, Yan H, et al. (2020) Bursting the filter bubble: Fairness-aware network link prediction. AAAI 2020\u201334th AAAI Conference on Artificial Intelligence pp 841\u2013848. https:\/\/doi.org\/10.1609\/aaai.v34i01.5429, citation Key: Masrour 2020","DOI":"10.1609\/aaai.v34i01.5429"},{"issue":"9","key":"1194_CR43","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136497","volume":"10","author":"R Mastrandrea","year":"2015","unstructured":"Mastrandrea R, Fournet J, Barrat A (2015) Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9):e0136497","journal-title":"PLoS ONE"},{"issue":"1","key":"1194_CR44","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: Homophily in social networks. Ann Rev Sociol 27(1):415\u2013444","journal-title":"Ann Rev Sociol"},{"issue":"4","key":"1194_CR45","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1086\/708142","volume":"125","author":"D Melamed","year":"2020","unstructured":"Melamed D, Sweitzer M, Simpson B et al (2020) Homophily and segregation in cooperative networks. Am J Sociol 125(4):1084\u20131127","journal-title":"Am J Sociol"},{"key":"1194_CR46","doi-asserted-by":"publisher","unstructured":"Moro S. CPRita P. (2012) Bank Marketing. UCI Machine Learning Repository, https:\/\/doi.org\/10.24432\/C5K306","DOI":"10.24432\/C5K306"},{"key":"1194_CR47","unstructured":"Moseley B, Wang J (2017) Approximation bounds for hierarchical clustering: Average linkage, bisecting k-means, and local search. In: Guyon I, Luxburg UV, Bengio S, et al. (eds) Advances in Neural Information Processing Systems, vol 30. Curran Associates Inc, https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/d8d31bd778da8bdd536187c36e48892b-Paper.pdf"},{"issue":"2","key":"1194_CR48","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"23","key":"1194_CR49","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"key":"1194_CR50","unstructured":"O\u2019neil C (2017) Weapons of math destruction: How big data increases inequality and threatens democracy. Crown"},{"key":"1194_CR51","unstructured":"Pei H, Wei B, Chang KCC, et al. (2020) Geom-gcn: Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287"},{"issue":"3","key":"1194_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3494672","volume":"55","author":"D Pessach","year":"2023","unstructured":"Pessach D, Shmueli E (2023) A review on fairness in machine learning. ACM Comput Surv 55(3):1\u201344. https:\/\/doi.org\/10.1145\/3494672","journal-title":"ACM Comput Surv"},{"issue":"3","key":"1194_CR53","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1016\/j.ijforecast.2019.11.005","volume":"36","author":"A Petropoulos","year":"2020","unstructured":"Petropoulos A, Siakoulis V, Stavroulakis E et al (2020) Predicting bank insolvencies using machine learning techniques. Int J Forecast 36(3):1092\u20131113","journal-title":"Int J Forecast"},{"key":"1194_CR54","unstructured":"Samadi S, Tantipongpipat U, Morgenstern J, et al. (2018) The price of fair pca: One extra dimension. Advances in Neural Information Processing Systems 2018-Decem(Nips):10976\u201310987. ArXiv: 1811.00103"},{"key":"1194_CR55","doi-asserted-by":"crossref","unstructured":"Schmidt M, Schwiegelshohn C, Sohler C (2020) Fair coresets and streaming algorithms for fair k-means. In: Approximation and Online Algorithms: 17th International Workshop, WAOA 2019, Munich, Germany, September 12\u201313, 2019, Revised Selected Papers 17, Springer, pp 232\u2013251","DOI":"10.1007\/978-3-030-39479-0_16"},{"issue":"35","key":"1194_CR56","doi-asserted-by":"publisher","first-page":"12758","DOI":"10.1073\/pnas.0800497105","volume":"105","author":"\u00d6 \u015eim\u015fek","year":"2008","unstructured":"\u015eim\u015fek \u00d6, Jensen D (2008) Navigating networks by using homophily and degree. Proc Natl Acad Sci 105(35):12758\u201312762","journal-title":"Proc Natl Acad Sci"},{"issue":"3","key":"1194_CR57","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TAI.2021.3133818","volume":"3","author":"I Spinelli","year":"2022","unstructured":"Spinelli I, Scardapane S, Hussain A et al (2022) Fairdrop: biased edge dropout for enhancing fairness in graph representation learning. IEEE Trans Artif Intell 3(3):344\u2013354","journal-title":"IEEE Trans Artif Intell"},{"issue":"12","key":"1194_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/info9120325","volume":"9","author":"CE Taylor","year":"2018","unstructured":"Taylor CE, Mantzaris AV, Garibay I (2018) Exploring how homophily and accessibility can facilitate polarization in social networks. Information (Switzerland) 9(12):1\u201318. https:\/\/doi.org\/10.3390\/info9120325","journal-title":"Information (Switzerland)"},{"issue":"17","key":"1194_CR59","doi-asserted-by":"publisher","first-page":"10594","DOI":"10.3390\/ijerph191710594","volume":"19","author":"GV Travaini","year":"2022","unstructured":"Travaini GV, Pacchioni F, Bellumore S et al (2022) Machine learning and criminal justice: A systematic review of advanced methodology for recidivism risk prediction. Int J Environ Res Public Health 19(17):10594","journal-title":"Int J Environ Res Public Health"},{"issue":"4","key":"1194_CR60","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 (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416. https:\/\/doi.org\/10.1007\/s11222-007-9033-z. arXiv: 0711.0189","journal-title":"Stat Comput"},{"key":"1194_CR61","unstructured":"Wang J, Lu D, Davidson I, et al. (2023) Scalable spectral clustering with group fairness constraints. In: International Conference on Artificial Intelligence and Statistics, PMLR, pp 6613\u20136629"},{"key":"1194_CR62","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1015457400897","volume":"6","author":"MR Weeks","year":"2002","unstructured":"Weeks MR, Clair S, Borgatti SP et al (2002) Social networks of drug users in high-risk sites: Finding the connections. AIDS Behav 6:193\u2013206","journal-title":"AIDS Behav"},{"key":"1194_CR63","doi-asserted-by":"crossref","unstructured":"Wei T, He J (2022) Comprehensive fair meta-learned recommender system. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp 1989\u20131999","DOI":"10.1145\/3534678.3539269"},{"key":"1194_CR64","doi-asserted-by":"crossref","unstructured":"Yang L, Zhan X, Chen D, et al. (2019) Learning to cluster faces on an affinity graph. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 2298\u20132306","DOI":"10.1109\/CVPR.2019.00240"},{"key":"1194_CR65","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.neucom.2020.06.002","volume":"412","author":"Y Yang","year":"2020","unstructured":"Yang Y, Liu H, Guan Z et al (2020) Cohomo: A cluster-attribute correlation aware graph clustering framework. Neurocomputing 412:327\u2013338. https:\/\/doi.org\/10.1016\/j.neucom.2020.06.002","journal-title":"Neurocomputing"},{"key":"1194_CR66","doi-asserted-by":"publisher","DOI":"10.24432\/C55S3H","author":"IC Yeh","year":"2016","unstructured":"Yeh IC (2016) default of credit card clients. UCI Machine Learning Repository. https:\/\/doi.org\/10.24432\/C55S3H","journal-title":"UCI Machine Learning Repository"},{"key":"1194_CR67","first-page":"7793","volume":"33","author":"J Zhu","year":"2020","unstructured":"Zhu J, Yan Y, Zhao L et al (2020) Beyond homophily in graph neural networks: Current limitations and effective designs. Adv Neural Inf Process Syst 33:7793\u20137804","journal-title":"Adv Neural Inf Process Syst"}],"updated-by":[{"DOI":"10.1007\/s10618-026-01199-7","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:00:00Z","timestamp":1773792000000}}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01194-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-026-01194-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01194-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T04:53:53Z","timestamp":1774846433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-026-01194-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,25]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1194"],"URL":"https:\/\/doi.org\/10.1007\/s10618-026-01194-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,25]]},"assertion":[{"value":"18 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"In this article, there are textual errors on pages 12, 20, and 25 in the previous version and have now been corrected in the original publication.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":8,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":9,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10618-026-01199-7","URL":"https:\/\/doi.org\/10.1007\/s10618-026-01199-7","order":11,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"20"}}