{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:23:36Z","timestamp":1769315016236,"version":"3.49.0"},"reference-count":18,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T00:00:00Z","timestamp":1473811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Trajectory prediction is an important problem that has a large number of applications. A common approach to trajectory prediction is based on historical trajectories. However, existing techniques suffer from the \u201cdata sparsity problem\u201d. The available historical trajectories are far from enough to cover all possible query trajectories. We propose the sparsity trajectory prediction algorithm based on multiple entropy measures (STP-ME) to address the data sparsity problem. Firstly, the moving region is iteratively divided into a two-dimensional plane grid graph, and each trajectory is represented as a grid sequence with temporal information. Secondly, trajectory entropy is used to evaluate trajectory\u2019s regularity, the L-Z entropy estimator is implemented to calculate trajectory entropy, and a new trajectory space is generated through trajectory synthesis. We define location entropy and time entropy to measure the popularity of locations and timeslots respectively. Finally, a second-order Markov model that contains a temporal dimension is adopted to perform sparse trajectory prediction. The experiments show that when trip completed percentage increases towards 90%, the coverage of the baseline algorithm decreases to almost 25%, while the STP-ME algorithm successfully copes with it as expected with only an unnoticeable drop in coverage, and can constantly answer almost 100% of query trajectories. It is found that the STP-ME algorithm improves the prediction accuracy generally by as much as 8%, 3%, and 4%, compared to the baseline algorithm, the second-order Markov model (2-MM), and sub-trajectory synthesis (SubSyn) algorithm, respectively. At the same time, the prediction time of STP-ME algorithm is negligible (10     \u03bc s    ), greatly outperforming the baseline algorithm (100     ms    ).<\/jats:p>","DOI":"10.3390\/e18090327","type":"journal-article","created":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T10:45:00Z","timestamp":1473849900000},"page":"327","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Sparse Trajectory Prediction Based on Multiple Entropy Measures"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2067-8719","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leijun","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanguo","family":"Xia","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingfu","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,9,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1038\/nature06958","article-title":"Understanding individual human mobility patterns","volume":"453","author":"Gonzalez","year":"2008","journal-title":"Nature"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1126\/science.1177170","article-title":"Limits of predictability in human mobility","volume":"327","author":"Song","year":"2010","journal-title":"Science"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Lian, D., Xie, X., Zheng, V.W., Yuan, N.J., Zhang, F., and Chen, E. (2015). CEPR: A collaborative exploration and periodically returning model for location prediction. ACM Trans. Intell. Syst. Technol., 6.","DOI":"10.1145\/2629557"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.inffus.2014.05.005","article-title":"Human mobility synthesis using matrix and tensor factorizations","volume":"23","author":"Yao","year":"2015","journal-title":"Inf. Fusion"},{"key":"ref_5","unstructured":"Alahi, A., Goel, K., Ramanathan, V., Robicquet, A., Li, F.-F., and Savarese, S. Social LSTM: Human Trajectory Prediction in Crowded Spaces. Available online: http:\/\/web.stanford.edu\/~alahi\/downloads\/CVPR16_N_LSTM.pdf."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1109\/TITS.2014.2353302","article-title":"TraPlan: An Effective Three-in-One Trajectory-Prediction Model in Transportation Networks","volume":"16","author":"Qiao","year":"2015","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Gambs, S., Killijian, M.O., and Del Prado Cortez, M.N. (2012, January 10\u201313). Next place prediction using mobility Markov chains. Proceedings of the First Workshop on Measurement, Privacy, and Mobility, Bern, Switzerland.","DOI":"10.1145\/2181196.2181199"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Smith, G., Wieser, R., Goulding, J., and Barrack, D. (2014, January 24\u201328). A refined limit on the predictability of human mobility. Proceedings of the 2014 IEEE International Conference on Pervasive Computing and Communications, Budapest, Hungary.","DOI":"10.1109\/PerCom.2014.6813948"},{"key":"ref_9","unstructured":"Abdel-Fatao, H., Li, J., and Liu, J. (2015). Data Science, Springer."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Xue, A.Y., Zhang, R., Zheng, Y., Xie, X., Huang, J., and Xu, Z. (2013, January 8\u201312). Destination prediction by sub-trajectory synthesis and privacy protection against such prediction. Proceedings of the IEEE 29th International Conference on Data Engineering (ICDE), Brisbane, Australia.","DOI":"10.1109\/ICDE.2013.6544830"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00778-014-0369-7","article-title":"Solving the data sparsity problem in destination prediction","volume":"24","author":"Xue","year":"2014","journal-title":"VLDB J."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3390\/entropy-e10020071","article-title":"Estimating the entropy of binary time series: Methodology, some theory and a simulation study","volume":"10","author":"Gao","year":"2008","journal-title":"Entropy"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"8207","DOI":"10.3390\/e17127872","article-title":"Permutation Entropy for Random Binary Sequences","volume":"17","author":"Liu","year":"2015","journal-title":"Entropy"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chen, B., Wang, J., Zhao, H., and Principe, J.C. (2016). Insights into Entropy as a Measure of Multivariate Variability. Entropy, 18.","DOI":"10.3390\/e18050196"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Toffoli, T. (2016). Entropy? Honest!. Entropy, 18.","DOI":"10.3390\/e18070247"},{"key":"ref_16","unstructured":"Mclnerney, J., Stein, S., Rogers, A., and Jennings, N.R. Exploring Periods of Low Predictability in Daily Life Mobility. Available online: http:\/\/eprints.soton.ac.uk\/339940\/1\/paper_extended_past2.pdf."},{"key":"ref_17","unstructured":"Microsoft Research: T-Drive Trajectory Data Sample. Available online: https:\/\/www.microsoft.com\/en-us\/research\/publication\/t-drive-trajectory-data-sample\/."},{"key":"ref_18","unstructured":"Ziebart, B.D., Maas, A.L., Dey, A.K., and Begnell, J.A. Navigate Like a Cabbie: Probabilistic Reasoning from Observed Context-Aware Behavior. Available online: http:\/\/www.cs.cmu.edu\/~bziebart\/publications\/navigate-bziebart.pdf."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/18\/9\/327\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:30:54Z","timestamp":1760211054000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/18\/9\/327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,14]]},"references-count":18,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2016,9]]}},"alternative-id":["e18090327"],"URL":"https:\/\/doi.org\/10.3390\/e18090327","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,14]]}}}