{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:24:46Z","timestamp":1772119486785,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T00:00:00Z","timestamp":1726185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T00:00:00Z","timestamp":1726185600000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10115-024-02183-7","type":"journal-article","created":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T09:03:24Z","timestamp":1726218204000},"page":"273-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Spectral clustering with scale fairness constraints"],"prefix":"10.1007","volume":"67","author":[{"given":"Zhijing","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xujian","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,13]]},"reference":[{"key":"2183_CR1","unstructured":"Ng A, Jordan M, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Dietterich T, Becker S, Ghahramani Z (eds) Advances in neural information processing systems, vol 14, MIT Press"},{"key":"2183_CR2","doi-asserted-by":"crossref","unstructured":"Bo D, Wang X, Shi C, Zhu M, Lu E, Cui P (2020) Structural deep clustering network. In: Proceedings of the web conference 2020, pp 1400\u20131410","DOI":"10.1145\/3366423.3380214"},{"key":"2183_CR3","doi-asserted-by":"crossref","unstructured":"White S, Smyth P (2005) A spectral clustering approach to finding communities in graphs. In: Proceedings of the 2005 SIAM international conference on data mining. SIAM, pp 274\u2013285","DOI":"10.1137\/1.9781611972757.25"},{"key":"2183_CR4","unstructured":"Zelnik-Manor L, Perona P (2004) Self-tuning spectral clustering. In: Saul L, Weiss Y, Bottou L (eds) Advances in neural information processing systems, vol 17, MIT Press"},{"key":"2183_CR5","unstructured":"Zhou D, Bousquet O, Lal T, Weston J, Sch\u00f6lkopf B (2003) Learning with local and global consistency. In: Thrun S, Saul L, Sch\u00f6lkopf B (eds) Advances in neural information processing systems, vol 16, MIT Press"},{"issue":"1","key":"2183_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.patcog.2009.06.001","volume":"43","author":"H Ning","year":"2010","unstructured":"Ning H, Xu W, Chi Y, Gong Y, Huang TS (2010) Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recognit 43(1):113\u2013127","journal-title":"Pattern Recognit"},{"issue":"12","key":"2183_CR7","doi-asserted-by":"publisher","first-page":"4069","DOI":"10.1016\/j.patcog.2010.06.015","volume":"43","author":"F Tung","year":"2010","unstructured":"Tung F, Wong A, Clausi DA (2010) Enabling scalable spectral clustering for image segmentation. Pattern Recognit 43(12):4069\u20134076","journal-title":"Pattern Recognit"},{"key":"2183_CR8","doi-asserted-by":"crossref","unstructured":"Li Z, Chen J (2015) Superpixel segmentation using linear spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 1356\u20131363","DOI":"10.1109\/CVPR.2015.7298741"},{"issue":"11","key":"2183_CR9","doi-asserted-by":"publisher","first-page":"3636","DOI":"10.1016\/j.asoc.2012.05.026","volume":"12","author":"H Liu","year":"2012","unstructured":"Liu H, Zhao F, Jiao L (2012) Fuzzy spectral clustering with robust spatial information for image segmentation. Appl Soft Comput 12(11):3636\u20133647","journal-title":"Appl Soft Comput"},{"issue":"1","key":"2183_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.cam.2006.04.026","volume":"204","author":"DJ Higham","year":"2007","unstructured":"Higham DJ, Kalna G, Kibble M (2007) Spectral clustering and its use in bioinformatics. J Comput Appl Math 204(1):25\u201337","journal-title":"J Comput Appl Math"},{"issue":"13","key":"2183_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1093\/bioinformatics\/bty235","volume":"34","author":"N Nouri","year":"2018","unstructured":"Nouri N, Kleinstein SH (2018) A spectral clustering-based method for identifying clones from high-throughput b cell repertoire sequencing data. Bioinformatics 34(13):341\u2013349","journal-title":"Bioinformatics"},{"issue":"1","key":"2183_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.jedc.2007.01.034","volume":"32","author":"V Tola","year":"2008","unstructured":"Tola V, Lillo F, Gallegati M, Mantegna RN (2008) Cluster analysis for portfolio optimization. J Econ Dyn Control 32(1):235\u2013258","journal-title":"J Econ Dyn Control"},{"issue":"4","key":"2183_CR13","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1007\/s11135-021-01227-2","volume":"56","author":"RE Mansano","year":"2022","unstructured":"Mansano RE, Allem LE, Del-Vecchio RR, Hoppen C (2022) Balanced portfolio via signed graphs and spectral clustering in the Brazilian stock market. Qual Quant 56(4):2325\u20132340","journal-title":"Qual Quant"},{"key":"2183_CR14","unstructured":"Kleindessner M, Samadi S, Awasthi P, Morgenstern J (2019) Guarantees for spectral clustering with fairness constraints. In: International conference on machine learning. PMLR, pp 3458\u20133467"},{"key":"2183_CR15","doi-asserted-by":"crossref","unstructured":"Du X, Pei Y, Duivesteijn W, Pechenizkiy M (2020) Fairness in network representation by latent structural heterogeneity in observational data. In: National conference on artificial intelligence","DOI":"10.1609\/aaai.v34i04.5792"},{"key":"2183_CR16","unstructured":"Xia X, Hui Z, Chunming Y, Xujian Z, Bo L (2021) Fairness constraint of fuzzy c-means clustering improves clustering fairness. In: Asian conference on machine learning. PMLR, pp 113\u2013128"},{"key":"2183_CR17","doi-asserted-by":"crossref","unstructured":"Dai E, Wang S (2021) Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In: WSDM \u201921: the fourteenth ACM international conference on web search and data mining","DOI":"10.1145\/3437963.3441752"},{"key":"2183_CR18","doi-asserted-by":"publisher","unstructured":"Dong Y, Ma J, Wang S, Chen C, Li J (2023) Fairness in graph mining: a survey, IEEE Trans Knowl Data Eng 35(10):10583\u201310602. https:\/\/doi.org\/10.1109\/TKDE.2023.3265598","DOI":"10.1109\/TKDE.2023.3265598"},{"key":"2183_CR19","doi-asserted-by":"crossref","unstructured":"Kang J, He J, Maciejewski R, Tong H (2020) Inform: Individual fairness on graph mining. In: KDD \u201920: the 26th ACM SIGKDD conference on knowledge discovery and data mining","DOI":"10.1145\/3394486.3403080"},{"issue":"8","key":"2183_CR20","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.knosys.2010.06.003","volume":"23","author":"S Zhu","year":"2010","unstructured":"Zhu S, Wang D, Li T (2010) Data clustering with size constraints. Knowl Based Syst 23(8):883\u2013889","journal-title":"Knowl Based Syst"},{"issue":"1","key":"2183_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.60087\/jklst.vol1.n1.p138","volume":"1","author":"S Venkatasubbu","year":"2022","unstructured":"Venkatasubbu S, Krishnamoorthy G (2022) Ethical considerations in AI addressing bias and fairness in machine learning models. J Knowl Learn Sci Technol 1(1):130\u2013138","journal-title":"J Knowl Learn Sci Technol"},{"issue":"4","key":"2183_CR22","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"UV Luxburg","year":"2004","unstructured":"Luxburg UV (2004) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"issue":"2","key":"2183_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TPAMI.2004.1262179","volume":"26","author":"SX Yu","year":"2004","unstructured":"Yu SX, Shi J (2004) Segmentation given partial grouping constraints. IEEE Trans Pattern Anal Mach Intell 26(2):173\u2013183","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2183_CR24","unstructured":"He X, Cai D, Niyogi P (2005) Laplacian score for feature selection. In: Weiss Y, Sch\u00f6lkopf B, Platt J (eds) Advances in neural information processing systems, vol 18, MIT Press"},{"key":"2183_CR25","doi-asserted-by":"crossref","unstructured":"Dwork C, Hardt M, Pitassi T, Reingold O, Zemel R (2011) Fairness through awareness. In: Proceedings of the 3rd innovations in theoretical computer science conference","DOI":"10.1145\/2090236.2090255"},{"issue":"2","key":"2183_CR26","first-page":"8","volume":"50","author":"X Xia","year":"2023","unstructured":"Xia X, Hui Z, Chunming Y, Xujian Z, Bo L (2023) Fair method for spectral clustering to improve intra-cluster fairness. Comput Sci 50(2):8","journal-title":"Comput Sci"},{"key":"2183_CR27","unstructured":"Wang J, Lu D, Davidson I, Bai Z (2023) Scalable spectral clustering with group fairness constraints. In: International conference on artificial intelligence and statistics. PMLR, pp 6613\u20136629"},{"key":"2183_CR28","doi-asserted-by":"crossref","unstructured":"Fleisher W (2021) What\u2019s fair about individual fairness? In: Proceedings of the 2021 AAAI\/ACM conference on AI, ethics, and society, pp 480\u2013490","DOI":"10.1145\/3461702.3462621"},{"key":"2183_CR29","unstructured":"Gupta S, Dukkipati A (2021) Protecting individual interests across clusters: spectral clustering with guarantees. arXiv:2105.03714"},{"issue":"2","key":"2183_CR30","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1080\/08839514.2018.1530869","volume":"33","author":"SJ Nanda","year":"2019","unstructured":"Nanda SJ, Gulati I, Chauhan R, Modi R, Dhaked U (2019) A k-means-galactic swarm optimization-based clustering algorithm with Otsu\u2019s entropy for brain tumor detection. Appl Artif Intell 33(2):152\u2013170","journal-title":"Appl Artif Intell"},{"issue":"7","key":"2183_CR31","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1093\/comjnl\/bxab078","volume":"64","author":"M Liu","year":"2021","unstructured":"Liu M, Zhang B, Li X, Tang W, Zhang G (2021) An optimized k-means algorithm based on information entropy. Comput J 64(7):1130\u20131143","journal-title":"Comput J"},{"issue":"6","key":"2183_CR32","first-page":"285","volume":"8","author":"G Meng","year":"2014","unstructured":"Meng G, Dan L, Ni-hong W, Li-chen L (2014) A network intrusion detection model based on k-means algorithm and information entropy. Int J Secur Appl 8(6):285\u2013294","journal-title":"Int J Secur Appl"},{"key":"2183_CR33","doi-asserted-by":"crossref","unstructured":"Khan I, ALghafri M, Abdessalem A (2023) Entropy in fuzzy k-means algorithm for multi-view data. In: International conference on advances in computing research. Springer, pp 120\u2013133","DOI":"10.1007\/978-3-031-33743-7_10"},{"key":"2183_CR34","doi-asserted-by":"crossref","unstructured":"Jenssen R, Eltoft T, Girolami M, Erdogmus D (2006) Kernel maximum entropy data transformation and an enhanced spectral clustering algorithm. In: Sch\u00f6lkopf B, Platt J, Hoffman T (eds) Advances in neural information processing systems, vol 19, MIT Press","DOI":"10.7551\/mitpress\/7503.003.0084"},{"issue":"10\u201312","key":"2183_CR35","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1016\/j.neucom.2009.12.029","volume":"73","author":"F Zhao","year":"2010","unstructured":"Zhao F, Jiao L, Liu H, Gao X, Gong M (2010) Spectral clustering with eigenvector selection based on entropy ranking. Neurocomputing 73(10\u201312):1704\u20131717","journal-title":"Neurocomputing"},{"issue":"5","key":"2183_CR36","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.4304\/jsw.8.5.1101-1108","volume":"8","author":"H Jia","year":"2013","unstructured":"Jia H, Ding S, Zhu H, Wu F, Bao L (2013) A feature weighted spectral clustering algorithm based on knowledge entropy. J Softw 8(5):1101\u20131108","journal-title":"J Softw"},{"issue":"6","key":"2183_CR37","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/TBDATA.2020.3039036","volume":"7","author":"X Hu","year":"2020","unstructured":"Hu X, Zhang H, Yang C, Zhao X, Li B (2020) Regularized spectral clustering with entropy perturbation. IEEE Trans Big Data 7(6):967\u2013972","journal-title":"IEEE Trans Big Data"},{"key":"2183_CR38","doi-asserted-by":"crossref","unstructured":"Kumar D, Padhy BP (2022) Entropy based spectral clustering for distribution network with high penetration of DGS. In: 2022 22nd National power systems conference (NPSC). IEEE, pp 53\u201358","DOI":"10.1109\/NPSC57038.2022.10069479"},{"key":"2183_CR39","unstructured":"Jure Leskovec AK (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"2183_CR40","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, Radda K, Schensul JJ (2002) Social networks of drug users in high-risk sites: finding the connections. AIDS Behav 6:193\u2013206","journal-title":"AIDS Behav"},{"key":"2183_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.dib.2023.109521","volume":"50","author":"CG Fink","year":"2023","unstructured":"Fink CG, Omodt N, Zinnecker S, Sprint G (2023) A congressional twitter network dataset quantifying pairwise probability of influence. Data Brief 50:109521","journal-title":"Data Brief"},{"issue":"9","key":"2183_CR42","first-page":"0136497","volume":"10","author":"M Rossana","year":"2015","unstructured":"Rossana M, Julie F, Alain B, Cecile V (2015) Contact patterns in a high school: A comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE 10(9):0136497","journal-title":"PLoS ONE"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02183-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02183-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02183-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T07:07:07Z","timestamp":1738307227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02183-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,13]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2183"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02183-7","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3839431\/v1","asserted-by":"object"}]},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,13]]},"assertion":[{"value":"6 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2024","order":4,"name":"first_online","label":"First Online","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"}}]}}