NEN, the Dutch standardisation institute, has published Dutch Technical Agreement (NTA) 8047 (Dutch). This NTA sets out methods for testing profiling algorithms for potential discrimination. The publication was prepared by a broad working group comprising experts from government organisations, knowledge institutions, civil society organisations and private parties.
The NTA is intended for government organisations that develop or use profiling algorithms. The agreements are voluntary and provide concrete guidance on developing and using these algorithms in a structured and responsible manner, with attention to bias and non-discrimination.
Supplementary to existing rules and instruments
A Dutch Technical Agreement (NTA) is a set of voluntary agreements on a subject for which no formal standard yet exists, but clarity is needed. NTA 8047 has been developed for algorithmic systems that, under the AI Act, do not qualify as AI systems and therefore fall outside its scope. Consider, for example, rule-based systems used for selecting files. The NTA describes a method to investigate indirect discrimination. In doing so, it supports compliance with the prohibition on discrimination. The NTA does not introduce new frameworks and can be used alongside existing instruments, such as the Risk Profiling Assessment Framework (Toetsingskader risicoprofilering, Dutch), a DPIA and an IAMA (Dutch).
Free to use
The Standardisation Forum and the Ministry of Justice and Security have provided financial support for the development of the NTA. The Standardisation Forum aims to use this support to share and secure the knowledge and experience gained in standardisation by providing a guidance document. The NTA is available for viewing and use via NEN Connect.
The NTA in practice
The Ministry of the Interior and Kingdom Relations wants to use pilots to investigate how the NTA works in practice. The central question is which government organisations need to start using the NTA. Interested government organisations can email algoritmes@minbzk.nl.
