A Narrow-Down Approach Based on Machine Learning for Indoor Localization

IF 1.8 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Algorithms Pub Date : 2023-11-17 DOI:10.3390/a16110529
Sahibzada Muhammad Ahmad Umair, T. Arslan
{"title":"A Narrow-Down Approach Based on Machine Learning for Indoor Localization","authors":"Sahibzada Muhammad Ahmad Umair, T. Arslan","doi":"10.3390/a16110529","DOIUrl":null,"url":null,"abstract":"Over the past decade, the demand and research for indoor localization have burgeoned and Wi-Fi fingerprinting approach has been widely considered because it is cheap and accessible. However, most existing methods lack in terms of positioning accuracy and high computational complexity. To cope with these issues, we formulate a two-stage, coarse and accurate positioning narrow-down approach (NDA). Furthermore, a three-step source domain refinement (SDR) scheme that involves outlier removal, stable AP’s weight enhancement, and a data averaging technique by applying the K-means clustering algorithm is also proposed. The collaboration of SDR scheme with the training data selection, area division, and overlapping schemes reduces the computational complexity and improves coarse positioning accuracy. The effect of the proposed SDR scheme on the performance of the support vector machine (SVM) and random forest algorithms is also presented. In the final/accurate positioning phase, a set of lightweight neural networks (DNNs), trained on different sub-areas, predict the user’s location. This approach significantly increases positioning accuracy while reducing the online computational complexity at the same time. The experimental results show that the proposed approach outperforms the best solutions presented in the literature.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"41 2","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/a16110529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Over the past decade, the demand and research for indoor localization have burgeoned and Wi-Fi fingerprinting approach has been widely considered because it is cheap and accessible. However, most existing methods lack in terms of positioning accuracy and high computational complexity. To cope with these issues, we formulate a two-stage, coarse and accurate positioning narrow-down approach (NDA). Furthermore, a three-step source domain refinement (SDR) scheme that involves outlier removal, stable AP’s weight enhancement, and a data averaging technique by applying the K-means clustering algorithm is also proposed. The collaboration of SDR scheme with the training data selection, area division, and overlapping schemes reduces the computational complexity and improves coarse positioning accuracy. The effect of the proposed SDR scheme on the performance of the support vector machine (SVM) and random forest algorithms is also presented. In the final/accurate positioning phase, a set of lightweight neural networks (DNNs), trained on different sub-areas, predict the user’s location. This approach significantly increases positioning accuracy while reducing the online computational complexity at the same time. The experimental results show that the proposed approach outperforms the best solutions presented in the literature.
基于机器学习的狭义室内定位方法
在过去的十年中,室内定位的需求和研究急剧增加,Wi-Fi 指纹识别方法因其成本低廉、易于使用而被广泛采用。然而,大多数现有方法都存在定位精度低、计算复杂度高等问题。为了解决这些问题,我们提出了一种两阶段、粗略且精确的定位缩小方法(NDA)。此外,我们还提出了一种三步源域细化(SDR)方案,包括去除离群点、增强稳定 AP 的权重以及应用 K-means 聚类算法的数据平均技术。SDR 方案与训练数据选择、区域划分和重叠方案相结合,降低了计算复杂度,提高了粗定位精度。此外,还介绍了所提出的 SDR 方案对支持向量机(SVM)和随机森林算法性能的影响。在最后/精确定位阶段,一组根据不同子区域训练的轻量级神经网络(DNN)将预测用户的位置。这种方法大大提高了定位精度,同时降低了在线计算复杂度。实验结果表明,所提出的方法优于文献中介绍的最佳解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Algorithms
Algorithms Mathematics-Numerical Analysis
CiteScore
4.10
自引率
4.30%
发文量
394
审稿时长
11 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学术官方微信