{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T09:57:10Z","timestamp":1707818230422},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10115-004-0149-6","type":"journal-article","created":{"date-parts":[[2004,5,12]],"date-time":"2004-05-12T16:44:46Z","timestamp":1084380286000},"page":"337-357","source":"Crossref","is-referenced-by-count":9,"title":["CVA file: an index structure for high-dimensional datasets"],"prefix":"10.1007","volume":"7","author":[{"given":"Jiyuan","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanxiong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutaka","family":"Furuse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuo","family":"Ohbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,3,1]]},"reference":[{"key":"149_CRAHK01","doi-asserted-by":"crossref","unstructured":"Aggarwal C et al (2001) On the surprising behavior of distance metrics in high dimensional spaces. In: Proceedings of the 8th international conference on database theory, pp 420\u2013434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"149_CRAPW99","doi-asserted-by":"crossref","unstructured":"Aggarwal C et al (1999) Fast algorithms for projected clustering. In: Proceedings of the 1999 ACM SIGMOD international conference on management of data, pp 61\u201372","DOI":"10.1145\/304182.304188"},{"key":"149_CRACF02xxx1","unstructured":"An J et al (2002) The convex polyhedra technique: an index structure for high-dimensional space. In: Proceedings of the 13th Australasian database conference, pp 33\u201340"},{"key":"149_CRACF03","doi-asserted-by":"crossref","unstructured":"An J et al (2003) Grids-based indexing of large time series databases. In: 4th international conference on intelligent data engineering and automated learning. Lecture notes in computer science, vol 2690, pp 614\u2013621","DOI":"10.1007\/978-3-540-45080-1_83"},{"key":"149_CRBM99","unstructured":"Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley"},{"key":"149_CRBKS90","doi-asserted-by":"crossref","unstructured":"Beckmann N et al (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"149_CRBBK96","unstructured":"Berchtold S et al (1996) The X-tree: an index structure for high-dimensional data. In: Proceedings of 26th international conference on very large data bases, pp 28\u201339"},{"key":"149_CRBBK97","doi-asserted-by":"crossref","unstructured":"Berchtold S et al (1997) A cost model for nearest neighbor search in high-dimensional data space. In: ACM PODS symposium on principles of database systems, pp 78\u201386","DOI":"10.1145\/263661.263671"},{"key":"149_CRBGR99","doi-asserted-by":"crossref","unstructured":"Beyer KS et al (1999) When is \u201cnearest neighbor\u201d meaningful. In: Proceedings of the 7th internation conference on database theory, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"149_CRCM00","unstructured":"Chakrabarti K, Mehrotra S (2000) Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: Proceedings of 26th international conference on very large data bases, pp 151\u2013162"},{"key":"149_CRCAF02","doi-asserted-by":"crossref","unstructured":"Chen H et al (2002) C2VA: trim high dimensional indexes. In: Third international conference on advances in web-age information management. Lecture notes in computer science, vol 2419, pp 303\u2013315","DOI":"10.1007\/3-540-45703-8_28"},{"key":"149_CRFBF94","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"Faloutsos","year":"1994","unstructured":"Faloutsos C et al (1994a) Efficient and effective querying by image content. J Intell Inf Syst 3:231\u2013262","journal-title":"J Intell Inf Syst"},{"key":"149_CRFL95","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Lin KI (1995) FastMap: a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data, pp 163\u2013174","DOI":"10.1145\/223784.223812"},{"key":"149_CRFRM94","doi-asserted-by":"crossref","unstructured":"Faloutsos C et al (1994b) Fast subsequence matching in time series databases. In: Proceedings of the 1994 ACM SIGMOD international conference on management of data, pp 419\u2013429","DOI":"10.1145\/191839.191925"},{"key":"149_CRFFF99","doi-asserted-by":"crossref","unstructured":"Faloutsos MFP, Faloutsos C (1999) On power-law relationships of the Internet topology. In: Proceedings of the 1999 ACM SIGCOMM, pp 251\u2013262","DOI":"10.1145\/316188.316229"},{"key":"149_CRF90","unstructured":"Fukunaga K (1990) Statistical pattern recognition. Academic"},{"key":"149_CRKS97","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the 1997 ACM SIGMOD international conference on management of data, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"149_CRSAI00","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF03037567","volume":"18","author":"Shinohara","year":"2000","unstructured":"Shinohara T et al (2000) Approximate retrieval of high-dimensional data with L 1 metric by spatial indexing. New Generation Comput 18:39\u201347","journal-title":"New Generation Comput"},{"key":"149_CRWSB98","unstructured":"Weber R et al (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of 24th international conference on very large data bases, pp 194\u2013205"},{"key":"149_CRZ49","first-page":"an","volume":"effort","author":"Zipf","year":"1949","unstructured":"Zipf G (1949) Human behavior and principle of least effort: an introduction to human ecology. Addison, Cambridge, MA","journal-title":"Human behavior and principle of least"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0149-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-004-0149-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0149-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:13Z","timestamp":1559110213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-004-0149-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s10115-004-0149-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}