{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:48:28Z","timestamp":1764784108898,"version":"build-2065373602"},"reference-count":69,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":324,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["NNH14ZEA001N"],"award-info":[{"award-number":["NNH14ZEA001N"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13676-018-0132-0","type":"journal-article","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T04:13:26Z","timestamp":1534133606000},"page":"467-510","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unsupervised prototype reduction for data exploration and an application to air traffic management initiatives"],"prefix":"10.1016","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4008-4627","authenticated-orcid":false,"given":"Alexander","family":"Estes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"Lovell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael O.","family":"Ball","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13676-018-0132-0_bib1","unstructured":"Ball M, Swaroop P, Barnhart C, Yan C, Hansen M, Kang L, Liu Y, Vaze V (2015) Service level expectation setting for air traffic flow management: Practical challenges and benefits assessment. In: Proceedings of the 12th USA\/Europe air traffic management R&D seminar"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2514\/atcq.12.1.1","article-title":"Ground delay programs: optimizing over the included flight set based on distance","volume":"12","author":"Ball","year":"2004","journal-title":"Air Traffic Control Q"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/opre.51.1.167.12795","article-title":"A stochastic integer program with dual network structure and its application to the ground-holding problem","volume":"51","author":"Ball","year":"2003","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.1090.0289","article-title":"Ground delay program planning under uncertainty based on the ration-by-distance principle","volume":"44","author":"Ball","year":"2010","journal-title":"Transp Sci"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1287\/opre.1100.0899","article-title":"An integer optimization approach to large-scale air traffic flow management","volume":"59","author":"Bertsimas","year":"2011","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib6","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1037\/0022-3514.67.3.366","article-title":"Exploring the \u201cplanning fallacy\u201d: why people underestimate their task completion times.","volume":"67","author":"Buehler","year":"1994","journal-title":"J Pers Soc Psychol"},{"issue":"4","key":"10.1007\/s13676-018-0132-0_bib7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1561\/2200000002","article-title":"Dimension reduction: a guided tour","volume":"2","author":"Burges","year":"2010","journal-title":"Found Trends Mach Learn"},{"issue":"6","key":"10.1007\/s13676-018-0132-0_bib8","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1016\/j.jmva.2008.10.015","article-title":"Multivariate mode hunting: data analytic tools with measures of significance","volume":"100","author":"Burman","year":"2009","journal-title":"J Multivar Anal"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0377-2217(02)00464-2","article-title":"Dominant, an algorithm for the p-center problem","volume":"149","author":"Caruso","year":"2003","journal-title":"Eur J Oper Res"},{"issue":"5","key":"10.1007\/s13676-018-0132-0_bib10","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1016\/j.cor.2008.03.009","article-title":"New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems","volume":"36","author":"Chen","year":"2009","journal-title":"Comput Oper Res"},{"issue":"39","key":"10.1007\/s13676-018-0132-0_bib11","doi-asserted-by":"crossref","first-page":"7225","DOI":"10.1039\/C6AY01574C","article-title":"Representative subset selection and outlier detection via isolation forest","volume":"8","author":"Chen","year":"2016","journal-title":"Anal Methods"},{"key":"10.1007\/s13676-018-0132-0_bib12","doi-asserted-by":"crossref","unstructured":"Cheng F, Gulding J, Baszczewski B, Galaviz R (2011) An optimization model for sample day selection in NAS-wide modeling studies. In: Integrated communications, navigation and surveilance conference (ICNS), 2011. IEEE, p L6-1","DOI":"10.1109\/ICNSURV.2011.5935341"},{"issue":"1\u20133","key":"10.1007\/s13676-018-0132-0_bib13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Mathe"},{"issue":"6","key":"10.1007\/s13676-018-0132-0_bib14","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1021\/ci970282v","article-title":"OptiSim: an extended dissimilarity selection method for finding diverse representative subsets","volume":"37","author":"Clark","year":"1997","journal-title":"J Chem Inf Comput Sci"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.2514\/atcq.18.1.85","article-title":"A model for determining ground delay program parameters using a probabilistic forecast of stratus clearing","volume":"18","author":"Cook","year":"2010","journal-title":"Air Traffic Control Q"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0003-2670(02)00651-7","article-title":"Representative subset selection","volume":"468","author":"Daszykowski","year":"2002","journal-title":"Anal Chim Acta"},{"issue":"10","key":"10.1007\/s13676-018-0132-0_bib17","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1016\/j.cor.2010.12.002","article-title":"Bee colony optimization for the p-center problem","volume":"38","author":"Davidovi\u0107","year":"2011","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13676-018-0132-0_bib18","unstructured":"De\u00a0Sisternes\u00a0Jimenez F, Webster MD (2013) Optimal selection of sample weeks for approximating the net load in generation planning problems. Technical report ESD-WP-2013-03, Massachusetts Institute of Technology. Engineering Systems Division"},{"key":"10.1007\/s13676-018-0132-0_bib19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.trc.2013.07.011","article-title":"Cruise speed reduction for ground delay programs: a case study for San Francisco International Airport arrivals","volume":"36","author":"Delgado","year":"2013","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib20","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","article-title":"A new formulation and resolution method for the p-center problem","volume":"16","author":"Elloumi","year":"2004","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13676-018-0132-0_bib21","doi-asserted-by":"crossref","unstructured":"ElNozahy MS, Salama MMA, Seethapathy R (2013) A probabilistic load modelling approach using clustering algorithms. In: 2013 IEEE power energy society general meeting, pp 1\u20135. 10.1109\/PESMG.2013.6672073","DOI":"10.1109\/PESMG.2013.6672073"},{"key":"10.1007\/s13676-018-0132-0_bib22","unstructured":"Ester M, Kriegel HP, Sander J, Xu X, et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedinsg of the 2nd international conference on knowledge discovery and data mining, pp 226\u2013231"},{"key":"10.1007\/s13676-018-0132-0_bib23","unstructured":"Estes A, Ball MO, Lovell D (2017a) Predicting performance of ground delay programs. In: 12th USA\/Europe air traffic management R&D seminar, Seattle, WA"},{"key":"10.1007\/s13676-018-0132-0_bib24","doi-asserted-by":"crossref","unstructured":"Estes A, Lovell D, Ball M (2017b) Data exploration with selection of representative regions: formulation, axioms, methods, and consistency. Technical report, available at SSRN: https:\/\/ssrn.com\/abstract=3005997. Accessed 9 Aug 2018","DOI":"10.2139\/ssrn.3005997"},{"key":"10.1007\/s13676-018-0132-0_bib25","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.compchemeng.2014.03.005","article-title":"Multi-objectives, multi-period optimization of district energy systems: I. Selection of typical operating periods","volume":"65","author":"Fazlollahi","year":"2014","journal-title":"Computers & Chemical Engineering"},{"key":"10.1007\/s13676-018-0132-0_bib26","unstructured":"Flathers B, Fronzak M, Huberdeau M, McKnight C, Wang M, Wilhelm G (2013) A framework for the development of the ATM-weather integration concept. Technical report, The MITRE Corporation"},{"issue":"7","key":"10.1007\/s13676-018-0132-0_bib27","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/TKDE.2007.1037","article-title":"The concentration of fractional distances","volume":"19","author":"Francois","year":"2007","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"10.1007\/s13676-018-0132-0_bib28","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1008894516817","article-title":"Bump hunting in high-dimensional data","volume":"9","author":"Friedman","year":"1999","journal-title":"Stat Comput"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib29","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","article-title":"Prototype selection for nearest neighbor classification: taxonomy and empirical study","volume":"34","author":"Garcia","year":"2012","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10.1007\/s13676-018-0132-0_bib30","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","author":"Gonzalez","year":"1985","journal-title":"Theor Comput Sci"},{"key":"10.1007\/s13676-018-0132-0_bib31","doi-asserted-by":"crossref","unstructured":"Gorripaty S, Hansen M, Pozdnukhov A (2016) Decision support framework to assist air traffic management. In: IEEE\/AIAA 35th digital avionics systems conference (DASC), 2016. IEEE, pp 1\u20136","DOI":"10.1109\/DASC.2016.7777974"},{"key":"10.1007\/s13676-018-0132-0_bib32","doi-asserted-by":"crossref","unstructured":"Grabbe S, Sridhar B, Mukherjee A (2013) Similar days in the NAS: an airport perspective. In: AIAA Aviation technology, integration, and operations conference","DOI":"10.2514\/6.2013-4222"},{"issue":"2","key":"10.1007\/s13676-018-0132-0_bib33","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0377-2217(02)00825-1","article-title":"Lexicographic local search and the p-center problem","volume":"151","author":"Hassin","year":"2003","journal-title":"Eur J Oper Res"},{"year":"1998","series-title":"Fundamentals of domination in graphs","author":"Haynes","key":"10.1007\/s13676-018-0132-0_bib34"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib35","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","article-title":"Bibliography on domination in graphs and some basic definitions of domination parameters","volume":"86","author":"Hedetniemi","year":"1990","journal-title":"Discrete Math"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib36","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01874389","article-title":"When are NP-hard location problems easy?","volume":"1","author":"Hochbaum","year":"1984","journal-title":"Ann Oper Res"},{"issue":"2","key":"10.1007\/s13676-018-0132-0_bib37","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","article-title":"A best possible heuristic for the k-center problem","volume":"10","author":"Hochbaum","year":"1985","journal-title":"Math Oper Res"},{"key":"10.1007\/s13676-018-0132-0_bib38","doi-asserted-by":"crossref","unstructured":"Huo X, Ni XS, Smith AK (2008) A survey of manifold-based learning methods. In: Recent advances in data mining of enterprise data. World Scientific, pp 691\u2013745","DOI":"10.1142\/9789812779861_0015"},{"key":"10.1007\/s13676-018-0132-0_bib39","unstructured":"Ilhan T, Ozsoy F, Pinar M (2002) An efficient exact algorithm for the vertex p-center problem and computational experiments for different set covering subproblems. Technical report, Bilkent University, Department of Industrial Engineering"},{"issue":"2","key":"10.1007\/s13676-018-0132-0_bib40","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01898350","article-title":"The plane with parallel coordinates","volume":"1","author":"Inselberg","year":"1985","journal-title":"Vis Comput"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib41","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: a review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput Surv (CSUR)"},{"year":"1979","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Johnson","key":"10.1007\/s13676-018-0132-0_bib42"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib43","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1037\/0033-295X.103.3.582","article-title":"On the reality of cognitive illusions","volume":"103","author":"Kahneman","year":"1996","journal-title":"Psychol Rev"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib44","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/00401706.1969.10490666","article-title":"Computer aided design of experiments","volume":"11","author":"Kennard","year":"1969","journal-title":"Technometrics"},{"issue":"2","key":"10.1007\/s13676-018-0132-0_bib45","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/trsc.1050.0129","article-title":"Equitable models for the stochastic ground-holding problem under collaborative decision making","volume":"40","author":"Kotnyek","year":"2006","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-018-0132-0_bib46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trc.2016.05.014","article-title":"A methodology for identifying similar days in air traffic flow management initiative planning","volume":"69","author":"Kuhn","year":"2016","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib47","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ijforecast.2007.02.006","article-title":"Providing support for the use of analogies in demand forecasting tasks","volume":"23","author":"Lee","year":"2007","journal-title":"Int J Forecast"},{"key":"10.1007\/s13676-018-0132-0_bib48","doi-asserted-by":"crossref","unstructured":"Liu FT, Ting KM, Zhou ZH (2008a) Isolation forest. In: Eighth IEEE international conference on data mining, 2008. IEEE, pp 413\u2013422","DOI":"10.1109\/ICDM.2008.17"},{"issue":"7","key":"10.1007\/s13676-018-0132-0_bib49","first-page":"685","article-title":"Scenario-based air traffic flow management: from theory to practice","volume":"42","author":"PcB","year":"2008","journal-title":"Transp Res Part B Methodol"},{"key":"10.1007\/s13676-018-0132-0_bib50","doi-asserted-by":"crossref","first-page":"54","DOI":"10.3141\/2400-07","article-title":"Evaluation of the performance of ground delay programs","volume":"2400","author":"Liu","year":"2013","journal-title":"Transp Res Rec J Transp Res Board"},{"issue":"5","key":"10.1007\/s13676-018-0132-0_bib51","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1002\/smj.962","article-title":"Robust analogizing and the outside view: two empirical tests of case-based decision making","volume":"33","author":"Lovallo","year":"2012","journal-title":"Strateg Manag J"},{"key":"10.1007\/s13676-018-0132-0_bib52","doi-asserted-by":"crossref","unstructured":"Miheli\u010d J, Robi\u010d B (2003) Approximation algorithms for the k-center problem: an experimental evaluation. In: Operations research Proceedings 2002. Springer, pp 371\u2013376","DOI":"10.1007\/978-3-642-55537-4_60"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib53","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1137\/1012016","article-title":"The m-center problem","volume":"12","author":"Minieka","year":"1970","journal-title":"SIAM Rev"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib54","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","article-title":"Solving the p-center problem with tabu search and variable neighborhood search","volume":"42","author":"Mladenovi\u0107","year":"2003","journal-title":"Networks"},{"issue":"4","key":"10.1007\/s13676-018-0132-0_bib55","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/trsc.1070.0210","article-title":"A dynamic stochastic model for the single airport ground holding problem","volume":"41","author":"Mukherjee","year":"2007","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-018-0132-0_bib56","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/j.energy.2016.06.081","article-title":"Carpe diem: A novel approach to select representative days for long-term power system modeling","volume":"112","author":"Nahmmacher","year":"2016","journal-title":"Energy"},{"issue":"2","key":"10.1007\/s13676-018-0132-0_bib57","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10462-010-9165-y","article-title":"A review of instance selection methods","volume":"34","author":"Olvera-L\u00f3pez","year":"2010","journal-title":"Artif Intell Rev"},{"issue":"2","key":"10.1007\/s13676-018-0132-0_bib58","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","article-title":"A simple and fast algorithm for k-medoids clustering","volume":"36","author":"Park","year":"2009","journal-title":"Expert Syst Appl"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib59","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","article-title":"On estimation of a probability density function and mode","volume":"33","author":"Parzen","year":"1962","journal-title":"Ann Math Stat"},{"key":"10.1007\/s13676-018-0132-0_bib60","unstructured":"Penny S, Lewis T, Hoffman B, White T, Krozel J (2009) Cluster analysis for the annualization of ACES simulated NAS metrics. Technical report, Metron Aviation"},{"key":"10.1007\/s13676-018-0132-0_bib61","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1109\/TPWRS.2016.2596803","article-title":"Selecting representative days for capturing the implications of integrating intermittent renewables in generation expansion planning problems","volume":"32","author":"Poncelet","year":"2017","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib62","doi-asserted-by":"crossref","first-page":"225","DOI":"10.2498\/cit.2005.03.05","article-title":"Solving the k-center problem efficiently with a dominating set algorithm","volume":"13","author":"Robi\u010d","year":"2005","journal-title":"CIT J Comput Inf Technol"},{"issue":"3","key":"10.1007\/s13676-018-0132-0_bib63","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1214\/aoms\/1177728190","article-title":"Remarks on some nonparametric estimates of a density function","volume":"27","author":"Rosenblatt","year":"1956","journal-title":"Ann Math Stat"},{"year":"2015","series-title":"Multivariate density estimation: theory, practice, and visualization","author":"Scott","key":"10.1007\/s13676-018-0132-0_bib64"},{"key":"10.1007\/s13676-018-0132-0_bib65","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3141\/2325-09","article-title":"Consensus-building mechanism for setting service expectations in air traffic flow management","volume":"2325","author":"Swaroop","year":"2013","journal-title":"Transp Res Rec J Transp Res Board"},{"year":"2014","series-title":"Introduction to data mining","author":"Tan","key":"10.1007\/s13676-018-0132-0_bib66"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib67","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TSMCC.2010.2103939","article-title":"A taxonomy and experimental study on prototype generation for nearest neighbor classification","volume":"42","author":"Triguero","year":"2012","journal-title":"IEEE Trans Syst Man Cybern Part C (Appl Rev)"},{"issue":"4157","key":"10.1007\/s13676-018-0132-0_bib68","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1126\/science.185.4157.1124","article-title":"Judgment under uncertainty: heuristics and biases","volume":"185","author":"Tversky","year":"1974","journal-title":"Science"},{"issue":"1","key":"10.1007\/s13676-018-0132-0_bib69","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/040608635","article-title":"Graph clustering via a discrete uncoupling process","volume":"30","author":"Van Dongen","year":"2008","journal-title":"SIAM J Matrix Anal Appl"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-018-0132-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-018-0132-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-018-0132-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:44:29Z","timestamp":1761882269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":69,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["S2192437620300340"],"URL":"https:\/\/doi.org\/10.1007\/s13676-018-0132-0","relation":{},"ISSN":["2192-4376"],"issn-type":[{"type":"print","value":"2192-4376"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Unsupervised prototype reduction for data exploration and an application to air traffic management initiatives","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-018-0132-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2018 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}