{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:27:09Z","timestamp":1740122829141,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11063-022-10941-3","type":"journal-article","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T21:03:55Z","timestamp":1656363835000},"page":"12719-12736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A*-FastIsomap: An Improved Performance of Classical Isomap Based on A* Search Algorithm"],"prefix":"10.1007","volume":"55","author":[{"given":"Tanzeel U.","family":"Rehman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1117-938X","authenticated-orcid":false,"given":"Mahwish","family":"Yousaf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"issue":"1","key":"10941_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s11390-011-9422-9","volume":"26","author":"Z Han","year":"2011","unstructured":"Han Z, Meng D-Y, Xu Z-B, Gu N-N (2011) Incremental alignment manifold learning. J Comput Sci Technol 26(1):153\u2013165","journal-title":"J Comput Sci Technol"},{"issue":"7","key":"10941_CR2","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1016\/j.patrec.2008.01.005","volume":"29","author":"D Meng","year":"2008","unstructured":"Meng D, Leung Y, Xu Z, Fung T, Zhang Q (2008) Improving geodesic distance estimation based on locally linear assumption. Pattern Recogn Lett 29(7):862\u2013870","journal-title":"Pattern Recogn Lett"},{"issue":"2","key":"10941_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TKDE.2011.191","volume":"25","author":"D Meng","year":"2011","unstructured":"Meng D, Leung Y, Xu Z (2011) Detecting intrinsic loops underlying data manifold. IEEE Trans Knowl Data Eng 25(2):337\u2013347","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"10941_CR4","unstructured":"Saul LK, Roweis ST (2003) Think globally, fit locally: unsupervised learning of low dimensional manifolds. Departmental Papers (CIS), 12"},{"key":"10941_CR5","first-page":"705","volume":"15","author":"V De Silva","year":"2002","unstructured":"De Silva V, Tenenbaum JB (2002) Global versus local methods in nonlinear dimensionality reduction. NIPS 15:705\u2013712","journal-title":"NIPS"},{"key":"10941_CR6","doi-asserted-by":"crossref","unstructured":"Liang D, Qiao C, Xu Z (2015) Enhancing both efficiency and representational capability of isomap by extensive landmark selection. Mathematical Problems in Engineering 2015","DOI":"10.1155\/2015\/241436"},{"key":"10941_CR7","doi-asserted-by":"crossref","unstructured":"Shi H, Yin B, Bao Y, Lei Y (2016) A novel landmark point selection method for l-isomap. In: 2016 12th IEEE International Conference on Control and Automation (ICCA), pp 621\u2013625. IEEE","DOI":"10.1109\/ICCA.2016.7505347"},{"issue":"5500","key":"10941_CR8","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum JB, De Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319\u20132323","journal-title":"Science"},{"issue":"1","key":"10941_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S1064827502419154","volume":"26","author":"Z Zhang","year":"2004","unstructured":"Zhang Z, Zha H (2004) Principal manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM J Sci Comput 26(1):313\u2013338","journal-title":"SIAM J Sci Comput"},{"issue":"6","key":"10941_CR10","doi-asserted-by":"publisher","first-page":"2907","DOI":"10.1073\/pnas.96.6.2907","volume":"96","author":"P Tamayo","year":"1999","unstructured":"Tamayo P, Slonim D, Mesirov J, Zhu Q, Kitareewan S, Dmitrovsky E, Lander ES, Golub TR (1999) Interpreting patterns of gene expression with self-organizing maps: methods and application to hematopoietic differentiation. Proc Natl Acad Sci 96(6):2907\u20132912","journal-title":"Proc Natl Acad Sci"},{"issue":"6","key":"10941_CR11","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373\u20131396","journal-title":"Neural Comput"},{"issue":"5500","key":"10941_CR12","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323\u20132326","journal-title":"Science"},{"key":"10941_CR13","doi-asserted-by":"crossref","unstructured":"Hong-Yuan W, Xiu-Jie D, Qi-Cai C, Fu-Hua C (2013) An improved isomap for visualization and classification of multiple manifolds. In: International Conference on Neural Information Processing, pp 1\u201312. Springer","DOI":"10.1007\/978-3-642-42042-9_1"},{"key":"10941_CR14","doi-asserted-by":"crossref","unstructured":"Qu T, Cai Z (2015) A fast isomap algorithm based on fibonacci heap. In: International Conference in Swarm Intelligence, pp 225\u2013231. Springer","DOI":"10.1007\/978-3-319-20469-7_25"},{"key":"10941_CR15","doi-asserted-by":"crossref","unstructured":"Qu T, Cai Z (2017) An improved isomap method for manifold learning. International Journal of Intelligent Computing and Cybernetics","DOI":"10.1108\/IJICC-03-2016-0014"},{"key":"10941_CR16","doi-asserted-by":"crossref","unstructured":"Lei Y-K, Xu Y, Zhang S-W, Wang S-L, Ding Z-G (2010) Fast isomap based on minimum set coverage. In: International Conference on Intelligent Computing, pp 173\u2013179. Springer","DOI":"10.1007\/978-3-642-14932-0_22"},{"key":"10941_CR17","unstructured":"DS GMJ (1979) Computers and intractability: a guide to the theory of np-completeness. San Franciso WH Freeman and co"},{"issue":"6","key":"10941_CR18","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.4304\/jsw.6.6.1034-1041","volume":"6","author":"L Jing","year":"2011","unstructured":"Jing L, Shao C (2011) Selection of the suitable parameter value for isomap. J Softw 6(6):1034\u20131041","journal-title":"J Softw"},{"key":"10941_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.robot.2018.04.007","volume":"106","author":"B Fu","year":"2018","unstructured":"Fu B, Chen L, Zhou Y, Zheng D, Wei Z, Dai J, Pan H (2018) An improved a* algorithm for the industrial robot path planning with high success rate and short length. Robot Auton Syst 106:26\u201337","journal-title":"Robot Auton Syst"},{"issue":"1","key":"10941_CR20","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TSMCB.2012.2202901","volume":"43","author":"Z Zhang","year":"2012","unstructured":"Zhang Z, Chow TW, Zhao M (2012) M-isomap: Orthogonal constrained marginal isomap for nonlinear dimensionality reduction. IEEE Trans Cybern 43(1):180\u2013191","journal-title":"IEEE Trans Cybern"},{"key":"10941_CR21","doi-asserted-by":"publisher","first-page":"199470","DOI":"10.1109\/ACCESS.2020.3017954","volume":"8","author":"M Yousaf","year":"2020","unstructured":"Yousaf M, Rehman TU, Liao D, Alhusaini N, Jing L (2020) Fastisomapvis: A novel approach for nonlinear manifold learning. IEEE Access 8:199470\u2013199481","journal-title":"IEEE Access"},{"issue":"7","key":"10941_CR22","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1109\/TPAMI.2015.2487981","volume":"38","author":"A Najafi","year":"2016","unstructured":"Najafi A, Joudaki A, Fatemizadeh E (2016) Nonlinear dimensionality reduction via path-based isometric mapping. IEEE Trans Pattern Anal Mach Intell 38(7):1452\u20131464","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"10941_CR23","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s13042-018-0809-6","volume":"10","author":"R Huang","year":"2019","unstructured":"Huang R, Zhang G, Chen J (2019) Semi-supervised discriminant isomap with application to visualization, image retrieval and classification. Int J Mach Learn Cybern 10(6):1269\u20131278","journal-title":"Int J Mach Learn Cybern"},{"issue":"6755","key":"10941_CR24","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"issue":"4","key":"10941_CR25","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"WS Torgerson","year":"1952","unstructured":"Torgerson WS (1952) Multidimensional scaling: I. theory and method. Psychometrika 17(4):401\u2013419","journal-title":"Psychometrika"},{"key":"10941_CR26","doi-asserted-by":"crossref","unstructured":"Cox MAA, Cox TF (2008) Multidimensional Scaling, pp 315\u2013347. Springer,Berlin Heidelberg","DOI":"10.1007\/978-3-540-33037-0_14"},{"issue":"2065","key":"10941_CR27","first-page":"2015","volume":"374","author":"IT Jolliffe","year":"2016","unstructured":"Jolliffe IT, Cadima J (2016) Principal component analysis: a review and recent developments. Philos Trans Royal Soc Math Phys Eng Sci 374(2065):2015\u20130202","journal-title":"Philos Trans Royal Soc Math Phys Eng Sci"},{"issue":"5","key":"10941_CR28","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf B, Smola A, M\u00fcller K-R (1998) Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput 10(5):1299\u20131319","journal-title":"Neural Comput"},{"issue":"6","key":"10941_CR29","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1109\/TVCG.2009.119","volume":"15","author":"S Takahashi","year":"2009","unstructured":"Takahashi S, Fujishiro I, Okada M (2009) Applying manifold learning to plotting approximate contour trees. IEEE Trans Visual Comput Graphics 15(6):1185\u20131192","journal-title":"IEEE Trans Visual Comput Graphics"},{"key":"10941_CR30","doi-asserted-by":"crossref","unstructured":"Yazdian N, Tie Y, Venetsanopoulos A, Guan L (2014) Automatic ontario license plate recognition using local normalization and intelligent character classification. In: 2014 IEEE 27th Canadian Conference on Electrical and Computer Engineering (CCECE), pp 1\u20136. IEEE","DOI":"10.1109\/CCECE.2014.6900979"},{"issue":"9","key":"10941_CR31","doi-asserted-by":"publisher","first-page":"2420","DOI":"10.1109\/TSP.2015.2411211","volume":"63","author":"S Gepshtein","year":"2015","unstructured":"Gepshtein S, Keller Y (2015) Sensor network localization by augmented dual embedding. IEEE Trans Signal Process 63(9):2420\u20132431","journal-title":"IEEE Trans Signal Process"},{"key":"10941_CR32","doi-asserted-by":"crossref","unstructured":"Rana S, Singh A (2016) Comparative analysis of sentiment orientation using svm and naive bayes techniques. In: 2016 2nd International Conference on Next Generation Computing Technologies (NGCT), pp 106\u2013111. IEEE","DOI":"10.1109\/NGCT.2016.7877399"},{"issue":"6","key":"10941_CR33","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1109\/TMI.2006.891484","volume":"26","author":"R Verma","year":"2007","unstructured":"Verma R, Khurd P, Davatzikos C (2007) On analyzing diffusion tensor images by identifying manifold structure using isomaps. IEEE Trans Med Imaging 26(6):772\u2013778","journal-title":"IEEE Trans Med Imaging"},{"issue":"2","key":"10941_CR34","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1109\/TNNLS.2019.2908982","volume":"31","author":"J Yu","year":"2019","unstructured":"Yu J, Zhu C, Zhang J, Huang Q, Tao D (2019) Spatial pyramid-enhanced netvlad with weighted triplet loss for place recognition. IEEE Trans Neural Netw learning sys 31(2):661\u2013674","journal-title":"IEEE Trans Neural Netw learning sys"},{"key":"10941_CR35","unstructured":"Chen D, Li X, Li S (2021) A novel convolutional neural network model based on beetle antennae search optimization algorithm for computerized tomography diagnosis. IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10941_CR36","unstructured":"Maier M, Von Luxburg U, Hein M (2008) Influence of graph construction on graph-based clustering measures. In: NIPS, 1025: 1032. Citeseer"},{"issue":"8\u20139","key":"10941_CR37","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ipl.2010.02.001","volume":"110","author":"S Hougardy","year":"2010","unstructured":"Hougardy S (2010) The floyd-warshall algorithm on graphs with negative cycles. Inf Process Lett 110(8\u20139):279\u2013281","journal-title":"Inf Process Lett"},{"key":"10941_CR38","doi-asserted-by":"crossref","unstructured":"Silpa-Anan C, Hartley RI (2008) Optimised kd-trees for fast image descriptor matching. 2008 IEEE Conference on Computer Vision and Pattern Recognition, 1\u20138","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"10941_CR39","doi-asserted-by":"crossref","unstructured":"Jo J, Seo J, Fekete J-D (2017) A progressive kd tree for approximate k-nearest neighbors. In: 2017 IEEE Workshop on Data Systems for Interactive Analysis (DSIA), pp 1\u20135. IEEE","DOI":"10.1109\/DSIA.2017.8339084"},{"issue":"331\u2013340","key":"10941_CR40","first-page":"2","volume":"2","author":"M Muja","year":"2009","unstructured":"Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. VISAPP (1) 2(331\u2013340):2","journal-title":"VISAPP (1)"},{"issue":"1","key":"10941_CR41","first-page":"69","volume":"1","author":"FB Zhan","year":"1997","unstructured":"Zhan FB (1997) Three fastest shortest path algorithms on real road networks: Data structures and procedures. J Geogr Inf Decis Anal 1(1):69\u201382","journal-title":"J Geogr Inf Decis Anal"},{"key":"10941_CR42","unstructured":"Xiao-Yan L, Yan-Li C (2010) Application of dijkstra algorithm in logistics distribution lines. In: Third International Symposium on Computer Science and Computational Technology (ISCSCT\u201910), Jiaozuo, PR China, pp 048\u2013050. Citeseer"},{"key":"10941_CR43","doi-asserted-by":"crossref","unstructured":"Abujassar R, Ghanbari M (2011) Efficient algorithms to enhance recovery schema in link state protocols. arXiv preprint arXiv:1108.1426","DOI":"10.5121\/iju.2011.2304"},{"key":"10941_CR44","unstructured":"Wang H, Yu Y, Yuan Q (2011) Application of dijkstra algorithm in robot path-planning. In: 2011 Second International Conference on Mechanic Automation and Control Engineering, pp 1067\u20131069. IEEE"},{"issue":"3","key":"10941_CR45","doi-asserted-by":"publisher","first-page":"876","DOI":"10.4314\/njt.v36i3.30","volume":"36","author":"A Eneh","year":"2017","unstructured":"Eneh A, Arinze U (2017) Comparative analysis and implementation of dijkstra\u2019s shortest path algorithm for emergency response and logistic planning. Niger J Technol 36(3):876\u2013888","journal-title":"Niger J Technol"},{"issue":"11","key":"10941_CR46","first-page":"6450","volume":"2","author":"S Sivakumar","year":"2014","unstructured":"Sivakumar S, Chandrasekar C (2014) Modified dijkstra\u2019s shortest path algorithm. Int J Innov Research Comp Commun Eng 2(11):6450\u20136456","journal-title":"Int J Innov Research Comp Commun Eng"},{"issue":"7","key":"10941_CR47","doi-asserted-by":"publisher","first-page":"3262","DOI":"10.1109\/TIP.2012.2190083","volume":"21","author":"J Yu","year":"2012","unstructured":"Yu J, Tao D, Wang M (2012) Adaptive hypergraph learning and its application in image classification. IEEE Trans Image Process 21(7):3262\u20133272","journal-title":"IEEE Trans Image Process"},{"issue":"2","key":"10941_CR48","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE trans Sys Sci Cybern 4(2):100\u2013107","journal-title":"IEEE trans Sys Sci Cybern"},{"issue":"2","key":"10941_CR49","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest paths algorithms: Theory and experimental evaluation. Math Program 73(2):129\u2013174","journal-title":"Math Program"},{"issue":"8","key":"10941_CR50","first-page":"63","volume":"16","author":"M Gulraj","year":"2016","unstructured":"Gulraj M, Ahmad N (2016) Mood detection of psychological and mentally disturbed patients using machine learning techniques. Int J Comp Sci Network Secur (IJCSNS) 16(8):63","journal-title":"Int J Comp Sci Network Secur (IJCSNS)"},{"key":"10941_CR51","unstructured":"Amsaleg L, Jegou H (2010) Datasets for approximate nearest neighbor search"},{"key":"10941_CR52","volume-title":"SNAP Datasets: Stanford large network dataset collection","author":"J Leskovec","year":"2014","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. MI, USA, Ann Arbor"},{"issue":"1","key":"10941_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-40927-6","volume":"9","author":"DA Gredell","year":"2019","unstructured":"Gredell DA, Schroeder AR, Belk KE, Broeckling CD, Heuberger AL, Kim S-Y, King DA, Shackelford SD, Sharp JL, Wheeler TL et al (2019) Comparison of machine learning algorithms for predictive modeling of beef attributes using rapid evaporative ionization mass spectrometry (reims) data. Sci Rep 9(1):1\u20139","journal-title":"Sci Rep"},{"issue":"6","key":"10941_CR54","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/TSMCB.2005.850151","volume":"35","author":"X Geng","year":"2005","unstructured":"Geng X, Zhan D-C, Zhou Z-H (2005) Supervised nonlinear dimensionality reduction for visualization and classification. IEEE Trans Sys Man Cybern Part B (Cybern) 35(6):1098\u20131107","journal-title":"IEEE Trans Sys Man Cybern Part B (Cybern)"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10941-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-022-10941-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10941-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T09:16:34Z","timestamp":1703668594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-022-10941-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":54,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["10941"],"URL":"https:\/\/doi.org\/10.1007\/s11063-022-10941-3","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2022,6,27]]},"assertion":[{"value":"20 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2022","order":2,"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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}