Afficher la notice abrégée

dc.contributor.authorLi, Tianchenges_ES
dc.contributor.authorSiqueira, Elton Ses_ES
dc.contributor.authorKabongo, Patrick Cisuakaes_ES
dc.contributor.authorWeigang, Lies_ES
dc.date.accessioned2016-11-04T09:27:58Z
dc.date.available2016-11-04T09:27:58Z
dc.date.issued2016-01-10es_ES
dc.identifier.citationADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, 5 (2016)es_ES
dc.identifier.issn2255-2863es_ES
dc.identifier.urihttp://hdl.handle.net/10366/131645
dc.description.abstractFamily 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.es_ES
dc.format.mimetypeapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherEdiciones Universidad de Salamanca (EspaÑa)es_ES
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Unported
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/3.0/
dc.subjectComputaciónes_ES
dc.subjectInformóticaes_ES
dc.subjectComputinges_ES
dc.subjectInformation Technologyes_ES
dc.titleOn Chinese and Western Family Trees: Mechanism and Performancees_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES


Fichier(s) constituant ce document

Thumbnail

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée

Attribution-NonCommercial-NoDerivs 3.0 Unported
Excepté là où spécifié autrement, la license de ce document est décrite en tant que Attribution-NonCommercial-NoDerivs 3.0 Unported