FAIR guiding principles

These principles are outlined in Box #2 of Wilkinson et al.

To be Findable:

• F1. (meta)data are assigned a globally unique and persistent identifier
• F2. data are described with rich metadata (defined by R1 below)
• F3. metadata clearly and explicitly include the identifier of the data it describes
• F4. (meta)data are registered or indexed in a searchable resource

To be Accessible:

• A1. (meta)data are retrievable by their identifier using a standardized communications protocol
• A1.1 the protocol is open, free, and universally implementable
• A1.2 the protocol allows for an authentication and authorization procedure, where necessary
• A2. metadata are accessible, even when the data are no longer available

To be Interoperable:

• I1. (meta)data use a formal, accessible, shared, and broadly applicable language for knowledge representation.
• I2. (meta)data use vocabularies that follow FAIR principles
• I3. (meta)data include qualified references to other (meta)data

To be Reusable:

• R1. meta(data) are richly described with a plurality of accurate and relevant attributes
• R1.1. (meta)data are released with a clear and accessible data usage license
• R1.2. (meta)data are associated with detailed provenance
• R1.3. (meta)data meet domain-relevant community standards

In order to react to inconsistent interpretations of these principles, Jacobsen et al. specified implications for possible implementations of these principles, starting from the objectives behind the FAIR principles:

Findability: Digital resources should be easy to find for both humans and computers. Extensive machine-actionable metadata are essential for automatic discovery of relevant datasets and services, and are therefore an essential component of the FAIRification process ...

Accessibility: Protocols for retrieving digital resources should be made explicit, for both humans and machines, including well-defined mechanisms to obtain authorization for access to protected data.

Interoperability: When two or more digital resources are related to the same topic or entity, it should be possible for machines to merge the information into a richer, unified view of that entity. Similarly, when a digital entity is capable of being processed by an online service, a machine should be capable of automatically detecting this compliance and facilitating the interaction between the data and that tool. This requires that the meaning (semantics) of each participating resource – be they data and/or services service – is clear.

Reusability: Digital resources are sufficiently well described for both humans and computers, such that a machine is capable of deciding: if a digital resource should be reused (i.e., is it relevant to the task at-hand?); if a digital resource can be reused, and under what conditions (i.e., do I fulfill the conditions of reuse?); and who to credit if it is reused.

In the paper of Jacobsen , recommendations are given for implementation of the 15 principles. Here a few quotes:

For #F1:

A common example of a useful identifier is the Digital Object Identifier (DOI) which is guaranteed by the DOI specification to be globally unique and persistent. DOIs provide an additional service, under principle A1, of being able to direct calls to the source data to the location of that data, even if the identified data moves. This ensures that identifiers are stable and valid beyond the project that generated them. In some circumstances, again with DOIs being an example, third-party persistent identifiers may also provide support for principle A2 (that metadata exists beyond the lifespan of the data) since these identifiers may still be responsive to Web calls, and be capable of providing metadata, even if the source resource is no longer active.

For #F2:

Whereas principle F1 enables unambiguous identification of resources of interest, principle F2 speaks to the ability to discover a resource of interest through, for example, search or filtering.... It is a challenge for each domain-specific community to define their own metadata descriptors necessary or optimizing findability. The minimal “richness” of the metadata should be defined so that it serves its intended purpose and should also be guided by the requirements of the other FAIR principles.... Examples of metadata schemata can be found in FAIRsharing and include for instance the Data Documentation Initiative (DDI), the HCLS Dataset Descriptors, and many domain-specific “minimal information” models that have been invented.

For #F3:

It is a challenge to each community to choose a machine-actionable metadata model that explicitly links a resource and its metadata. An example of a technology that provides this link is FAIR Data Point, which is based on the Data Catalogue model (DCAT) that provides not only unique identifiers for potentially multiple layers of metadata, but also provides a single, predictable, and searchable path through these layers of descriptors, down to the data object itself.

For #F4:

Principle F4 states that digital resources must be registered or indexed in a searchable resource. The searchable resource provides the infrastructure by which a metadata record (F1) can be discovered, using either the attributes in that metadata (F2) or the identifier of the data object itself (F3).... Current choices are for each community to choose, and publicly declare, what search engine to use for their own purposes, general or field-specific, and should at a minimum provide metadata following the standard that is indexed by the search engine of choice. They should also provide a machine-readable interface definition that would allow an automated search without human intervention. ... An example of a generic searchable resource that supports manual exploration is Google Dataset Search.

For #A1:

The “standardized communication protocol” is critical here. Its purpose is to provide a predictable way for an agent to access a resource, regardless of whether unrestricted access to the content of the resource is granted or not. An example of a standardized access protocol is the Hypertext Transfer Protocol (HTTP); however, FAIR does not preclude non-mechanized access protocols, such as a verbal request to the data holder in the case of highly sensitive data, so long as the access protocol is explicit and clearly defined.

Notes

Template:Reflist