用欧几里得方法自动填充缺失点的算法实现

Jānis Pekša
{"title":"用欧几里得方法自动填充缺失点的算法实现","authors":"Jānis Pekša","doi":"10.1109/ICICT52872.2021.00020","DOIUrl":null,"url":null,"abstract":"Data points from data sources are needed for today's forecasts to predict future events accurately. There is a need for the data to be complete and accessible without missing points that interfere with more inferior results. A solution for filling in missing points is proposed in an automated way using the k-mean algorithm, which allows obtaining the necessary data from the nearest data sources. To estimate that these data are geographically close to each other, k-means use the clustering principle by dividing the data sources into specific clusters, respectively, taking their location by Lat and Lng. The existing solution helps to use AODPF with previously missing points, which was not possible when repeating the experiment with those metrological stations for which it was not possible. Article answers to three questions: Does the missing data fill in increase the accuracy of the forecast? The algorithm that fills the missing data shows automation and standard features? Does the Kalman filter increase the accuracy of the forecast? Of course, with limitations.","PeriodicalId":359456,"journal":{"name":"2021 4th International Conference on Information and Computer Technologies (ICICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Automated Algorithm Implementation to Fill Missing Points with Euclidean Approach\",\"authors\":\"Jānis Pekša\",\"doi\":\"10.1109/ICICT52872.2021.00020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data points from data sources are needed for today's forecasts to predict future events accurately. There is a need for the data to be complete and accessible without missing points that interfere with more inferior results. A solution for filling in missing points is proposed in an automated way using the k-mean algorithm, which allows obtaining the necessary data from the nearest data sources. To estimate that these data are geographically close to each other, k-means use the clustering principle by dividing the data sources into specific clusters, respectively, taking their location by Lat and Lng. The existing solution helps to use AODPF with previously missing points, which was not possible when repeating the experiment with those metrological stations for which it was not possible. Article answers to three questions: Does the missing data fill in increase the accuracy of the forecast? The algorithm that fills the missing data shows automation and standard features? Does the Kalman filter increase the accuracy of the forecast? Of course, with limitations.\",\"PeriodicalId\":359456,\"journal\":{\"name\":\"2021 4th International Conference on Information and Computer Technologies (ICICT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 4th International Conference on Information and Computer Technologies (ICICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICT52872.2021.00020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 4th International Conference on Information and Computer Technologies (ICICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT52872.2021.00020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

今天的预测需要数据源中的数据点来准确地预测未来的事件。数据需要是完整的和可访问的,没有遗漏点,干扰更多的劣质结果。提出了一种利用k均值算法自动填充缺失点的解决方案,该算法允许从最近的数据源获取必要的数据。为了估计这些数据在地理上彼此接近,k-means使用聚类原理,将数据源分别划分为特定的簇,并通过Lat和Lng获取它们的位置。现有的解决方案有助于将AODPF用于以前缺失的点,这在与那些无法重复实验的气象站重复实验时是不可能的。文章回答了三个问题:缺失的数据是否会增加预测的准确性?填补缺失数据的算法显示了自动化和标准特征?卡尔曼滤波是否提高了预报的准确性?当然,也有局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Automated Algorithm Implementation to Fill Missing Points with Euclidean Approach
Data points from data sources are needed for today's forecasts to predict future events accurately. There is a need for the data to be complete and accessible without missing points that interfere with more inferior results. A solution for filling in missing points is proposed in an automated way using the k-mean algorithm, which allows obtaining the necessary data from the nearest data sources. To estimate that these data are geographically close to each other, k-means use the clustering principle by dividing the data sources into specific clusters, respectively, taking their location by Lat and Lng. The existing solution helps to use AODPF with previously missing points, which was not possible when repeating the experiment with those metrological stations for which it was not possible. Article answers to three questions: Does the missing data fill in increase the accuracy of the forecast? The algorithm that fills the missing data shows automation and standard features? Does the Kalman filter increase the accuracy of the forecast? Of course, with limitations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信