乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T16:34:18Z","timestamp":1712939658209},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,23]],"date-time":"2009-01-23T00:00:00Z","timestamp":1232668800000},"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":[[2010,1]]},"DOI":"10.1007\/s10115-008-0190-y","type":"journal-article","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T11:50:40Z","timestamp":1232625040000},"page":"1-26","source":"Crossref","is-referenced-by-count":19,"title":["Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space"],"prefix":"10.1007","volume":"22","author":[{"given":"Ming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Reda","family":"Alhajj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,23]]},"reference":[{"key":"190_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10115-004-0149-6","volume":"7","author":"J An","year":"2005","unstructured":"An J, Chen H, Furuse K, Ohbo N (2005) CVA file: an index structure for high-dimensional datasets. Knowl Inform Syst 7: 337\u2013357","journal-title":"Knowl Inform Syst"},{"issue":"1","key":"190_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Comm ACM 51(1): 117\u2013122","journal-title":"Comm ACM"},{"key":"190_CR3","unstructured":"Berchtold S, Keim D, Kriegel HP (1996) The X-tree: an index structure for high-dimensional data. In: Proceedings of VLDB"},{"key":"190_CR4","doi-asserted-by":"crossref","unstructured":"Beyer K et\u00a0al (1999) When is \u201cNearest Neighbor\u201d meaningful? In: Proceedings of IEEE ICDE","DOI":"10.1007\/3-540-49257-7_15"},{"key":"190_CR5","doi-asserted-by":"crossref","unstructured":"Bozkaya T, Ozsoyoglu M (1997) Distance-based indexing for high-dimensional metric spaces. In: Proceedings of ACM SIGMOD, pp 357\u2013368","DOI":"10.1145\/253260.253345"},{"key":"190_CR6","unstructured":"Brin S (1995) Near neighbor search in large metric spaces. In: Proceedings of VLDB, pp 574\u2013584"},{"issue":"4","key":"190_CR7","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"WA Burkhard","year":"1973","unstructured":"Burkhard WA, Keller RM (1973) Some approaches to best-match file searching. Comm ACM 16(4): 230\u2013236","journal-title":"Comm ACM"},{"issue":"9","key":"190_CR8","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E Chavez","year":"2005","unstructured":"Chavez E, Navarro G (2005) A compact space decomposition for effective metric indexing. Pattern Recognit Lett 26(9): 1363\u20131376","journal-title":"Pattern Recognit Lett"},{"key":"190_CR9","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-Tree: an efficient access method for similarity search in metric spaces. VLDB J 426\u2013435"},{"key":"190_CR10","unstructured":"Data set is available at: http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.html"},{"issue":"3","key":"190_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TKDE.2005.46","volume":"17","author":"B Cui","year":"2005","unstructured":"Cui B, Ooi BC, Su J, Tan T (2005) Indexing high-dimensional data for efficient in-memory similarity search. IEEE Trans Knowl Data Eng 17(3): 339\u2013353","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"19","key":"190_CR12","first-page":"33","volume":"21","author":"V Dohnal","year":"2003","unstructured":"Dohnal V et\u00a0al (2003) D-index: distance searching index for metric data sets. Multimedia Tools Appl 21(19): 33","journal-title":"Multimedia Tools Appl"},{"key":"190_CR13","doi-asserted-by":"crossref","unstructured":"Filho RFS, Traina AJM, Traina C, Faloutsos C (2001) Similarity search without tears: the OMNI family of all-purpose access methods. In: Proceedings of IEEE ICDE, pp 623\u2013630","DOI":"10.1109\/ICDE.2001.914877"},{"key":"190_CR14","doi-asserted-by":"crossref","unstructured":"Fu AW-C et\u00a0al (2000) Dynamic VP-tree indexing for N-Nearest search given pair-wise distances. VLDB J","DOI":"10.1007\/PL00010672"},{"key":"190_CR15","unstructured":"Source code is available at http:\/\/www.cs.mu.oz.au\/~rui\/code.htm"},{"issue":"2","key":"190_CR16","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2): 364\u2013397","journal-title":"ACM Trans Database Syst"},{"key":"190_CR17","doi-asserted-by":"crossref","unstructured":"Katamaya N, Satoh S (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of ACM SIGMOD","DOI":"10.1145\/253260.253347"},{"key":"190_CR18","unstructured":"Data set is available at: http:\/\/kodiak.cs.cornell.edu\/kddcup\/datasets.html"},{"issue":"2","key":"190_CR19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10115-006-0018-6","volume":"10","author":"K Kailing","year":"2006","unstructured":"Kailing K, Kriegel H-P, Pfeifle M, Schonauer S (2006) Extending metric index structures for efficient range query processing. Knowl Inform Syst 10(2): 211\u2013227","journal-title":"Knowl Inform Syst"},{"key":"190_CR20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10115-007-0097-z","volume":"15","author":"S Kadiyala","year":"2008","unstructured":"Kadiyala S, Shiri N (2008) A compact multi-resolution index for variable length queries in time series databases. Knowl Inform Syst 15: 131\u2013147","journal-title":"Knowl Inform Syst"},{"issue":"2","key":"190_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe DG (2004) Distinctive image features from scale invariant features. IJCV 60(2): 91\u2013110","journal-title":"IJCV"},{"key":"190_CR22","doi-asserted-by":"crossref","unstructured":"Nievergelt J, Hinterberger H, Sevcik KC (1984) The grid file: an adaptable, symmetric multikey file structure. ACM Trans Database Syst 9(1)","DOI":"10.1145\/348.318586"},{"key":"190_CR23","volume-title":"Rough sets theoretical aspects of reasoning about data","author":"Z Pawlak","year":"1991","unstructured":"Pawlak Z (1991) Rough sets theoretical aspects of reasoning about data. Kluwer, Dordrecht"},{"key":"190_CR24","doi-asserted-by":"crossref","unstructured":"Seidl T, Kriegel HP (1998) Optimal multi-step k-nearest neighbor search. In: Proceedings of ACM SIGMOD","DOI":"10.1145\/276304.276319"},{"key":"190_CR25","doi-asserted-by":"crossref","unstructured":"Shaft U, Ramakrishnan R (2005) When is nearest neighbors indexable? In: Proceedings of ICDT, pp 158\u2013172","DOI":"10.1007\/978-3-540-30570-5_11"},{"key":"190_CR26","doi-asserted-by":"crossref","unstructured":"Traina C, Traina AJM, Seeger B, Faloutsos C (2000) Slim-trees: highet performance metric trees minimizing overlap between nodes. In: Proceedings of EDBT, pp 51\u201365","DOI":"10.1007\/3-540-46439-5_4"},{"key":"190_CR27","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inform Process Lett 40: 175\u2013179","journal-title":"Inform Process Lett"},{"key":"190_CR28","unstructured":"Venkateswaran J, Lachwani D, Kahveci T, Jermaine C (2006) Reference-based indexing of sequences databases. In: Proceedings of VLDB"},{"key":"190_CR29","unstructured":"Vieira MR, Traina C, Chino FJT, Traina AJM (2004) DBM-tree: a dynamic metric access method sensitive to local density data. In: Proceedings of SBBD, pp 163\u2013177"},{"key":"190_CR30","unstructured":"Source code is available at: http:\/\/www.cse.cuhk.edu.hk\/~kdd\/program.html"},{"key":"190_CR31","doi-asserted-by":"crossref","unstructured":"White DA, Jain R (1996) Similarity indexing with the ss-tree. In: Proceedings of IEEE ICDE","DOI":"10.1109\/ICDE.1996.492202"},{"key":"190_CR32","unstructured":"Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional space. In: Proceedings of VLDB"},{"key":"190_CR33","unstructured":"Yianilos P (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of ACM-SIAM symposium on discrete algorithms, pp 311\u2013321"},{"key":"190_CR34","unstructured":"Yianilos P (1999) Excluded middle vantage point forests for nearest neighbor search. In: Implementation challenge, ALENEX\u201999"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0190-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-008-0190-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0190-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:18Z","timestamp":1559110218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-008-0190-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,23]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s10115-008-0190-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,23]]}}}