dc.creatorShabanian, Mahdieh
dc.creatorHosseini, Seyed Hadi
dc.date2015-12-19
dc.date.accessioned2023-09-27T19:28:22Z
dc.date.available2023-09-27T19:28:22Z
dc.identifierhttps://periodicos.ufsm.br/cienciaenatura/article/view/20765
dc.identifier10.5902/2179460X20765
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8938728
dc.descriptionTraffic flow prediction is one of the congestion avoidance methods in highways. According to previous studies, no comprehensive model has been proposed for traffic flow prediction which can prevent congestion in many different traffic conditions. Using data fusion to reduce prediction error is an interesting idea to solve this problem. In this paper, a new hybrid algorithm based on mutual information for traffic flow prediction will be proposed and compared with various types of previous hybrid algorithms and predictors. The Mutual Information (MI) algorithm is used to calculate the interdependency of data, so we expect this new hybrid algorithm to have high precision in comparison with others. Simulations will be implemented based on real data in MATLAB environment as a performance demonstration of new hybrid algorithm. Due to variety of traffic flow, performance investigations of our new hybrid algorithm will be done in presence of polluted traffic data in different climatic conditions such as rain/snow fall or other traffic conditions like congestions and accidents on the road, indicating robustness of this algorithm to different types of noisy dataen-US
dc.formatapplication/pdf
dc.languagepor
dc.publisherUniversidade Federal de Santa Mariaen-US
dc.relationhttps://periodicos.ufsm.br/cienciaenatura/article/view/20765/pdf
dc.sourceCiência e Natura; Vol. 37 (2015): SPECIAL EDITION - PART 2; 146-155en-US
dc.sourceCiência e Natura; v. 37 (2015): EDIÇÃO ESPECIAL – PART 2; 146-155pt-BR
dc.source2179-460X
dc.source0100-8307
dc.titleSensor Data Fusion Using Mutual Information Algorithmen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución