An Effective Source Selection Algorithm for Filling Missing Tuples

Hengzhen Xie, Lingli Li, Ping Xuan
{"title":"An Effective Source Selection Algorithm for Filling Missing Tuples","authors":"Hengzhen Xie, Lingli Li, Ping Xuan","doi":"10.1109/ICPDS47662.2019.9017179","DOIUrl":null,"url":null,"abstract":"Completeness is one of the central criteria for data quality, and the completeness of data becomes particularly important. Specifically, incomplete data refers to a data set that does not contain enough information to answer the query, which can be divided into missing the values and tuples. This paper presents a technique of leveraging other data sources to fill missing tuples in target data. However, accessing too many data sources introduces a huge cost, so we investigate how to select a proper subset of sources to fill the missing tuples. Firstly, we define the gain model of sources and introduce the optimization problem of source selection from the perspective of missing tuples, in which the gain is maximized with the cost under a threshold. For filling the missing tuples, we propose a data source selection strategy based on a genetic algorithm. Experimental results show high performance on both the effectiveness of our algorithm.","PeriodicalId":130202,"journal":{"name":"2019 IEEE International Conference on Power Data Science (ICPDS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Power Data Science (ICPDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPDS47662.2019.9017179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Completeness is one of the central criteria for data quality, and the completeness of data becomes particularly important. Specifically, incomplete data refers to a data set that does not contain enough information to answer the query, which can be divided into missing the values and tuples. This paper presents a technique of leveraging other data sources to fill missing tuples in target data. However, accessing too many data sources introduces a huge cost, so we investigate how to select a proper subset of sources to fill the missing tuples. Firstly, we define the gain model of sources and introduce the optimization problem of source selection from the perspective of missing tuples, in which the gain is maximized with the cost under a threshold. For filling the missing tuples, we propose a data source selection strategy based on a genetic algorithm. Experimental results show high performance on both the effectiveness of our algorithm.
一种填充缺失元组的有效源选择算法
完整性是数据质量的中心标准之一,数据的完整性变得尤为重要。具体来说,不完整数据是指不包含足够信息来回答查询的数据集,它可以分为缺失值和元组。本文提出了一种利用其他数据源来填补目标数据中缺失元组的技术。然而,访问过多的数据源会带来巨大的成本,因此我们研究如何选择适当的数据源子集来填充缺失的元组。首先,我们定义了源的增益模型,并从缺失元组的角度引入了源选择的优化问题,该问题以代价在一定阈值下增益最大化为目标。为了填补缺失元组,我们提出了一种基于遗传算法的数据源选择策略。实验结果表明,该算法具有较高的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信