Detail publikace

Algorithmic creation of genealogical models

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

Originální název

Algorithmic creation of genealogical models

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

Need for automatic creation of genealogical models rises as the amountof digitalized and rewritten record from historical sources. Usually it is necessary todistinguish what is genealogical model by an axiomatic system. Automatically createdmodels need not to fulfil the axioms when record is wrongly interconnected with otherrecords. 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 rewrittenparish registers record. In this paper we introduce an algorithmic approach to creationof possible models of a parish society in the middle Europe from a set of rewrittenbaptism, marriage and burial records. It is shown that probabilistic estimation ofperson interconnection from different records could be helpful for reconstruction of asocieties through several centuries. 

Klíčová slova

Genealogical models, State space searching method, Probabilisticrecord linkage

Autoři

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

Vydáno

17. 4. 2019

Nakladatel

Springer International Publishing

Místo

Los Alamitos

ISBN

978-3-030-16659-5

Kniha

Proceedings of ISDA 2018

Edice

Advances in Intelligent Systems and Computing

ISSN

2194-5357

Periodikum

Advances in Intelligent Systems and Computing

Číslo

941

Stát

Švýcarská konfederace

Strany od

650

Strany do

658

Strany počet

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"
}