Publication detail

Algorithmic creation of genealogical models

ZBOŘIL, F. ROZMAN, J. KOČÍ, R.

Original Title

Algorithmic creation of genealogical models

Type

conference paper

Language

English

Original Abstract

Need for automatic creation of genealogical models rises as the amount of digitalized and rewritten record from historical sources. Usually it is necessary to distinguish what is genealogical model by an axiomatic system. Automatically created models need not to fulfil the axioms when record is wrongly interconnected with other records. If we are capable to decide whether a model is a genealogical model, we can better produce models which are automatically created from a set of rewritten parish registers record. In this paper we introduce an algorithmic approach to creation of possible models of a parish society in the middle Europe from a set of rewritten baptism, marriage and burial records. It is shown that probabilistic estimation of person interconnection from different records could be helpful for reconstruction of a societies through several centuries. 

Keywords

Genealogical models, State space searching method, Probabilistic record linkage

Authors

ZBOŘIL, F.; ROZMAN, J.; KOČÍ, R.

Released

17. 4. 2019

Publisher

Springer International Publishing

Location

Los Alamitos

ISBN

978-3-030-16659-5

Book

Proceedings of ISDA 2018

Edition

Advances in Intelligent Systems and Computing

ISBN

2194-5357

Periodical

Advances in Intelligent Systems and Computing

Number

941

State

Swiss Confederation

Pages from

650

Pages to

658

Pages count

9

BibTex

@inproceedings{BUT157180,
  author="František {Zbořil} and Jaroslav {Rozman} and Radek {Kočí}",
  title="Algorithmic creation of genealogical models",
  booktitle="Proceedings of ISDA 2018",
  year="2019",
  series="Advances in Intelligent Systems and Computing",
  journal="Advances in Intelligent Systems and Computing",
  number="941",
  pages="650--658",
  publisher="Springer International Publishing",
  address="Los Alamitos",
  doi="10.1007/978-3-030-16660-1\{_}63",
  isbn="978-3-030-16659-5",
  issn="2194-5357"
}