{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:30:32Z","timestamp":1757543432869,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,8]]},"DOI":"10.1109\/ijcnn.2007.4371431","type":"proceedings-article","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T20:35:49Z","timestamp":1194381349000},"page":"2959-2964","source":"Crossref","is-referenced-by-count":24,"title":["Intrinsic dimension of a dataset: what properties does one expect?"],"prefix":"10.1109","author":[{"given":"Vladimir","family":"Pestov","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Asymptotic theory of finite-dimensionalnormed spaces (with an Appendix by M. Gromov)","volume":"1200","author":"milman","year":"1986","journal-title":"Lecture Notes in Math"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.1999.795158"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00156-8"},{"key":"ref13","first-page":"367","article-title":"Indexing schemes for similarity search: an illustrated paradigm","volume":"70","author":"pestov","year":"2006","journal-title":"Fund Inform"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.046212"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.167"},{"key":"ref16","article-title":"Distance exponent: A new concept for selectivity estimation in metric trees","author":"traina","year":"1999","journal-title":"Technical Report CMU-CS-99-110 Computer Science Department Carnegie Mellon University"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.831130"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"ref6","first-page":"681","article-title":"Intrinsic dimension estimation using packing numbers","volume":"15","author":"\u00e9gl","year":"2003","journal-title":"Advances in Neural Information Processing Systems [NIPS 2002 Vancouver B C Canada]"},{"journal-title":"Metric Structures for Riemannian and Non-Riemannian Spaces Volume 152 of Progress in Mathematics","year":"1999","author":"gromov","key":"ref5"},{"journal-title":"Leçons d'analyse fonctionnelle","year":"1922","author":"l\u00e9vy","key":"ref8"},{"key":"ref7","article-title":"The concentration of measure phenomenon","volume":"89","author":"ledoux","year":"2001","journal-title":"Math Surveys Monogr"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1039212"},{"key":"ref1","first-page":"217","article-title":"When is “nearest neighbor” meaningful?","author":"beyer","year":"1999","journal-title":"Proc Intern Conf on Database Theory (ICDT 99)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0346-0425-3_8"}],"event":{"name":"International Joint Conference on Neural Networks","start":{"date-parts":[[2007,8,12]]},"location":"Orlando, FL","end":{"date-parts":[[2007,8,17]]}},"container-title":["2007 International Joint Conference on Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4370890\/4370891\/04371431.pdf?arnumber=4371431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T01:07:31Z","timestamp":1544749651000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4371431\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2007.4371431","relation":{},"subject":[],"published":{"date-parts":[[2007,8]]}}}