Zobrazeno 1 - 10
of 166
pro vyhledávání: '"David W. Embley"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030883577
ER (Workshops)
ER (Workshops)
Enriching ontologies can measurably enhance research in digital curation. We support this claim by using an enriched ontology to address a well known, challenging problem: record linkage of historical records for intergenerational family reconstituti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c06f31f30bd50003ff2b6a9af1c214e0
https://doi.org/10.1007/978-3-030-88358-4_6
https://doi.org/10.1007/978-3-030-88358-4_6
Publikováno v:
International Journal on Document Analysis and Recognition (IJDAR). 19:119-138
Much of the world's quantitative data reside in scattered web tables. For a meaningful role in Big Data analytics, the facts reported in these tables must be brought into a uniform framework. Based on a formalization of header-indexed tables, we prof
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa018c1af7634ded2b6e1b8195ed595
https://doi.org/10.1007/s10032-016-0259-1
https://doi.org/10.1007/s10032-016-0259-1
Autor:
David W. Embley, George Nagy
Publikováno v:
DAS
Repetitively formatted historical books are tokenized and tagged according to eight token types (capitalized words, numbers, punctuation …). To extract family information, templates of short sequences of tags are generated around frequent proper no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cb33d88fbddb22af50b06e759ef0744
https://doi.org/10.1109/das.2018.58
https://doi.org/10.1109/das.2018.58
Autor:
Spencer Seeger, David W. Embley, Scott N. Woodfield, Brenden Grace, Stephen W. Liddle, Samuel Litster
Publikováno v:
Conceptual Modeling ISBN: 9783030008468
ER
ER
Analytical applications such as forensics, investigative journalism, and genealogy require deep data cleaning in which application-dependent semantic errors and inconsistencies are detected and resolved. To facilitate deep data cleaning, the applicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::928f1f8427de9170c7bcadd8a26a7759
https://doi.org/10.1007/978-3-030-00847-5_9
https://doi.org/10.1007/978-3-030-00847-5_9
Autor:
David W. Embley
Publikováno v:
Encyclopedia of Database Systems ISBN: 9781489979933
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c8c0bcece140d04511b03cd079b608d
https://doi.org/10.1007/978-1-4614-8265-9_105
https://doi.org/10.1007/978-1-4614-8265-9_105
Autor:
David W. Embley
Publikováno v:
Encyclopedia of Database Systems ISBN: 9781489979933
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd273beff0c3d158e82167a0ff24df5f
https://doi.org/10.1007/978-1-4899-7993-3_811-2
https://doi.org/10.1007/978-1-4899-7993-3_811-2
Autor:
Stephen W. Liddle, Joseph Price, Deryle Lonsdale, Scott N. Woodfield, David W. Embley, Tanner S. Eastmond
Publikováno v:
Conceptual Modeling Perspectives ISBN: 9783319672700
Conceptual Modeling Perspectives
Conceptual Modeling Perspectives
Family Tree is a wiki-like shared repository of interconnected family genealogies. Because information ingested into the tree requires human authorization as verified in source documents, ingest is tedious and time-consuming. To significantly increas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f28ad502e3e5a962c9c0c58c3f176cff
https://doi.org/10.1007/978-3-319-67271-7_6
https://doi.org/10.1007/978-3-319-67271-7_6
Publikováno v:
Journal on Data Semantics. 4:213-229
Keyword search suffers from a number of issues: ambiguity, synonymy, and an inability to handle semantic constraints. Semantic search helps resolve these issues but is limited by the quality of annotations which are likely to be incomplete or impreci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bfa774db253835e841697a713cee362
https://doi.org/10.1007/s13740-014-0046-4
https://doi.org/10.1007/s13740-014-0046-4
Publikováno v:
Information Systems. 41:20-44
Generating the fewest redundancy-free scheme trees from conceptual-model hypergraphs is NP-hard [17]. We show, however, that the problem has a polynomial-time solution if the conceptual-model hypergraph is acyclic. We define conceptual-model hypergra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::992745d9c62572bf87e6ca3f712054ba
https://doi.org/10.1016/j.is.2013.10.009
https://doi.org/10.1016/j.is.2013.10.009