<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Fostering fairness in image classification through awareness of sensitive data</dc:title><dc:creator>Colakovic,	Ivona	(Avtor)
	</dc:creator><dc:creator>Karakatič,	Sašo	(Avtor)
	</dc:creator><dc:subject>fairness</dc:subject><dc:subject>search-basimage classification</dc:subject><dc:subject>machine learning</dc:subject><dc:subject>supervised learnign</dc:subject><dc:subject>neural networks</dc:subject><dc:description>Machine learning (ML) has demonstrated remarkable ability to uncover hidden patterns in data. However, the presence of biases and discrimination originating from the data itself and, consequently, emerging in the ML outcomes, remains a pressing concern. With the exponential growth of unstructured data, such as images, fairness has become increasingly critical, as neural network (NN) models may inadvertently learn and perpetuate societal and historical biases. To address this challenge, we propose a fairness-aware loss function that iteratively prioritizes the worst-performing sensitive group during NN training. This approach aims to balance treatment quality across sensitive groups, achieving fairer image classification outcomes while incurring only a slight compromise in overall performance. Our method, evaluated on the FairFace dataset, demonstrates significant improvements in fairness metrics while maintaining comparable overall quality. These trade-offs highlight that the minor decrease in overall quality is justified by the improvement in fairness of the models.</dc:description><dc:publisher>Elsevier</dc:publisher><dc:date>2025</dc:date><dc:date>2025-04-23 15:57:47</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>92602</dc:identifier><dc:identifier>UDK: 004.8</dc:identifier><dc:identifier>COBISS_ID: 232495363</dc:identifier><dc:identifier>DOI: 10.1016/j.asoc.2025.113090</dc:identifier><dc:identifier>ISSN pri članku: 1872-9681</dc:identifier><dc:language>sl</dc:language><dc:rights>© 2025 The Authors</dc:rights></metadata>
