A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem
Most humans today have mobile phones. These devices are permanently collecting and storing behavior data of human society. Nevertheless, data processing has several challenges to be solved, especially if it is obtained from obsolete technologies. Old technologies like GSM and UMTS still account for...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-02-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/4/315 |
| _version_ | 1797414390009430016 |
|---|---|
| author | Andrés Leiva-Araos Héctor Allende-Cid |
| author_facet | Andrés Leiva-Araos Héctor Allende-Cid |
| author_sort | Andrés Leiva-Araos |
| collection | DOAJ |
| description | Most humans today have mobile phones. These devices are permanently collecting and storing behavior data of human society. Nevertheless, data processing has several challenges to be solved, especially if it is obtained from obsolete technologies. Old technologies like GSM and UMTS still account for almost half of all devices globally. The main problem in the data is known as neighboring network hit (NNH). An NNH occurs when a cellular device connects to a site further away than it corresponds to by network design, introducing an error in the spatio-temporal mobility analysis. The problems presented by the data are mitigated by eliminating erroneous data or diluting them statistically based on increasing the amount of data processed and the size of the study area. None of these solutions are effective if what is sought is to study mobility in small areas (e.g., Covid-19 pandemic). Elimination of complete records or traces in the time series generates deviations in subsequent analyses; this has a special impact on reduced spatial coverage studies. The present work is an evolution of the previous approach to NNH correction (NFA) and travel inference (TCA), based on binary logic. NFA and TCA combined deliver good travel counting results compared to government surveys (2.37 vs. 2.27, respectively). However, its main contribution is given by the increase in the precision of calculating the distances traveled (37% better than previous studies). In this document, we introduce FNFA and FTCA. Both algorithms are based on fuzzy logic and deliver even better results. We observed an improvement in the trip count (2.29, which represents 2.79% better than NFA). With FNFA and FTCA combined, we observe an average distance traveled difference of 9.2 km, which is 9.8% better than the previous NFA-TCA. Compared to the naive methods (without fixing the <inline-formula><math display="inline"><semantics><mrow><mi>N</mi><mi>N</mi><mi>H</mi><mi>s</mi></mrow></semantics></math></inline-formula>), the improvement rises from 28.8 to 19.6 km (46.9%). We use duly anonymized data from mobile devices from three major cities in Chile. We compare our results with previous works and Government’s Origin and Destination Surveys to evaluate the performance of our solution. This new approach, while improving our previous results, provides the advantages of a model better adapted to the diffuse condition of the problem variables and shows us a way to develop new models that represent open challenges in studies of urban mobility based on cellular data (e.g., travel mode inference). |
| first_indexed | 2024-03-09T05:32:23Z |
| format | Article |
| id | doaj.art-7e8c5deb45d240128d7efdcf62bb2521 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-09T05:32:23Z |
| publishDate | 2021-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-7e8c5deb45d240128d7efdcf62bb25212023-12-03T12:31:47ZengMDPI AGMathematics2227-73902021-02-019431510.3390/math9040315A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit ProblemAndrés Leiva-Araos0Héctor Allende-Cid1Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil, Valparaíso 2241, ChileEscuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil, Valparaíso 2241, ChileMost humans today have mobile phones. These devices are permanently collecting and storing behavior data of human society. Nevertheless, data processing has several challenges to be solved, especially if it is obtained from obsolete technologies. Old technologies like GSM and UMTS still account for almost half of all devices globally. The main problem in the data is known as neighboring network hit (NNH). An NNH occurs when a cellular device connects to a site further away than it corresponds to by network design, introducing an error in the spatio-temporal mobility analysis. The problems presented by the data are mitigated by eliminating erroneous data or diluting them statistically based on increasing the amount of data processed and the size of the study area. None of these solutions are effective if what is sought is to study mobility in small areas (e.g., Covid-19 pandemic). Elimination of complete records or traces in the time series generates deviations in subsequent analyses; this has a special impact on reduced spatial coverage studies. The present work is an evolution of the previous approach to NNH correction (NFA) and travel inference (TCA), based on binary logic. NFA and TCA combined deliver good travel counting results compared to government surveys (2.37 vs. 2.27, respectively). However, its main contribution is given by the increase in the precision of calculating the distances traveled (37% better than previous studies). In this document, we introduce FNFA and FTCA. Both algorithms are based on fuzzy logic and deliver even better results. We observed an improvement in the trip count (2.29, which represents 2.79% better than NFA). With FNFA and FTCA combined, we observe an average distance traveled difference of 9.2 km, which is 9.8% better than the previous NFA-TCA. Compared to the naive methods (without fixing the <inline-formula><math display="inline"><semantics><mrow><mi>N</mi><mi>N</mi><mi>H</mi><mi>s</mi></mrow></semantics></math></inline-formula>), the improvement rises from 28.8 to 19.6 km (46.9%). We use duly anonymized data from mobile devices from three major cities in Chile. We compare our results with previous works and Government’s Origin and Destination Surveys to evaluate the performance of our solution. This new approach, while improving our previous results, provides the advantages of a model better adapted to the diffuse condition of the problem variables and shows us a way to develop new models that represent open challenges in studies of urban mobility based on cellular data (e.g., travel mode inference).https://www.mdpi.com/2227-7390/9/4/315mobile dataneighboring network hitfuzzy logichuman mobilitydata wrangling |
| spellingShingle | Andrés Leiva-Araos Héctor Allende-Cid A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem Mathematics mobile data neighboring network hit fuzzy logic human mobility data wrangling |
| title | A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem |
| title_full | A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem |
| title_fullStr | A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem |
| title_full_unstemmed | A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem |
| title_short | A Hierarchical Fuzzy-Based Correction Algorithm for the Neighboring Network Hit Problem |
| title_sort | hierarchical fuzzy based correction algorithm for the neighboring network hit problem |
| topic | mobile data neighboring network hit fuzzy logic human mobility data wrangling |
| url | https://www.mdpi.com/2227-7390/9/4/315 |
| work_keys_str_mv | AT andresleivaaraos ahierarchicalfuzzybasedcorrectionalgorithmfortheneighboringnetworkhitproblem AT hectorallendecid ahierarchicalfuzzybasedcorrectionalgorithmfortheneighboringnetworkhitproblem AT andresleivaaraos hierarchicalfuzzybasedcorrectionalgorithmfortheneighboringnetworkhitproblem AT hectorallendecid hierarchicalfuzzybasedcorrectionalgorithmfortheneighboringnetworkhitproblem |