Linked Data is a general principle for describing and publishing information about entities of an application domain. The description of Linked Data entities is implemented in a text-based machine-readable format that follows the Resource Description Framework (RDF).
The signature of a Linked Data entity is comprised of its attributes (data properties) and its typed relationships (object properties) to other entities.
In this thesis, you will develop a visualisation of the Linked Data entities in two or three dimensions based on their signature. The shape of the entity corresponds to the signature of the entity.
The resulting entities could for example look like Tetris bricks. This would allow to visually classify, cluster, sort, recombine and otherwise interact with the entities.
One could imagine forming composite structures with these bricks, each having a unique signature. For example, a “family” could consist of two “parent” entities and at least one “child” entity.
Linked Data entities have been visualised in a number of applications.
An example is the DBPedia atlas , which visualises the entities of DBPedia. However, in this visualisation, as in many others, the individual items all have the same shape.
Another example is the three-dimensional visualisation provided by HDT-it , which visualises an RDF graph in three dimensions.
A different example are cellular automata . The items in such simulations form a certain shape. Additionally, they also autonomously move and interact with other shapes, forming new shapes and entities that have been attributed a specific semantic meaning (e.g. a “glider”).