Please use this identifier to cite or link to this item: http://hdl.handle.net/2307/40818
DC FieldValueLanguage
dc.contributor.advisorMERIALDO, PAOLO-
dc.contributor.authorPIAI, FEDERICO-
dc.date.accessioned2022-06-17T10:56:30Z-
dc.date.available2022-06-17T10:56:30Z-
dc.date.issued2020-04-20-
dc.identifier.urihttp://hdl.handle.net/2307/40818-
dc.description.abstractThis thesis focuses on Big Data integration, a foundational area in data management research. We describe in particular the integration of product specifications from multiple sources of data, with the final goal of building a complete and reliable product graph. Exploiting multiple data sources has the advantage to provide information about rare and niche products and uncommon properties, and having enough redundancy to solve potential conflicts. On the other hand, it involves several challenges due to the heterogeneity of Web sources. We described a complete pipeline for product data integration, involving Web extraction and integration steps, which, unlike traditional approaches, performs the record linkage step (group specifications by product) before attribute alignment step (group attributes with equivalent semantics and define mappings). Indeed, record linkage in product context is simplified by the presence of general product identifiers, while attribute alignment is a very complex task due to presence of a lot of properties about a product, some rarer and some more common, with many different representations. We provided an extensive analysis of the state of the art on these two tasks. We formulated a novel problem of computing attribute alignment at the instance level. Traditional schema-level alignment methods, which critically rely on local homogeneity within a source, are unable to effectively solve this problem due to the significant heterogeneity exhibited by product specifications, both across and within sources. We take advantage of the opportunities arising from the richness and redundancy of information across sources, and propose an iterative solution, called RaF-AIA, that consists of three key steps: (i) First, it uses a Bayesian model to analyze overlapping information across sources to match the most locally homogeneous attributes; (ii) Second, inspired by NLP techniques, it uses a tagging approach to create (virtual) homogeneous attributes from tagged portions of heterogeneous attribute values; (iii) Third, it makes creative use of classical alignment techniques based on matching of attribute names and domains. We developed a publicly available benchmark (Alaska Benchmark) for the tasks of attribute alignment and record linkage, which we also used to run experiments for evaluating the RaF-AiA approach, demonstrating its effectiveness and efficiency, and its superiority over alternative approaches adapted from the literature.en_US
dc.language.isoenen_US
dc.publisherUniversità degli studi Roma Treen_US
dc.subjectDATA INTEGRATIONen_US
dc.subjectTEXT MININGen_US
dc.subjectBIG DATAen_US
dc.titleINSTANCE-LEVEL ATTRIBUTE ALIGNMENT FOR HETEROGENEOUS PRODUCT SOURCESen_US
dc.typeDoctoral Thesisen_US
dc.subject.miurSettori Disciplinari MIUR::Ingegneria industriale e dell'informazione::SISTEMI DI ELABORAZIONE DELLE INFORMAZIONIen_US
dc.subject.isicruiCategorie ISI-CRUI::Ingegneria industriale e dell'informazione::Information Technology & Communications Systemsen_US
dc.subject.anagraferoma3Ingegneria industriale e dell'informazioneen_US
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess-
dc.description.romatrecurrentDipartimento di Ingegneria*
item.languageiso639-1other-
item.grantfulltextrestricted-
item.fulltextWith Fulltext-
Appears in Collections:X_Dipartimento di Ingegneria
T - Tesi di dottorato
Files in This Item:
File Description SizeFormat
Piai_Federico___PhD_thesis.pdf3.08 MBAdobe PDFView/Open
Show simple item record Recommend this item

Page view(s)

106
checked on May 2, 2024

Download(s)

89
checked on May 2, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.