Applying Optimized Algorithms and Technology for Interconnecting Big Data Resources in Government Institutions

IF 1.7 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Genc Hamzaj, Artan Mazrekaj, Isak Shabani
{"title":"Applying Optimized Algorithms and Technology for Interconnecting Big Data Resources in Government Institutions","authors":"Genc Hamzaj, Artan Mazrekaj, Isak Shabani","doi":"10.3991/ijoe.v19i08.39661","DOIUrl":null,"url":null,"abstract":"The quality of the data in core electronic registers has constantly decreased as a result of numerous errors that were made and inconsistencies in the data in these databases due to the growing number of databases created with the intention of providing electronic services for public administration and the lack of the data harmonization or interoperability between these databases.Evaluating and improving the quality of data by matching and linking records from multiple data sources becomes exceedingly difficult due to the incredibly large volume of data in these numerous data sources with different data architectures and no unique field to create interconnection among them.Different algorithms are developed to treat these issues and our focus will be on algorithms that handle large amounts of data, such as Levenshtein distance (LV) algorithm and Damerau-Levenshtein distance (DL) algorithm.In order to analyze and evaluate the effectiveness and quality of data using the mentioned algorithms and making improvements to these algorithms, through this paper we will conduct experiments on large data sets with more than 1 million records.","PeriodicalId":36900,"journal":{"name":"International Journal of Online and Biomedical Engineering","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2023-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Online and Biomedical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3991/ijoe.v19i08.39661","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The quality of the data in core electronic registers has constantly decreased as a result of numerous errors that were made and inconsistencies in the data in these databases due to the growing number of databases created with the intention of providing electronic services for public administration and the lack of the data harmonization or interoperability between these databases.Evaluating and improving the quality of data by matching and linking records from multiple data sources becomes exceedingly difficult due to the incredibly large volume of data in these numerous data sources with different data architectures and no unique field to create interconnection among them.Different algorithms are developed to treat these issues and our focus will be on algorithms that handle large amounts of data, such as Levenshtein distance (LV) algorithm and Damerau-Levenshtein distance (DL) algorithm.In order to analyze and evaluate the effectiveness and quality of data using the mentioned algorithms and making improvements to these algorithms, through this paper we will conduct experiments on large data sets with more than 1 million records.
优化算法与技术在政府机构大数据资源互联中的应用
核心电子登记册中的数据质量不断下降,原因是这些数据库中的数据出现了许多错误和不一致,因为为公共行政提供电子服务而创建的数据库数量不断增加,而且这些数据库之间缺乏数据协调或互操作性。通过匹配和链接来自多个数据源的记录来评估和提高数据质量变得极其困难,因为在这些具有不同数据架构的众多数据源中,数据量非常大,并且没有在它们之间创建互连的唯一字段。我们开发了不同的算法来处理这些问题,我们的重点将放在处理大量数据的算法上,如Levenstein距离(LV)算法和Damerau-Levenstein-distance(DL)算法。为了分析和评估使用上述算法的数据的有效性和质量,并对这些算法进行改进,通过本文,我们将在超过100万条记录的大型数据集上进行实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.00
自引率
46.20%
发文量
143
审稿时长
12 weeks
×
引用
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学术官方微信