{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T18:24:31Z","timestamp":1744395871093,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653507"},{"type":"electronic","value":"9783030653514"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_49","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"610-622","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Applying Fairness Constraints on Graph Node Ranks Under Personalization Bias"],"prefix":"10.1007","author":[{"given":"Emmanouil","family":"Krasanakis","sequence":"first","affiliation":[]},{"given":"Symeon","family":"Papadopoulos","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Kompatsiaris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"issue":"2","key":"49_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1089\/big.2016.0047","volume":"5","author":"A Chouldechova","year":"2017","unstructured":"Chouldechova, A.: Fair prediction with disparate impact: a study of bias in recidivism prediction instruments. Big data 5(2), 153\u2013163 (2017)","journal-title":"Big data"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1257\/pandp.20181018","volume":"108","author":"J Kleinberg","year":"2018","unstructured":"Kleinberg, J., Ludwig, J., Mullainathan, S., Rambachan, A.: Algorithmic fairness. AEA Papers Proc. 108, 22\u201327 (2018)","journal-title":"AEA Papers Proc."},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Krasanakis, E., Spyromitros-Xioufis, E., Papadopoulos, S., Kompatsiaris, Y.: Adaptive sensitive reweighting to mitigate bias in fairness-aware classification. In: Proceedings of the 2018 World Wide Web Conference, pp. 853\u2013862 (2018)","DOI":"10.1145\/3178876.3186133"},{"issue":"75","key":"49_CR4","first-page":"1","volume":"20","author":"MB Zafar","year":"2019","unstructured":"Zafar, M.B., Valera, I., Gomez-Rodriguez, M., Gummadi, K.P.: Fairness constraints: a flexible approach for fair classification. J. Mach. Learn. Res. 20(75), 1\u201342 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"49_CR5","first-page":"e1356","volume":"10","author":"E Ntoutsi","year":"2020","unstructured":"Ntoutsi, E., Fafalios, P., Gadiraju, U., Iosifidis, V., Nejdl, W., Vidal, M.-E., Ruggieri, S., Turini, F., Papadopoulos, S., Krasanakis, E., et al.: Bias in data-driven artificial intelligence systems-an introductory survey. Wiley Interdiscip. Rev.: Data Min. Knowl. Disc. 10(3), e1356 (2020)","journal-title":"Wiley Interdiscip. Rev.: Data Min. Knowl. Disc."},{"key":"49_CR6","unstructured":"Biddle, D.: Adverse Impact and Test Validation: A Practitioner\u2019s Guide To Valid and Defensible Employment Testing. Gower Publishing, Ltd. (2006)"},{"issue":"2","key":"49_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10618-010-0190-x","volume":"21","author":"T Calders","year":"2010","unstructured":"Calders, T., Verwer, S.: Three Naive Bayes approaches for discrimination-free classification. Data Min. Knowl. Disc. 21(2), 277\u2013292 (2010)","journal-title":"Data Min. Knowl. Disc."},{"issue":"1","key":"49_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-011-0463-8","volume":"33","author":"F Kamiran","year":"2012","unstructured":"Kamiran, F., Calders, T.: Data preprocessing techniques for classification without discrimination. Knowl. Inform. Syst. 33(1), 1\u201333 (2012)","journal-title":"Knowl. Inform. Syst."},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, S.A., Moeller, J., Scheidegger, C., Venkatasubramanian, S.: Certifying and removing disparate impact. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 259\u2013268 (2015)","DOI":"10.1145\/2783258.2783311"},{"issue":"4","key":"49_CR10","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"TH Haveliwala","year":"2003","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank: a context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng. 15(4), 784\u2013796 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Xiang, L., Yuan, Q. Zhao, S., Chen, L., Zhang, X., Yang, Q., Sun, J.: Temporal recommendation on graphs via long-and short-term preference fusion. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 723\u2013732 (2010)","DOI":"10.1145\/1835804.1835896"},{"issue":"1","key":"49_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inform. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inform. Syst."},{"issue":"11","key":"49_CR13","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1002\/asi.21171","volume":"60","author":"Y Ding","year":"2009","unstructured":"Ding, Y., Yan, E., Frazho, A., Caverlee, J.: Pagerank for ranking authors in co-citation networks. J. Am. Soc. Inform. Sci. Technol. 60(11), 2229\u20132243 (2009)","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"key":"49_CR14","unstructured":"Heidemann, J., Klier, M., Probst, F.: Identifying key users in online social networks: a pagerank based approach (2010)"},{"key":"49_CR15","unstructured":"Tsioutsiouliklis, S., Pitoura, E., Tsaparas, P., Kleftakis, I., Mamoulis, N.: Fairness-aware link analysis (2020). arXiv preprint: arXiv:2005.14431"},{"key":"49_CR16","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report. Stanford InfoLab (1999)"},{"issue":"15","key":"49_CR17","doi-asserted-by":"publisher","first-page":"4117","DOI":"10.1109\/TSP.2017.2703660","volume":"65","author":"S Segarra","year":"2017","unstructured":"Segarra, S., Marques, A.G., Ribeiro, A.: Optimal graph-filter design and applications to distributed linear network operators. IEEE Trans. Signal Process. 65(15), 4117\u20134131 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"49_CR18","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1109\/JPROC.2018.2820126","volume":"106","author":"A Ortega","year":"2018","unstructured":"Ortega, A., Frossard, P., Kova\u010devi\u0107, J., Moura, J.M., Vandergheynst, P.: Graph signal processing: overview, challenges, and applications. Proc. IEEE 106(5), 808\u2013828 (2018)","journal-title":"Proc. IEEE"},{"key":"49_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-77004-6_13","volume-title":"Algorithms and Models for the Web-Graph: WAW 2007","author":"R Andersen","year":"2007","unstructured":"Andersen, R., Chung, F., Lang, K.: Local partitioning for directed graphs using pagerank. In: Bonato, A., Chung, F.R.K. (eds.) Algorithms and Models for the Web-Graph: WAW 2007. Lecture Notes in Computer Science, vol. 4863, pp. 166\u2013178. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_13"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chowdhury, A., Goel, A.: Fast incremental and personalized pagerank. In: Proceedings of the VLDB Endowment, 4(3) (2010)","DOI":"10.14778\/1929861.1929864"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Kloster, K., Gleich, D.F.: Heat kernel based community detection. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1386\u20131395 (2014)","DOI":"10.1145\/2623330.2623706"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 475\u2013486. IEEE (2006)","DOI":"10.1109\/FOCS.2006.44"},{"issue":"1","key":"49_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/15427951.2007.10129139","volume":"4","author":"R Andersen","year":"2007","unstructured":"Andersen, R., Chung, F., Lang, K.: Using pagerank to locally partition a graph. Internet Math. 4(1), 35\u201364 (2007)","journal-title":"Internet Math."},{"key":"49_CR24","unstructured":"Chalupa, D.: A memetic algorithm for the minimum conductance graph partitioning problem (2017). arXiv preprint: arXiv:1704.02854"},{"key":"49_CR25","unstructured":"Wu, X.-M., Li, Z., So, A.M., Wright, J., Chang, S.-F.: Learning with partially absorbing random walks. In: Advances in Neural Information Processing Systems, pp. 3077\u20133085 (2012)"},{"key":"49_CR26","doi-asserted-by":"crossref","unstructured":"Beutel, A., Chen, J., Doshi, T., Qian, H., Wei, L., Wu, Y., Heldt, L., Zhao, Z., Hong, L., Chi, E.H., et al.: Fairness in recommendation ranking through pairwise comparisons. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2212\u20132220 (2019)","DOI":"10.1145\/3292500.3330745"},{"key":"49_CR27","doi-asserted-by":"crossref","unstructured":"Biega, A.J., Gummadi, K.P., Weikum, G.: Equity of attention: amortizing individual fairness in rankings. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, pp. 405\u2013414 (2018)","DOI":"10.1145\/3209978.3210063"},{"key":"49_CR28","doi-asserted-by":"crossref","unstructured":"Yang, K., Stoyanovich, J.: Measuring fairness in ranked outputs. In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management, pp. 1\u20136 (2017)","DOI":"10.1145\/3085504.3085526"},{"key":"49_CR29","doi-asserted-by":"crossref","unstructured":"Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M., Baeza-Yates, R.: Fa* ir: a fair top-k ranking algorithm. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 1569\u20131578 (2017)","DOI":"10.1145\/3132847.3132938"},{"key":"49_CR30","unstructured":"Bose, A., Hamilton, W.: Compositional fairness constraints for graph embeddings. In: International Conference on Machine Learning, pp. 715\u2013724 (2019)"},{"key":"49_CR31","doi-asserted-by":"crossref","unstructured":"Rahman, T.A., Surma, B., Backes, M., Zhang, Y.: Fairwalk: towards fair graph embedding. In: IJCAI, pp. 3289\u20133295 (2019)","DOI":"10.24963\/ijcai.2019\/456"},{"key":"49_CR32","doi-asserted-by":"crossref","unstructured":"Dai, E., Wang, S.: FairGNN: Eliminating the discrimination in graph neural networks with limited sensitive attribute information. arXiv preprint: arXiv:2009.01454 (2020)","DOI":"10.1145\/3437963.3441752"},{"key":"49_CR33","unstructured":"Leskovec, J., Mcauley, J.J.: Learning to discover social circles in ego networks. In: ADvances in Neural Information Processing Systems, pp. 539\u2013547 (2012)"},{"key":"49_CR34","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"1","key":"49_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web (TWEB) 1(1), 5 (2007)","journal-title":"ACM Trans. Web (TWEB)"},{"issue":"2","key":"49_CR36","doi-asserted-by":"publisher","first-page":"102053","DOI":"10.1016\/j.ipm.2019.06.002","volume":"57","author":"E Krasanakis","year":"2020","unstructured":"Krasanakis, E., Schinas, E., Papadopoulos, S., Kompatsiaris, Y., Symeonidis, A.: Boosted seed oversampling for local community ranking. Inform. Process. Manag. 57(2), 102053 (2020)","journal-title":"Inform. Process. Manag."},{"issue":"7","key":"49_CR37","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"AP Bradley","year":"1997","unstructured":"Bradley, A.P.: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recogn. 30(7), 1145\u20131159 (1997)","journal-title":"Pattern Recogn."},{"issue":"2","key":"49_CR38","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1001\/jama.2019.9523","volume":"322","author":"C Cassel","year":"2019","unstructured":"Cassel, C., Bindman, A.: Risk, benefit, and fairness in a big data world. JAMA 322(2), 105\u2013106 (2019)","journal-title":"JAMA"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T13:53:34Z","timestamp":1670680414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_49","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}