On Chinese and Western Family Trees: Mechanism and Performance
Elton S SIQUEIRA, Patrick Cisuaka KABONGO, Tiancheng LI and 2 more
Advances in Distributed Computing and Artificial Intelligence Journal · 2016
doi:10.14201/adcaij2016511122 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Family tree is an efficient data structure to store the kinship information in a family. There are basically two kinds of trees: Western Family Tree (WFT) and Oriental Family Tree such as Chinese Family Tree (CFT). To get an insight of their efficiency in the context of family kinship presentation and information extraction, in this paper we develop WFT and CFT presentation models and search algorithms, comparing their search performance and inherent mechanism. The study reveals that the computational cost is higher in CFT model, but it provides a greater gain in information retrieval and produces more details of the kinship between individuals in the family.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.