{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:19:54Z","timestamp":1777889994857,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2018,8,27]]},"DOI":"10.3233\/sw-170285","type":"journal-article","created":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T10:24:09Z","timestamp":1510309449000},"page":"589-604","source":"Crossref","is-referenced-by-count":7,"title":["A systematic survey of point set distance measures for link discovery"],"prefix":"10.1177","volume":"9","author":[{"given":"Mohamed","family":"Ahmed Sherif","sequence":"first","affiliation":[{"name":"Data Science Group, Paderborn University, Pohlweg 51, D-33098 Paderborn, Germany. E-mails:\u00a0mohamed.sherif@uni-paderborn.de,\u00a0axel.ngonga@uni-paderborn.de"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel-Cyrille","family":"Ngonga Ngomo","sequence":"additional","affiliation":[{"name":"Data Science Group, Paderborn University, Pohlweg 51, D-33098 Paderborn, Germany. E-mails:\u00a0mohamed.sherif@uni-paderborn.de,\u00a0axel.ngonga@uni-paderborn.de"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"01n02","key":"10.3233\/SW-170285_ref1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","article-title":"Computing the Fr\u00e9chet distance between two polygonal curves","volume":"5","author":"Alt","year":"1995","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"8","key":"10.3233\/SW-170285_ref3","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/0031-3203(91)90045-7","article-title":"Computing some distance functions between polygons","volume":"24","author":"Atallah","year":"1991","journal-title":"Pattern Recognition"},{"key":"10.3233\/SW-170285_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04930-9_46"},{"key":"10.3233\/SW-170285_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23032-5_1"},{"key":"10.3233\/SW-170285_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63307-3_60"},{"issue":"2","key":"10.3233\/SW-170285_ref7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s004540010081","article-title":"Voronoi diagrams for convex polygon-offset distance functions","volume":"25","author":"Barequet","year":"2001","journal-title":"Discrete & Computational Geometry"},{"issue":"8","key":"10.3233\/SW-170285_ref8","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/j.cagd.2010.04.004","article-title":"Precise Hausdorff distance computation between polygonal meshes","volume":"27","author":"Barto\u0148","year":"2010","journal-title":"Computer Aided Geometric Design"},{"issue":"2","key":"10.3233\/SW-170285_ref9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0196-6774(83)90040-8","article-title":"Efficient algorithms for computing the maximum distance between two finite planar sets","volume":"4","author":"Bhattacharya","year":"1983","journal-title":"Journal of Algorithms"},{"issue":"1","key":"10.3233\/SW-170285_ref10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02521760","article-title":"The direct and inverse solutions for the great elliptic line on the reference ellipsoid","volume":"58","author":"Bowring","year":"1984","journal-title":"Bulletin G\u00e9od\u00e9sique"},{"issue":"3","key":"10.3233\/SW-170285_ref11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.comgeo.2009.02.008","article-title":"Homotopic Fr\u00e9chet distance between curves or, walking your dog in the woods in polynomial time","volume":"43","author":"Chambers","year":"2010","journal-title":"Computational Geometry"},{"key":"10.3233\/SW-170285_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41338-4_19"},{"key":"10.3233\/SW-170285_ref13","doi-asserted-by":"publisher","DOI":"10.5194\/isprsarchives-XL-2-W1-35-2013"},{"key":"10.3233\/SW-170285_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22300-6_23"},{"issue":"1","key":"10.3233\/SW-170285_ref15","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00454-012-9402-z","article-title":"Approximating the Fr\u00e9chet distance for realistic curves in near linear time","volume":"48","author":"Driemel","year":"2012","journal-title":"Discrete & Computational Geometry"},{"key":"10.3233\/SW-170285_ref16","unstructured":"R.O.\u00a0Duda, P.E.\u00a0Hart and D.G.\u00a0Stork, Pattern Classification, 2nd edn, Wiley, 2001. http:\/\/www.worldcat.org\/oclc\/41347061."},{"issue":"2","key":"10.3233\/SW-170285_ref17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s002360050075","article-title":"Distance measures for point sets and their computation","volume":"34","author":"Eiter","year":"1997","journal-title":"Acta Informatica"},{"key":"10.3233\/SW-170285_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21064-8_8"},{"issue":"1","key":"10.3233\/SW-170285_ref19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03018603","article-title":"Sur quelques points du calcul fonctionnel","volume":"22","author":"Fr\u00e9chet","year":"1906","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"key":"10.3233\/SW-170285_ref20","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-672-9-948"},{"issue":"2","key":"10.3233\/SW-170285_ref21","first-page":"41","article-title":"Fast and accurate Hausdorff distance calculation between meshes","volume":"13","author":"Guthe","year":"2005","journal-title":"Journal of WSCG"},{"key":"10.3233\/SW-170285_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/142675.142700"},{"key":"10.3233\/SW-170285_ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653825"},{"key":"10.3233\/SW-170285_ref25","unstructured":"W.A.\u00a0Mackaness, A.\u00a0Ruas and L.T.\u00a0Sarjakoski\u00a0(eds), Generalisation of Geographic Information: Cartographic Modelling and Applications, International Cartographic Association, Elsevier, 2011. https:\/\/www.elsevier.com\/books\/generalisation-of-geographic-information\/mackaness\/978-0-08-045374-3."},{"issue":"12","key":"10.3233\/SW-170285_ref26","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/0898-1221(85)90109-9","article-title":"Finding the minimum vertex distance between two disjoint convex polygons in linear time","volume":"11","author":"McKenna","year":"1985","journal-title":"Computers & Mathematics with Applications"},{"issue":"2","key":"10.3233\/SW-170285_ref27","doi-asserted-by":"publisher","first-page":"74","DOI":"10.3138\/3535-7609-781G-4L20","article-title":"Automated line generalization","volume":"24","author":"McMaster","year":"1987","journal-title":"Cartographica: The International Journal for Geographic Information and Geovisualization"},{"key":"10.3233\/SW-170285_ref28","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pmed.1000097"},{"issue":"3","key":"10.3233\/SW-170285_ref29","doi-asserted-by":"publisher","first-page":"419","DOI":"10.3233\/SW-150210","article-title":"A survey of current link discovery frameworks","volume":"8","author":"Nentwig","year":"2017","journal-title":"Semantic Web"},{"issue":"4","key":"10.3233\/SW-170285_ref30","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s13740-012-0012-y","article-title":"On link discovery using a hybrid approach","volume":"1","author":"Ngonga Ngomo","year":"2012","journal-title":"Journal on Data Semantics"},{"key":"10.3233\/SW-170285_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41335-3_25"},{"key":"10.3233\/SW-170285_ref32","unstructured":"B.G.\u00a0Nickerson and H.\u00a0Freeman, Development of a rule-based system for automatic map generalization, in: Proceedings, Second International Symposium on Spatial Data Handling: July 5\u201310, 1986, Seattle, Washington, U.S.A., International Geographical Union, Commission on Geographical Data Sensing and Processing, 1986, pp.\u00a0537\u2013556."},{"key":"10.3233\/SW-170285_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-3739-0"},{"key":"10.3233\/SW-170285_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30284-8_15"},{"key":"10.3233\/SW-170285_ref35","unstructured":"X.\u00a0Niu, S.\u00a0Rong, Y.\u00a0Zhang and H.\u00a0Wang, Zhishi.links results for OAEI 2011, in: Proceedings of the 6th International Workshop on Ontology Matching, Bonn, Germany, October 24, 2011, P.\u00a0Shvaiko, J.\u00a0Euzenat, T.\u00a0Heath, C.\u00a0Quix, M.\u00a0Mao and I.F.\u00a0Cruz, eds, CEUR Workshop Proceedings, Vol.\u00a0814, CEUR-WS.org, 2011. http:\/\/ceur-ws.org\/Vol-814\/oaei11_paper16.pdf."},{"issue":"8","key":"10.3233\/SW-170285_ref36","doi-asserted-by":"publisher","first-page":"506","DOI":"10.14778\/2002974.2002978","article-title":"An incremental Hausdorff distance calculation algorithm","volume":"4","author":"Nutanong","year":"2011","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2\u20134","key":"10.3233\/SW-170285_ref37","first-page":"227","article-title":"Verisimilitude and distance in logical space","volume":"30","author":"Oddie","year":"1978","journal-title":"The logic and epistemology of scientific change, Acta Philosophica Fennica"},{"key":"10.3233\/SW-170285_ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351059"},{"issue":"10","key":"10.3233\/SW-170285_ref39","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/PL00013304","article-title":"A polynomial time computable metric between point sets","volume":"37","author":"Ramon","year":"2001","journal-title":"Acta Informatica"},{"key":"10.3233\/SW-170285_ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2506182.2506200"},{"key":"10.3233\/SW-170285_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36077-8_18"},{"key":"10.3233\/SW-170285_ref42","unstructured":"M.A.\u00a0Sherif, K.\u00a0Dre\u00dfler, P.\u00a0Smeros and A.\u00a0Ngonga Ngomo, Radon\u00a0\u2013 rapid discovery of topological relations, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4\u20139, 2017, San Francisco, California, USA, S.P.\u00a0Singh and S.\u00a0Markovitch, eds, AAAI Press, 2017, pp.\u00a0175\u2013181. http:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/14199."},{"key":"10.3233\/SW-170285_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58068-5_7"},{"key":"10.3233\/SW-170285_ref44","unstructured":"P.\u00a0Smeros and M.\u00a0Koubarakis, Discovering spatial and temporal links among RDF data, in: Proceedings of the Workshop on Linked Data on the Web, LDOW 2016, Co-Located with 25th International World Wide Web Conference (WWW 2016), S.\u00a0Auer, T.\u00a0Berners-Lee, C.\u00a0Bizer and T.\u00a0Heath, eds, CEUR Workshop Proceedings, Vol.\u00a01593, CEUR-WS.org, 2016. http:\/\/ceur-ws.org\/Vol-1593\/article-06.pdf."},{"key":"10.3233\/SW-170285_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_8"},{"issue":"3","key":"10.3233\/SW-170285_ref46","doi-asserted-by":"publisher","first-page":"74:1","DOI":"10.1145\/1531326.1531380","article-title":"Interactive Hausdorff distance computation for general polygonal models","volume":"28","author":"Tang","year":"2009","journal-title":"ACM Transactions on Graphics"},{"issue":"2","key":"10.3233\/SW-170285_ref47","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0167-8655(83)90041-7","article-title":"Optimal algorithms for computing the minimum distance between two finite planar sets","volume":"2","author":"Toussaint","year":"1983","journal-title":"Pattern Recognition Letters"},{"key":"10.3233\/SW-170285_ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04930-9_41"},{"key":"10.3233\/SW-170285_ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-170285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:23:52Z","timestamp":1777613032000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-170285"}},"subtitle":[],"editor":[{"given":"Claudia","family":"d\u2019Amato","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Bari, Italy"}],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,8,27]]},"references-count":47,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/sw-170285","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8,27]]}}}