{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T09:01:15Z","timestamp":1775552475201,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T00:00:00Z","timestamp":1647820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Cosco Shipping Technology Co., Ltd"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A multiple clustering algorithm based on high-dimensional automatic identification system (AIS) data is proposed to extract the important waypoints in the ship\u2019s navigation trajectory based on selected AIS attribute features and construct a route network using the waypoints. The algorithm improves the accuracy of route network planning by using the latitude and longitude of the historical voyage trajectory and the heading to the ground. Unlike the navigation clustering method that only uses ship latitude and longitude coordinates, the algorithm first calculates the major waypoints using Clustering in QUEst (CLIQUE) and Balance Iterative Reducing and Clustering Using Hierarchies (BIRCH) algorithms, and then builds the route network using network construction. Under the common PC specification (i5 processor), this algorithm forms 440 major waypoints from 220,133 AIS data and constructs a route network with directional features in 5\u00a0min, which is faster in computing speed and more suitable for complex ship trajectory differentiation and can extend the application boundary of ship route planning.<\/jats:p>","DOI":"10.1186\/s13638-022-02108-4","type":"journal-article","created":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T07:03:04Z","timestamp":1647846184000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A novel high-dimensional trajectories construction network based on multi-clustering algorithm"],"prefix":"10.1186","volume":"2022","author":[{"given":"Feiyang","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaohan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,21]]},"reference":[{"issue":"3","key":"2108_CR1","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1017\/S0373463319000948","volume":"73","author":"K Naus","year":"2020","unstructured":"K. Naus, Drafting route plan templates for ships on the basis of AIS historical data. J. Navig. 73(3), 726\u2013745 (2020)","journal-title":"J. Navig."},{"issue":"8","key":"2108_CR2","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"A.K. Jain, Data clustering: 50 years beyond K-means. Pattern Recogn. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"2108_CR3","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1177\/1475921720976986","volume":"20","author":"S Wang","year":"2021","unstructured":"S. Wang, S.A. Zargar, F.-G. Yuan, Augmented reality for enhanced visual inspection through knowledge-based deep learning. Struct. Health Monit. 20(1), 426\u2013442 (2021)","journal-title":"Struct. Health Monit."},{"key":"2108_CR4","doi-asserted-by":"crossref","unstructured":"S. Wang, R.-Y. Fong, F.-G. Yuan. Vibration-based damage imaging via high-speed cameras with 3D digital image correlation using wavelet transform. in Sensors and Smart Structures Technologies for Civil, Mechanical, and Aerospace Systems 2021 (International Society for Optics and Photonics, 2021)","DOI":"10.1117\/12.2585246"},{"key":"2108_CR5","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.oceaneng.2018.12.019","volume":"172","author":"L Zhao","year":"2019","unstructured":"L. Zhao, G. Shi, A trajectory clustering method based on Douglas-Peucker compression and density for marine traffic pattern recognition. Ocean Eng. 172, 456\u2013467 (2019)","journal-title":"Ocean Eng."},{"issue":"4","key":"2108_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.3390\/jmse6040121","volume":"6","author":"M Grifoll","year":"2018","unstructured":"M. Grifoll, T. Karlis, M.I. Ortego, Characterizing the evolution of the container traffic share in the Mediterranean Sea using hierarchical clustering. J. Mar. Sci. Eng. 6(4), 121 (2018)","journal-title":"J. Mar. Sci. Eng."},{"key":"2108_CR7","first-page":"1","volume":"2020","author":"J-F Song","year":"2020","unstructured":"J.-F. Song, S.-Y. Wang, H.-L. Zhao, Traffic flow detection at road intersections based on K-means and NURBS trajectory clustering. Math. Probl. Eng. 2020, 1\u20136 (2020)","journal-title":"Math. Probl. Eng."},{"issue":"1","key":"2108_CR8","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1186\/s40064-016-3329-4","volume":"5","author":"X Wang","year":"2016","unstructured":"X. Wang, Y. Bai, The global Minmax k-means algorithm. Springerplus 5(1), 1665 (2016)","journal-title":"Springerplus"},{"key":"2108_CR9","doi-asserted-by":"publisher","first-page":"102476","DOI":"10.1016\/j.adhoc.2021.102476","volume":"117","author":"P Han","year":"2021","unstructured":"P. Han et al., A combined online-learning model with K-means clustering and GRU neural networks for trajectory prediction. Ad Hoc Netw. 117, 102476 (2021)","journal-title":"Ad Hoc Netw."},{"key":"2108_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-0135-2_74","volume-title":"Hybrid K-Mean and Refinement Based on Ant for Color Image Clustering","author":"L Tyagi","year":"2016","unstructured":"L. Tyagi, M.C. Trivedi, Hybrid K-Mean and Refinement Based on Ant for Color Image Clustering (Springer, Singapore, 2016)"},{"key":"2108_CR11","doi-asserted-by":"crossref","unstructured":"Y. Jiang, et al. A novel classification scheme of moving targets at sea based on Ward's and K-means clustering (2018)","DOI":"10.1145\/3207677.3278058"},{"key":"2108_CR12","unstructured":"L. Zhao, G. Shi, J. Yang. An adaptive hierarchical clustering method for ship trajectory data based on DBSCAN algorithm. IEEE."},{"issue":"6","key":"2108_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.3390\/jmse9060566","volume":"9","author":"L Wang","year":"2021","unstructured":"L. Wang et al., Ship AIS trajectory clustering: an HDBSCAN-based approach. J. Mar. Sci. Eng. 9(6), 566 (2021)","journal-title":"J. Mar. Sci. Eng."},{"key":"2108_CR14","doi-asserted-by":"crossref","unstructured":"F.-G. Yuan, et al. Machine learning for structural health monitoring: challenges and opportunities. in Sensors and Smart Structures Technologies for Civil, Mechanical, and Aerospace Systems 2020 (International Society for Optics and Photonics, 2020)","DOI":"10.1117\/12.2561610"},{"key":"2108_CR15","unstructured":"A. Dobrkovic, M.-E. Iacob, J. Van Hillegersberg. Maritime Pattern Extraction from AIS Data Using a Genetic Algorithm. IEEE"},{"issue":"2\u20133","key":"2108_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s41060-017-0092-8","volume":"5","author":"A Dobrkovic","year":"2018","unstructured":"A. Dobrkovic, M.E. Lacob, J.V. Hillegersberg, Maritime pattern extraction and route reconstruction from incomplete AIS data. Int. J. Data Sci. Anal. 5(2\u20133), 111\u2013136 (2018)","journal-title":"Int. J. Data Sci. Anal."},{"key":"2108_CR17","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s12599-020-00661-0","volume":"62","author":"D Filipiak","year":"2020","unstructured":"D. Filipiak et al., Extracting maritime traffic networks from AIS data using evolutionary algorithm. Bus Inf Syst Eng Int J Wirtschaftsinformatik 62, 435\u2013450 (2020)","journal-title":"Bus Inf Syst Eng Int J Wirtschaftsinformatik"},{"issue":"4","key":"2108_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.3390\/jmse7040090","volume":"7","author":"S Ni","year":"2019","unstructured":"S. Ni, Z. Liu, Y. Cai, Ship manoeuvrability-based simulation for ship navigation in collision situations. J. Mar. Sci. Eng. 7(4), 90 (2019)","journal-title":"J. Mar. Sci. Eng."},{"issue":"3","key":"2108_CR19","doi-asserted-by":"publisher","first-page":"14","DOI":"10.2478\/pomr-2018-0092","volume":"25","author":"S Ni","year":"2018","unstructured":"S. Ni et al., Modelling of ship\u2019s trajectory planning in collision situations by hybrid genetic algorithm. Pol. Marit. Res. 25(3), 14\u201325 (2018)","journal-title":"Pol. Marit. Res."},{"key":"2108_CR20","doi-asserted-by":"publisher","first-page":"190746","DOI":"10.1109\/ACCESS.2020.3031739","volume":"8","author":"L Wang","year":"2020","unstructured":"L. Wang et al., Ship route planning based on double-cycling genetic algorithm considering ship maneuverability constraint. IEEE Access 8, 190746\u2013190759 (2020)","journal-title":"IEEE Access"},{"key":"2108_CR21","doi-asserted-by":"publisher","DOI":"10.12783\/shm2019\/32278","author":"S Wang","year":"2019","unstructured":"S. Wang et al., An efficient augmented reality (AR) system for enhanced visual inspection. Struct. Health Monit. (2019). https:\/\/doi.org\/10.12783\/shm2019\/32278","journal-title":"Struct. Health Monit."},{"issue":"4","key":"2108_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.3390\/jmse9040357","volume":"9","author":"W Zhao","year":"2021","unstructured":"W. Zhao et al., Multicriteria ship route planning method based on improved particle swarm optimization-genetic algorithm. J. Mar. Sci. Eng. 9(4), 357 (2021)","journal-title":"J. Mar. Sci. Eng."},{"key":"2108_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.oceaneng.2018.03.010","volume":"156","author":"J Chen","year":"2018","unstructured":"J. Chen et al., Research on fuzzy control of path tracking for underwater vehicle based on genetic algorithm optimization. Ocean Eng. 156, 217\u2013223 (2018)","journal-title":"Ocean Eng."},{"key":"2108_CR24","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.3390\/app9061057","volume":"9","author":"C Liu","year":"2019","unstructured":"C. Liu et al., An improved A-star algorithm considering water current, traffic separation and berthing for vessel path planning. Appl. Sci. 9, 1057 (2019)","journal-title":"Appl. Sci."},{"issue":"SI","key":"2108_CR25","doi-asserted-by":"publisher","first-page":"911","DOI":"10.2112\/SI93-131.1","volume":"93","author":"K Sun","year":"2019","unstructured":"K. Sun et al., Optimal path planning method of marine sailboat based on fuzzy neural network. J. Coast. Res. 93(SI), 911\u2013916 (2019)","journal-title":"J. Coast. Res."},{"key":"2108_CR26","doi-asserted-by":"publisher","first-page":"109041","DOI":"10.1016\/j.oceaneng.2021.109041","volume":"232","author":"C Tang","year":"2021","unstructured":"C. Tang et al., A method for compressing AIS trajectory data based on the adaptive-threshold Douglas-Peucker algorithm. Ocean Eng. 232, 109041 (2021)","journal-title":"Ocean Eng."},{"key":"2108_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.oceaneng.2018.08.005","volume":"166","author":"L Zhao","year":"2018","unstructured":"L. Zhao, G. Shi, A method for simplifying ship trajectory based on improved Douglas-Peucker algorithm. Ocean Eng. 166, 37\u201346 (2018)","journal-title":"Ocean Eng."},{"key":"2108_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57301-1_5","volume-title":"Efficient similarity search in sequence databases","author":"R Agrawal","year":"1993","unstructured":"R. Agrawal, C. Faloutsos, A. Swami, Efficient similarity search in sequence databases (Springer, Berlin, 1993)"},{"key":"2108_CR29","doi-asserted-by":"crossref","unstructured":"T. Zhang, R. Ramakrishnan, M. Livny. BIRCH: an efficient data clustering method for very large databases. in Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (Association for Computing Machinery, Montreal, 1996), p. 103\u2013114","DOI":"10.1145\/235968.233324"},{"issue":"2","key":"2108_CR30","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/276305.276314","volume":"27","author":"R Agrawal","year":"1998","unstructured":"R. Agrawal et al., Automatic subspace clustering of high dimensional data for data mining applications. SIGMOD Rec. 27(2), 94\u2013105 (1998)","journal-title":"SIGMOD Rec."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02108-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-022-02108-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02108-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T07:14:53Z","timestamp":1647846893000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-022-02108-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,21]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2108"],"URL":"https:\/\/doi.org\/10.1186\/s13638-022-02108-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1060086\/v1","asserted-by":"object"}]},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,21]]},"assertion":[{"value":"13 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2022","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":"Competing interests"}}],"article-number":"18"}}