DeepAI AI Chat
Log In Sign Up

An algebraic theory for data linkage

by   Liang-Ting Chen, et al.

There are countless sources of data available to governments, companies, and citizens, which can be combined for good or evil. We analyse the concepts of combining data from common sources and linking data from different sources. We model the data and its information content to be found in a single source by a partial ordered monoid, and the transfer of information between sources by different types of morphisms. To capture the linkage between a family of sources, we use a form of Grothendieck construction to create a partial ordered monoid that brings together the global data of the family in a single structure. We apply our approach to database theory and axiomatic structures in approximate reasoning. Thus, partial ordered monoids provide a foundation for the algebraic study for information gathering in its most primitive form.


page 1

page 2

page 3

page 4


A (Co)Algebraic Framework for Ordered Processes

A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offe...

Order preserving hierarchical agglomerative clustering of strict posets

We present a method for hierarchical clustering of directed acyclic grap...

A deterministic-statistical approach to reconstruct moving sources using sparse partial data

We consider the reconstruction of moving sources using partial measured ...

Primitive Recursive Ordered Fields and Some Applications

We establish primitive recursive versions of some known facts about comp...

Bayesian and Dempster-Shafer models for combining multiple sources of evidence in a fraud detection system

Combining evidence from different sources can be achieved with Bayesian ...

Canonical extensions of locally compact frames

Canonical extension of finitary ordered structures such as lattices, pos...

Alignments as Compositional Structures

Alignments, i.e., position-wise comparisons of two or more strings or or...