{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:05:31Z","timestamp":1777449931470,"version":"3.51.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319490540","type":"print"},{"value":"9783319490557","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49055-7_19","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:02:34Z","timestamp":1478268154000},"page":"207-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["XNN Graph"],"prefix":"10.1007","author":[{"given":"Pasi","family":"Fr\u00e4nti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Mariescu-Istodor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caiming","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"19","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1016\/j.tcs.2009.01.009","volume":"410","author":"M Maier","year":"2009","unstructured":"Maier, M., Hein, M., von Luxburg, U.: Optimal construction of kk-nearest-neighbor graphs for identifying noisy clusters. Theoret. Comput. Sci. 410(19), 1749\u20131764 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Aoyama, K., Saito, K., Sawada, H., Ueda, N.: Fast approximate similarity search based on degree-reduced neighborhood graphs. In: ACM SIGKDD, San Diego, USA, pp. 1055\u20131063 (2011)","DOI":"10.1145\/2020408.2020576"},{"issue":"10","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1109\/TPAMI.2005.192","volume":"27","author":"L Yang","year":"2005","unstructured":"Yang, L.: Building k edge-disjoint spanning trees of minimum total length for isometric data embedding. IEEE Trans. Pattern Anal. Mach. Intell. 27(10), 1680\u20131683 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: New statistical approach to geographic variation analysis. Syst. Zool. 18, 259\u2013278 (1969)","journal-title":"Syst. Zool."},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"DW Matula","year":"1980","unstructured":"Matula, D.W., Sokal, R.R.: Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geogr. Anal. 12(3), 205\u2013222 (1980)","journal-title":"Geogr. Anal."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.cad.2006.02.008","volume":"38","author":"JC Park","year":"2006","unstructured":"Park, J.C., Shin, H., Choi, B.K.: Elliptic gabriel graph for finding neighbors in a point set and its application to normal vector estimation. Comput. Aided Des. 38, 619\u2013626 (2006)","journal-title":"Comput. Aided Des."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.patrec.2014.09.007","volume":"52","author":"T Inkaya","year":"2015","unstructured":"Inkaya, T., Kayaligil, S., \u00d6zdemirel, N.E.: An adaptive neighborhood construction algorithm based on density and connectivity. Pattern Recogn. Lett. 52, 17\u201324 (2015)","journal-title":"Pattern Recogn. Lett."},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0010-4485(97)00082-1","volume":"30","author":"P Cignoni","year":"1998","unstructured":"Cignoni, P., Montani, C., Scopigno, R.: DeWall: a fast divide and conquer Delaunay triangulation algorithm in E^d. Comput. Aided Des. 30(5), 333\u2013341 (1998)","journal-title":"Comput. Aided Des."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Rezafinddramana, O., Rayat, F., Venturin, G.: Incremental Delaunay triangulation construction for clustering. In: International Conference on Pattern Recognition, ICPR, Stockholm, Sweden, pp. 1354\u20131359 (2014)","DOI":"10.1109\/ICPR.2014.242"},{"issue":"11","key":"19_CR11","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1117\/1.601531","volume":"36","author":"P Fr\u00e4nti","year":"1997","unstructured":"Fr\u00e4nti, P., Kaukoranta, T., Nevalainen, O.: On the splitting method for VQ codebook generation. Opt. Eng. 36(11), 3043\u20133051 (1997)","journal-title":"Opt. Eng."},{"key":"19_CR12","first-page":"513","volume":"25","author":"B Fischer","year":"2003","unstructured":"Fischer, B., Buhmann, J.M.: Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 25, 513\u2013518 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","volume":"41","author":"H Chang","year":"2008","unstructured":"Chang, H., Yeung, D.Y.: Robust path-based spectral clustering. Pattern Recogn. 41(1), 191\u2013203 (2008)","journal-title":"Pattern Recogn."},{"issue":"8","key":"19_CR14","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1109\/TKDE.2016.2551240","volume":"28","author":"M Rezaei","year":"2016","unstructured":"Rezaei, M., Fr\u00e4nti, P.: Set-matching methods for external cluster validity. IEEE Trans. Knowl. Data Eng. 28(8), 2173\u20132186 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"19_CR15","first-page":"1429","volume":"9","author":"J Gou","year":"2012","unstructured":"Gou, J., Du, L., Zhang, Y., Xiong, T.: A new distance-weighted k-nearest neighbor classifier. J. Inf. Comput. Sci. 9(6), 1429\u20131436 (2012)","journal-title":"J. Inf. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49055-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:01:57Z","timestamp":1710262917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49055-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490540","9783319490557"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49055-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00e9rida","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}