Abstract

The Internet of Things (IoT) has enormous potential to transform the transport industry by improving passenger experiences, safety, and efficiency. However, the collected spatiotemporal data by traffic sensor network often suffer from missing values (MVs), which affect the overall performance of the system. As a result, accurate recovery of MVs is essential for the successful application of IoT in transportation. In this article, we propose a novel MVs imputation model by integrating low-rank tensor completion (LRTC) and sparse self-representation into a unified framework. In doing so, the global multidimensional correlation, as well as sample self-similarity, can be well leveraged for imputation. In order to solve the proposed model, an elaborate solution algorithm is developed, following the principle of alternating direction method of multipliers (ADMMs). Importantly, each step in ADMM can be implemented efficiently by analyzing the problem structure. Moreover, in order to select proper parameters for the model, an improved harmony search heuristic algorithm based on dual harmonies generation strategy is developed, thus sufficiently considering the information contained in current harmony memory. The experiments on two real-world traffic data are carried out to evaluate the proposed approach. The results verify that in comparison with the classic matrix/tensor completion and other competing algorithms, our method significantly improves the imputation performance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.