東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Discovering information integration ...

Qian, Kun.

Linked to FindBook

Google Book

Amazon

博客來

Discovering information integration specifications from data examples.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Discovering information integration specifications from data examples./
Author:	Qian, Kun.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
Description:	215 p.
Notes:	Source: Dissertation Abstracts International, Volume: 78-09(E), Section: B.
Contained By:	Dissertation Abstracts International78-09B(E).
Subject:	Computer science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10254831
ISBN:	9781369701272

Discovering information integration specifications from data examples.
Qian, Kun.

Discovering information integration specifications from data examples. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 215 p.

Source: Dissertation Abstracts International, Volume: 78-09(E), Section: B.

Thesis (Ph.D.)--University of California, Santa Cruz, 2017.

Two fundamental problems in information integration are data exchange and entity resolution. Data exchange is the task of translating data structured under a source schema into data structured under a target schema. Data exchange is captured by schema mappings that specify the relationship between a source schema and a target schema at a high level. Entity resolution is the task of identifying and linking different representations of the same real-world object. The goal of entity resolution is to create links among existing data. Although schema mapping and entity resolution have been successfully used in many domains, manually designing schema mappings and entity resolution algorithms is a labor-intensive and time-consuming process.

ISBN: 9781369701272Subjects--Topical Terms:

523869
Computer science.

Discovering information integration specifications from data examples.
LDR:03668nmm a2200289 4500 001 2126856
005 20171128112455.5
008 180830s2017 ||||||||||||||||| ||eng d
020 $a 9781369701272
035 $a (MiAaPQ)AAI10254831
035 $a AAI10254831
040 $a MiAaPQ $c MiAaPQ
100 1 $a Qian, Kun. $3 3288965
245 1 0 $a Discovering information integration specifications from data examples.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 215 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-09(E), Section: B.
500 $a Adviser: Phokion G. Kolaitis.
502 $a Thesis (Ph.D.)--University of California, Santa Cruz, 2017.
520 $a Two fundamental problems in information integration are data exchange and entity resolution. Data exchange is the task of translating data structured under a source schema into data structured under a target schema. Data exchange is captured by schema mappings that specify the relationship between a source schema and a target schema at a high level. Entity resolution is the task of identifying and linking different representations of the same real-world object. The goal of entity resolution is to create links among existing data. Although schema mapping and entity resolution have been successfully used in many domains, manually designing schema mappings and entity resolution algorithms is a labor-intensive and time-consuming process.
520 $a In this dissertation, we develop example-driven discovery/learning methods for high-level declarative schema mapping specifications and high-level declarative entity resolution algorithms. This dissertation contains two parts. In Part I, we present our work on extending and refining two major example-driven schema-mapping discovery frameworks, namely, the repair framework introduced by Gottlob and Senellart and the learning framework introduced by ten Cate et al. Gottlob and Senellart introduced a framework for schema-mapping discovery from a single data example, in which the derivation of a schema mapping is cast as an optimization problem. We refine andstudy this framework in more depth. Among other results, we design a polynomial-time log(n)-approximation algorithm for computing optimal schema mappings from a given set of data examples for a restricted class of schema mappings; moreover, we show that this approximation ratio cannot be improved. We implemented the aforementioned log(n)-approximation algorithm and carried out an experimental evaluation in a real-world mapping scenario. As opposed to the repair framework, in which the schema-mapping discovery problem is cast as an optimization problem, the derivation of a schema mapping is cast as a computational learning problem in the learning framework. We design a learning algorithm that is an Occam algorithm leading up to a PAC learning algorithm for an important class of schema mappings. We also implemented the proposed algorithm and carried out an experimental evaluation using mapping scenarios created by iBench, which is a state-of-the-art benchmarking tool. In Part II, we introduce a new active learning system for entity resolution that learns high-quality entity resolution algorithms. Our focus is on learning entity resolution algorithms in big data scenarios. We implemented the aforementioned active learning system and carried out an experimental evaluation in two real-world big data entity resolution scenarios.
590 $a School code: 0036.
650 4 $a Computer science. $3 523869
690 $a 0984
710 2 $a University of California, Santa Cruz. $b Computer Science. $3 2092489
773 0 $t Dissertation Abstracts International $g 78-09B(E).
790 $a 0036
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10254831