T-REx: Table Repair Explanations

Data repair is a common and crucial step in many frameworks today, as applications may use data from different sources and of different levels of credibility. Thus, this step has been the focus of many works, proposing diverse approaches. To assist users in understanding the output of such data repa...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2020-07
Main Authors: Deutch, Daniel, Frost, Nave, Gilad, Amir, Sheffer, Oren
Format: Article
Language:English
Subjects:
Algorithms
Repair
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Deutch, Daniel
Frost, Nave
Gilad, Amir
Sheffer, Oren
description Data repair is a common and crucial step in many frameworks today, as applications may use data from different sources and of different levels of credibility. Thus, this step has been the focus of many works, proposing diverse approaches. To assist users in understanding the output of such data repair algorithms, we propose T-REx, a system for providing data repair explanations through Shapley values. The system is generic and not specific to a given repair algorithm or approach: it treats the algorithm as a black box. Given a specific table cell selected by the user, T-REx employs Shapley values to explain the significance of each constraint and each table cell in the repair of the cell of interest. T-REx then ranks the constraints and table cells according to their importance in the repair of this cell. This explanation allows users to understand the repair process, as well as to act based on this knowledge, to modify the most influencing constraints or the original database.
doi_str_mv 10.48550/arxiv.2007.04450
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2422264299</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2422264299</sourcerecordid><originalsourceid>FETCH-LOGICAL-a529-3b6b7d8924c05df4a16619103660bdfb1427a23f10fb689a59630ff66530b0383</originalsourceid><addsrcrecordid>eNotjstqwzAQAEWh0JDmA3oz5Cx3tSutrd5KcB8QKATfwyq2wMHYrpUUf34D7WluM6PUk4Hcls7Bs8xL95MjQJGDtQ7u1AqJjC4t4oPapHQGAOQCnaOVymp9qJaXrJbQt9mhnaSbs2qZehnk0o1DelT3UfrUbv65VvVbVe8-9P7r_XP3utfi0GsKHIqm9GhP4JpoxTAbb4CYITQxGIuFIEUDMXDpxXkmiJHZEQSgktZq-6ed5vH72qbL8Txe5-FWPOJtHNmi9_QLRms85Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2422264299</pqid></control><display><type>article</type><title>T-REx: Table Repair Explanations</title><source>Publicly Available Content Database</source><creator>Deutch, Daniel ; Frost, Nave ; Gilad, Amir ; Sheffer, Oren</creator><creatorcontrib>Deutch, Daniel ; Frost, Nave ; Gilad, Amir ; Sheffer, Oren</creatorcontrib><description>Data repair is a common and crucial step in many frameworks today, as applications may use data from different sources and of different levels of credibility. Thus, this step has been the focus of many works, proposing diverse approaches. To assist users in understanding the output of such data repair algorithms, we propose T-REx, a system for providing data repair explanations through Shapley values. The system is generic and not specific to a given repair algorithm or approach: it treats the algorithm as a black box. Given a specific table cell selected by the user, T-REx employs Shapley values to explain the significance of each constraint and each table cell in the repair of the cell of interest. T-REx then ranks the constraints and table cells according to their importance in the repair of this cell. This explanation allows users to understand the repair process, as well as to act based on this knowledge, to modify the most influencing constraints or the original database.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2007.04450</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Repair</subject><ispartof>arXiv.org, 2020-07</ispartof><rights>2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2422264299?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>777,781,25734,27906,36993,44571</link.rule.ids></links><search><creatorcontrib>Deutch, Daniel</creatorcontrib><creatorcontrib>Frost, Nave</creatorcontrib><creatorcontrib>Gilad, Amir</creatorcontrib><creatorcontrib>Sheffer, Oren</creatorcontrib><title>T-REx: Table Repair Explanations</title><title>arXiv.org</title><description>Data repair is a common and crucial step in many frameworks today, as applications may use data from different sources and of different levels of credibility. Thus, this step has been the focus of many works, proposing diverse approaches. To assist users in understanding the output of such data repair algorithms, we propose T-REx, a system for providing data repair explanations through Shapley values. The system is generic and not specific to a given repair algorithm or approach: it treats the algorithm as a black box. Given a specific table cell selected by the user, T-REx employs Shapley values to explain the significance of each constraint and each table cell in the repair of the cell of interest. T-REx then ranks the constraints and table cells according to their importance in the repair of this cell. This explanation allows users to understand the repair process, as well as to act based on this knowledge, to modify the most influencing constraints or the original database.</description><subject>Algorithms</subject><subject>Repair</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNotjstqwzAQAEWh0JDmA3oz5Cx3tSutrd5KcB8QKATfwyq2wMHYrpUUf34D7WluM6PUk4Hcls7Bs8xL95MjQJGDtQ7u1AqJjC4t4oPapHQGAOQCnaOVymp9qJaXrJbQt9mhnaSbs2qZehnk0o1DelT3UfrUbv65VvVbVe8-9P7r_XP3utfi0GsKHIqm9GhP4JpoxTAbb4CYITQxGIuFIEUDMXDpxXkmiJHZEQSgktZq-6ed5vH72qbL8Txe5-FWPOJtHNmi9_QLRms85Q</recordid><startdate>20200708</startdate><enddate>20200708</enddate><creator>Deutch, Daniel</creator><creator>Frost, Nave</creator><creator>Gilad, Amir</creator><creator>Sheffer, Oren</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20200708</creationdate><title>T-REx: Table Repair Explanations</title><author>Deutch, Daniel ; Frost, Nave ; Gilad, Amir ; Sheffer, Oren</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a529-3b6b7d8924c05df4a16619103660bdfb1427a23f10fb689a59630ff66530b0383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Repair</topic><toplevel>online_resources</toplevel><creatorcontrib>Deutch, Daniel</creatorcontrib><creatorcontrib>Frost, Nave</creatorcontrib><creatorcontrib>Gilad, Amir</creatorcontrib><creatorcontrib>Sheffer, Oren</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Deutch, Daniel</au><au>Frost, Nave</au><au>Gilad, Amir</au><au>Sheffer, Oren</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>T-REx: Table Repair Explanations</atitle><jtitle>arXiv.org</jtitle><date>2020-07-08</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>Data repair is a common and crucial step in many frameworks today, as applications may use data from different sources and of different levels of credibility. Thus, this step has been the focus of many works, proposing diverse approaches. To assist users in understanding the output of such data repair algorithms, we propose T-REx, a system for providing data repair explanations through Shapley values. The system is generic and not specific to a given repair algorithm or approach: it treats the algorithm as a black box. Given a specific table cell selected by the user, T-REx employs Shapley values to explain the significance of each constraint and each table cell in the repair of the cell of interest. T-REx then ranks the constraints and table cells according to their importance in the repair of this cell. This explanation allows users to understand the repair process, as well as to act based on this knowledge, to modify the most influencing constraints or the original database.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2007.04450</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2020-07
issn 2331-8422
language eng
recordid cdi_proquest_journals_2422264299
source Publicly Available Content Database
subjects Algorithms
Repair
title T-REx: Table Repair Explanations
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T12%3A02%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=T-REx:%20Table%20Repair%20Explanations&rft.jtitle=arXiv.org&rft.au=Deutch,%20Daniel&rft.date=2020-07-08&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2007.04450&rft_dat=%3Cproquest%3E2422264299%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a529-3b6b7d8924c05df4a16619103660bdfb1427a23f10fb689a59630ff66530b0383%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2422264299&rft_id=info:pmid/&rfr_iscdi=true