{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T03:31:13Z","timestamp":1781321473130,"version":"3.54.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T00:00:00Z","timestamp":1550016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T00:00:00Z","timestamp":1550016000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00521-019-04070-7","type":"journal-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T07:26:54Z","timestamp":1550042814000},"page":"6523-6531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Inferring region significance by using multi-source spatial data"],"prefix":"10.1007","volume":"32","author":[{"given":"Shunzhi","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dahan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danhuai","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,2,13]]},"reference":[{"key":"4070_CR1","doi-asserted-by":"crossref","unstructured":"Bakalov P, Hadjieleftheriou M, Keogh EJ, Tsotras VJ (2005) Efficient trajectory joins using symbolic representations. In: MDM, pp 86\u201393","DOI":"10.1145\/1071246.1071259"},{"key":"4070_CR2","unstructured":"Bakalov P, Tsotras VJ (2006) Continuous spatiotemporal trajectory joins. In: GSN, pp 109\u2013128"},{"key":"4070_CR3","unstructured":"Brakatsoulas S, Pfoser D, Salas R, Wenk C (2005) On map-matching vehicle tracking data. In: VLDB, pp 853\u2013864"},{"key":"4070_CR4","doi-asserted-by":"crossref","unstructured":"Chen Y, Patel JM (2009) Design and evaluation of trajectory join algorithms. In: ACM-GIS, pp 266\u2013275","DOI":"10.1145\/1653771.1653809"},{"key":"4070_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Numerische Math 1:269\u2013271","journal-title":"Numerische Math"},{"key":"4070_CR6","doi-asserted-by":"crossref","unstructured":"Ding H, Trajcevski G, Scheuermann P (2008) Efficient similarity join of large sets of moving object trajectories. In: TIME, pp 79\u201387","DOI":"10.1109\/TIME.2008.25"},{"key":"4070_CR7","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"issue":"22","key":"4070_CR8","doi-asserted-by":"crossref","first-page":"29605","DOI":"10.1007\/s11042-017-5381-7","volume":"77","author":"C Lei","year":"2017","unstructured":"Lei C, Zhu X (2017) Unsupervised feature selection via local structure learning and sparse learning. Multimed Tools Appl 77(22):29605\u201329622","journal-title":"Multimed Tools Appl"},{"issue":"6","key":"4070_CR9","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1007\/s11280-017-0496-3","volume":"21","author":"J Li","year":"2018","unstructured":"Li J, Wang Y, Guo YZD, Zhu S (2018) Aggregate location recommendation in dynamic transportation networks. World Wide Web 21(6):1637\u20131653","journal-title":"World Wide Web"},{"key":"4070_CR10","doi-asserted-by":"crossref","unstructured":"Luo W, Tan H, Chen L, Ni LM (2013) Finding time period-based most frequent path in big trajectory data. In: SIGMOD, pp 713\u2013724","DOI":"10.1145\/2463676.2465287"},{"key":"4070_CR11","unstructured":"Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: ICDE, pp 301\u2013312"},{"issue":"2","key":"4070_CR12","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. TODS 30(2):529\u2013576","journal-title":"TODS"},{"issue":"7","key":"4070_CR13","doi-asserted-by":"crossref","first-page":"1549","DOI":"10.1109\/TKDE.2017.2685504","volume":"29","author":"S Shang","year":"2017","unstructured":"Shang S, Chen L, Jensen CS, Wen J-R, Kalnis P (2017) Searching trajectories by regions of interest. IEEE Trans Knowl Data Eng 29(7):1549\u20131562","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"4070_CR14","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/TKDE.2015.2509998","volume":"28","author":"S Shang","year":"2016","unstructured":"Shang S, Chen L, Wei Z, Jensen CS, Wen J, Kalnis P (2016) Collective travel planning in spatial networks. IEEE Trans Knowl Data Eng 28(5):1132\u20131146","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"4070_CR15","first-page":"1178","volume":"10","author":"S Shang","year":"2017","unstructured":"Shang S, Chen L, Wei Z, Jensen CS, Zheng K, Kalnis P (2017) Trajectory similarity join in spatial networks. PVLDB 10(11):1178\u20131189","journal-title":"PVLDB"},{"issue":"3","key":"4070_CR16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00778-018-0502-0","volume":"27","author":"S Shang","year":"2018","unstructured":"Shang S, Chen L, Wei Z, Jensen CS, Zheng K, Kalnis P (2018) Parallel trajectory similarity joins in spatial networks. VLDB J 27(3):395\u2013420","journal-title":"VLDB J"},{"key":"4070_CR17","doi-asserted-by":"crossref","unstructured":"Shang S, Deng K, Xie K (2010) Best point detour query in road networks. In: ACM GIS, pp 71\u201380","DOI":"10.1145\/1869790.1869804"},{"key":"4070_CR18","doi-asserted-by":"crossref","unstructured":"Shang S, Ding R, Yuan B, Xie K, Zheng K, Kalnis P (2012) User oriented trajectory search for trip recommendation. In: EDBT, pp 156\u2013167","DOI":"10.1145\/2247596.2247616"},{"issue":"3","key":"4070_CR19","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s00778-013-0331-0","volume":"23","author":"S Shang","year":"2014","unstructured":"Shang S, Ding R, Zheng K, Jensen CS, Kalnis P, Zhou X (2014) Personalized trajectory matching in spatial networks. VLDB J 23(3):449\u2013468","journal-title":"VLDB J"},{"key":"4070_CR20","doi-asserted-by":"crossref","unstructured":"Shang S, Guo D, Liu J, Liu K (2014) Human mobility prediction and unobstructed route planning in public transport networks. In: MDM, pp 43\u201348","DOI":"10.1109\/MDM.2014.66"},{"key":"4070_CR21","doi-asserted-by":"crossref","unstructured":"Shang S, Lu H, Pedersen TB, Xie X (2013) Finding traffic-aware fastest paths in spatial networks. In: SSTD, pp 128\u2013145","DOI":"10.1007\/978-3-642-40235-7_8"},{"key":"4070_CR22","doi-asserted-by":"crossref","unstructured":"Shang S, Lu H, Pedersen TB, Xie X (2013) Modeling of traffic-aware travel time in spatial networks. In: MDM, pp 247\u2013250","DOI":"10.1109\/MDM.2013.34"},{"key":"4070_CR23","doi-asserted-by":"crossref","unstructured":"Shang S, Yuan B, Deng K, Xie K, Zhou X (2011) Finding the most accessible locations: reverse path nearest neighbor query in road networks. In: ACM GIS, pp 181\u2013190","DOI":"10.1145\/2093973.2093999"},{"issue":"6","key":"4070_CR24","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1109\/TKDE.2014.2382583","volume":"27","author":"S Shang","year":"2015","unstructured":"Shang S, Zheng K, Jensen CS, Yang B, Kalnis P, Li G, Wen J (2015) Discovery of path nearby clusters in spatial networks. IEEE Trans Knowl Data Eng 27(6):1505\u20131518","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"4070_CR25","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/TKDE.2017.2651821","volume":"29","author":"N Ta","year":"2017","unstructured":"Ta N, Li G, Feng J (2017) Signature-based trajectory similarity join. IEEE Trans Knowl Data Eng 29(4):870\u2013883","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4070_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0538-5","author":"Y Wang","year":"2018","unstructured":"Wang Y, Li J, Zhong Y, Zhu S, Guo D, Shang S (2018) Discovery of accessible locations using region-based geo-social data. World Wide Web. \nhttps:\/\/doi.org\/10.1007\/s11280-018-0538-5","journal-title":"World Wide Web"},{"key":"4070_CR27","doi-asserted-by":"crossref","unstructured":"Wenk C, Salas R, Pfoser D (2006) Addressing the need for map-matching speed: localizing global curve-matching algorithms. In: SSDBM, pp 379\u2013388","DOI":"10.1109\/SSDBM.2006.11"},{"key":"4070_CR28","doi-asserted-by":"crossref","unstructured":"Yao B, Chen Z, Gao X, Shang S, Ma S, Guo M (2018) Flexible aggregate nearest neighbor queries in road networks. In: ICDE, pp 1\u201312","DOI":"10.1109\/ICDE.2018.00074"},{"key":"4070_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.06.029","author":"W Zheng","year":"2018","unstructured":"Zheng W, Zhu X, Wen G, Zhu Y, Yu H, Gan J (2018) Unsupervised feature selection by self-paced learning regularization. Pattern Recognit Lett. \nhttps:\/\/doi.org\/10.1016\/j.patrec.2018.06.029","journal-title":"Pattern Recognit Lett"},{"issue":"22","key":"4070_CR30","doi-asserted-by":"crossref","first-page":"29739","DOI":"10.1007\/s11042-017-5272-y","volume":"77","author":"W Zheng","year":"2017","unstructured":"Zheng W, Zhu X, Zhu Y, Hu R, Lei C (2017) Dynamic graph learning for spectral feature selection. Multimed Tools Appl 77(22):29739\u201329755","journal-title":"Multimed Tools Appl"},{"key":"4070_CR31","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.neucom.2016.08.138","volume":"253","author":"S Zhu","year":"2017","unstructured":"Zhu S, Wang Y, Shang S, Zhao G, Wang J (2017) Probabilistic routing using multimodal data. Neurocomputing 253:49\u201355","journal-title":"Neurocomputing"},{"issue":"3","key":"4070_CR32","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/TKDE.2017.2763618","volume":"30","author":"X Zhu","year":"2018","unstructured":"Zhu X, Zhang S, Hu R, Zhu Y, Song J (2018) Local and global structure preservation for robust unsupervised spectral feature selection. IEEE Trans Knowl Data Eng 30(3):517\u2013529","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4070_CR33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2858782","author":"X Zhu","year":"2018","unstructured":"Zhu X, Zhang S, Li Y, Zhang J, Yang L, Fang Y (2018) Low-rank sparse subspace for spectral clustering. IEEE Trans Knowl Data Eng. \nhttps:\/\/doi.org\/10.1109\/TKDE.2018.2858782","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04070-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04070-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04070-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T13:09:51Z","timestamp":1590757791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04070-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,13]]},"references-count":33,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4070"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04070-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,13]]},"assertion":[{"value":"16 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}