{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:01:23Z","timestamp":1769155283984,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T00:00:00Z","timestamp":1626912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T00:00:00Z","timestamp":1626912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFC0830400"],"award-info":[{"award-number":["2018YFC0830400"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00521-021-06274-2","type":"journal-article","created":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T19:17:16Z","timestamp":1626981436000},"page":"9247-9255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Spatial\u2013temporal grid clustering method based on frequent stay point recognition"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9826-2070","authenticated-orcid":false,"given":"Bin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuxia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,22]]},"reference":[{"issue":"6191","key":"6274_CR1","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"key":"6274_CR2","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 96:226\u2013231","journal-title":"KDD"},{"issue":"3","key":"6274_CR3","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/3068335","volume":"42","author":"E Schubert","year":"2017","unstructured":"Schubert E, Sander J, Ester M, Kriegel H-P, Xiaowei X (2017) DBSCAN revisited, revisited: why and how you should (still) use DBSCAN. ACM Trans Database Syst 42(3):19:1-19:21","journal-title":"ACM Trans Database Syst"},{"key":"6274_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.patcog.2016.03.008","volume":"58","author":"K Mahesh Kumar","year":"2016","unstructured":"Mahesh Kumar K, A. Rama Mohan Reddy (2016) A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method. Pat Recog 58:39\u201348","journal-title":"Pat Recog"},{"key":"6274_CR5","doi-asserted-by":"publisher","first-page":"44576","DOI":"10.1109\/ACCESS.2020.2977747","volume":"8","author":"DuQ Hao Xue","year":"2020","unstructured":"Hao Xue DuQ, Huynh MR (2020) A Location-velocity-temporal attention LSTM model for pedestrian trajectory prediction. IEEE Access 8:44576\u201344589","journal-title":"IEEE Access"},{"issue":"3","key":"6274_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1080\/01441647.2014.903530","volume":"34","author":"L Shen","year":"2014","unstructured":"Shen L, Stopher PR (2014) Review of GPS travel survey and GPS data-processing methods. Transp Rev 34(3):316\u2013334","journal-title":"Transp Rev"},{"key":"6274_CR7","doi-asserted-by":"crossref","unstructured":"Song H, Lee J-G (2018) RP-DBSCAN: a superfast parallel DBSCAN algorithm based on random partitioning. SIGMOD conference 1173\u20131187","DOI":"10.1145\/3183713.3196887"},{"key":"6274_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.trc.2016.12.009","volume":"75","author":"M Zimmermann","year":"2017","unstructured":"Zimmermann M, Mai T, Frejinger E (2017) Bike route choice modeling using GPS data without choice sets of paths. Transp Res Part C Emerg Technol 75:183\u2013196","journal-title":"Transp Res Part C Emerg Technol"},{"key":"6274_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.patcog.2019.01.034","volume":"90","author":"T Boonchoo","year":"2019","unstructured":"Boonchoo T, Ao X, Liu Y, Zhao W, Zhuang F, He Q (2019) Grid-based DBSCAN: indexing and inference. Pat Recogn 90:271\u2013284","journal-title":"Pat Recogn"},{"key":"6274_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ins.2019.06.036","volume":"502","author":"SF Gal\u00e1n","year":"2019","unstructured":"Gal\u00e1n SF (2019) Comparative evaluation of region query strategies for DBSCAN clustering. Inf Sci 502:76\u201390","journal-title":"Inf Sci"},{"key":"6274_CR11","doi-asserted-by":"publisher","first-page":"28142","DOI":"10.1109\/ACCESS.2020.2971388","volume":"8","author":"Q Zeng","year":"2020","unstructured":"Zeng Q, Wang J, He K (2020) Improving destination prediction via ensemble of trajectory movement separation and adaptive clustering. IEEE Access 8:28142\u201328154","journal-title":"IEEE Access"},{"issue":"5","key":"6274_CR12","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s13042-016-0603-2","volume":"9","author":"Xu Xiao","year":"2018","unstructured":"Xiao Xu, Ding S, Mingjing Du, Xue Yu (2018) DPCG: an efficient density peaks clustering algorithm based on grid. Int J Mach Learn Cybern 9(5):743\u2013754","journal-title":"Int J Mach Learn Cybern"},{"issue":"12","key":"6274_CR13","doi-asserted-by":"publisher","first-page":"2014","DOI":"10.3390\/sym12122014","volume":"12","author":"Yi Lv","year":"2020","unstructured":"Lv Yi, Liu M, Xiang Y (2020) Fast searching density peak clustering algorithm based on shared nearest neighbor and adaptive clustering center. Symmetry 12(12):2014","journal-title":"Symmetry"},{"key":"6274_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.jvcir.2019.01.038","volume":"59","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Lin Y (2019) An interactive method for identifying the stay points of the trajectory of moving objects. J Vis Commun Image Rep 59:387\u2013392","journal-title":"J Vis Commun Image Rep"},{"issue":"20","key":"6274_CR15","doi-asserted-by":"publisher","first-page":"15529","DOI":"10.1007\/s00500-020-04881-0","volume":"24","author":"MH Rad","year":"2020","unstructured":"Rad MH, Abdolrazzagh-Nezhad M (2020) A new hybridization of DBSCAN and fuzzy earthworm optimization algorithm for data cube clustering. Soft Comput 24(20):15529\u201315549","journal-title":"Soft Comput"},{"key":"6274_CR16","doi-asserted-by":"publisher","first-page":"107624","DOI":"10.1016\/j.patcog.2020.107624","volume":"109","author":"Y Chen","year":"2021","unstructured":"Chen Y, Zhou L, Bouguila N, Wang C, Chen Y, Du J (2021) BLOCK-DBSCAN: fast clustering for large scale data. Pat Recog 109:107624","journal-title":"Pat Recog"},{"key":"6274_CR17","doi-asserted-by":"crossref","unstructured":"Yang Y, Cai J, Yang H, Zhang J, Zhao X (2020) TAD: a trajectory clustering algorithm based on spatial-temporal density analysis. Exp Syst Appl 139","DOI":"10.1016\/j.eswa.2019.112846"},{"issue":"2","key":"6274_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10619-012-7115-1","volume":"31","author":"P-R Lei","year":"2013","unstructured":"Lei P-R, Li S-C, Peng W-C (2013) QS-STT: QuadSection clustering and spatial-temporal trajectory model for location prediction. Distrib Parallel Databases 31(2):231\u2013258","journal-title":"Distrib Parallel Databases"},{"issue":"11","key":"6274_CR19","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.3390\/sym12111854","volume":"12","author":"H-T Hoang","year":"2020","unstructured":"Hoang H-T, Pham Q-V, Hwang W-J (2020) Spatial-temporal-DBSCAN-based user clustering and power allocation for sum rate maximization in millimeter-wave NOMA systems. Symmetry 12(11):1854","journal-title":"Symmetry"},{"key":"6274_CR20","first-page":"1","volume":"6692313","author":"S Wang","year":"2021","unstructured":"Wang S, Li A, Xie S, Li WenZhu, Wang BoWei, Yao S, Asif M (2021) A spatial-temporal self-attention network (STSAN) for location prediction. CompLex 6692313:1\u201313","journal-title":"CompLex"},{"issue":"2","key":"6274_CR21","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/3381424","volume":"16","author":"M-F Balcan","year":"2020","unstructured":"Balcan M-F, Haghtalab N, White C (2020) k-center clustering under perturbation resilience. ACM Trans Algorithms 16(2):22:1-22:39","journal-title":"ACM Trans Algorithms"},{"key":"6274_CR22","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.future.2018.04.002","volume":"110","author":"M H\u00fcsch","year":"2020","unstructured":"H\u00fcsch M, Schyska BU, von Bremen L (2020) CorClustST - correlation-based clustering of big spatio-temporal datasets. Futur Gener Comput Syst 110:610\u2013619","journal-title":"Futur Gener Comput Syst"},{"key":"6274_CR23","doi-asserted-by":"publisher","first-page":"106185","DOI":"10.1016\/j.knosys.2020.106185","volume":"204","author":"Z Pan","year":"2020","unstructured":"Pan Z, Wang Y, Pan Y (2020) A new locally adaptive k-nearest neighbor algorithm based on discrimination class. Knowl Based Syst 204:106185","journal-title":"Knowl Based Syst"},{"issue":"1","key":"6274_CR24","doi-asserted-by":"publisher","first-page":"521","DOI":"10.3233\/JIFS-200124","volume":"40","author":"J Zhai","year":"2021","unstructured":"Zhai J, Qi J, Zhang S (2021) An instance selection algorithm for fuzzy K-nearest neighbor. J Intell Fuzzy Syst 40(1):521\u2013533","journal-title":"J Intell Fuzzy Syst"},{"key":"6274_CR25","doi-asserted-by":"publisher","first-page":"168282","DOI":"10.1109\/ACCESS.2020.3021903","volume":"8","author":"L Liu","year":"2020","unstructured":"Liu L, Donghua Yu (2020) Density peaks clustering algorithm based on weighted k-nearest neighbors and geodesic distance. IEEE Access 8:168282\u2013168296","journal-title":"IEEE Access"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06274-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06274-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06274-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T06:07:43Z","timestamp":1652681263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06274-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,22]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["6274"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06274-2","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,22]]},"assertion":[{"value":"8 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}